blob: f3a7f7d0712b212d740039f853b04d410f3ee417 [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"
Devang Patel713f0432009-09-16 21:09:07 +000020#include "llvm/Analysis/DebugInfo.h"
Anton Korobeynikov5502bf62007-04-04 21:14:49 +000021#include "llvm/Constants.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000022#include "llvm/Function.h"
Chris Lattnerce7518c2006-01-26 22:24:51 +000023#include "llvm/InlineAsm.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000024#include "llvm/Instructions.h"
25#include "llvm/Intrinsics.h"
Jim Laskey43970fe2006-03-23 18:06:46 +000026#include "llvm/IntrinsicInst.h"
Chris Lattner75c478a2009-10-27 17:02:08 +000027#include "llvm/LLVMContext.h"
Bill Wendling9af7e9a2010-05-26 19:46:12 +000028#include "llvm/Module.h"
Dan Gohman78eca172008-08-19 22:33:34 +000029#include "llvm/CodeGen/FastISel.h"
Gordon Henriksen5a29c9e2008-08-17 12:56:54 +000030#include "llvm/CodeGen/GCStrategy.h"
Gordon Henriksen5eca0752008-08-17 18:44:35 +000031#include "llvm/CodeGen/GCMetadata.h"
Bill Wendlingb92187a2010-05-14 21:14:32 +000032#include "llvm/CodeGen/MachineFrameInfo.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000033#include "llvm/CodeGen/MachineFunction.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000034#include "llvm/CodeGen/MachineInstrBuilder.h"
Chris Lattner84bc5422007-12-31 04:13:23 +000035#include "llvm/CodeGen/MachineModuleInfo.h"
36#include "llvm/CodeGen/MachineRegisterInfo.h"
Dan Gohmanfc54c552009-01-15 22:18:12 +000037#include "llvm/CodeGen/ScheduleHazardRecognizer.h"
Jim Laskeyeb577ba2006-08-02 12:30:23 +000038#include "llvm/CodeGen/SchedulerRegistry.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000039#include "llvm/CodeGen/SelectionDAG.h"
Dan Gohman6f0d0242008-02-10 18:45:23 +000040#include "llvm/Target/TargetRegisterInfo.h"
Dan Gohmane1f188f2009-10-29 22:30:23 +000041#include "llvm/Target/TargetIntrinsicInfo.h"
Chris Lattner1c08c712005-01-07 07:47:53 +000042#include "llvm/Target/TargetInstrInfo.h"
43#include "llvm/Target/TargetLowering.h"
44#include "llvm/Target/TargetMachine.h"
Vladimir Prus12472912006-05-23 13:43:15 +000045#include "llvm/Target/TargetOptions.h"
Chris Lattnera4f0b3a2006-08-27 12:54:02 +000046#include "llvm/Support/Compiler.h"
Evan Chengdb8d56b2008-06-30 20:45:06 +000047#include "llvm/Support/Debug.h"
Torok Edwin7d696d82009-07-11 13:10:19 +000048#include "llvm/Support/ErrorHandling.h"
Evan Chengdb8d56b2008-06-30 20:45:06 +000049#include "llvm/Support/Timer.h"
Daniel Dunbarce63ffb2009-07-25 00:23:56 +000050#include "llvm/Support/raw_ostream.h"
Chris Lattnerc19ae9d2010-03-04 19:46:56 +000051#include "llvm/ADT/Statistic.h"
Jeff Cohen7e881032006-02-24 02:52:40 +000052#include <algorithm>
Chris Lattner1c08c712005-01-07 07:47:53 +000053using namespace llvm;
54
Chris Lattnerc19ae9d2010-03-04 19:46:56 +000055STATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on");
Chris Lattnerbed993d2010-03-28 19:46:56 +000056STATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path");
Chris Lattnerc19ae9d2010-03-04 19:46:56 +000057
Chris Lattneread0d882008-06-17 06:09:18 +000058static cl::opt<bool>
Dan Gohman293d5f82008-09-09 22:06:46 +000059EnableFastISelVerbose("fast-isel-verbose", cl::Hidden,
Dan Gohmand659d502008-10-20 21:30:12 +000060 cl::desc("Enable verbose messages in the \"fast\" "
Dan Gohman293d5f82008-09-09 22:06:46 +000061 "instruction selector"));
62static cl::opt<bool>
Dan Gohman4344a5d2008-09-09 23:05:00 +000063EnableFastISelAbort("fast-isel-abort", cl::Hidden,
64 cl::desc("Enable abort calls when \"fast\" instruction fails"));
Chris Lattneread0d882008-06-17 06:09:18 +000065
Chris Lattnerda8abb02005-09-01 18:44:10 +000066#ifndef NDEBUG
Chris Lattner7944d9d2005-01-12 03:41:21 +000067static cl::opt<bool>
Dan Gohman462dc7f2008-07-21 20:00:07 +000068ViewDAGCombine1("view-dag-combine1-dags", cl::Hidden,
69 cl::desc("Pop up a window to show dags before the first "
70 "dag combine pass"));
71static cl::opt<bool>
72ViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden,
73 cl::desc("Pop up a window to show dags before legalize types"));
74static cl::opt<bool>
75ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
76 cl::desc("Pop up a window to show dags before legalize"));
77static cl::opt<bool>
78ViewDAGCombine2("view-dag-combine2-dags", cl::Hidden,
79 cl::desc("Pop up a window to show dags before the second "
80 "dag combine pass"));
81static cl::opt<bool>
Duncan Sands25cf2272008-11-24 14:53:14 +000082ViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden,
83 cl::desc("Pop up a window to show dags before the post legalize types"
84 " dag combine pass"));
85static cl::opt<bool>
Evan Chenga9c20912006-01-21 02:32:06 +000086ViewISelDAGs("view-isel-dags", cl::Hidden,
87 cl::desc("Pop up a window to show isel dags as they are selected"));
88static cl::opt<bool>
89ViewSchedDAGs("view-sched-dags", cl::Hidden,
90 cl::desc("Pop up a window to show sched dags as they are processed"));
Dan Gohman3e1a7ae2007-08-28 20:32:58 +000091static cl::opt<bool>
92ViewSUnitDAGs("view-sunit-dags", cl::Hidden,
Chris Lattner5bab7852008-01-25 17:24:52 +000093 cl::desc("Pop up a window to show SUnit dags after they are processed"));
Chris Lattner7944d9d2005-01-12 03:41:21 +000094#else
Dan Gohman462dc7f2008-07-21 20:00:07 +000095static const bool ViewDAGCombine1 = false,
96 ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false,
97 ViewDAGCombine2 = false,
Duncan Sands25cf2272008-11-24 14:53:14 +000098 ViewDAGCombineLT = false,
Dan Gohman462dc7f2008-07-21 20:00:07 +000099 ViewISelDAGs = false, ViewSchedDAGs = false,
100 ViewSUnitDAGs = false;
Chris Lattner7944d9d2005-01-12 03:41:21 +0000101#endif
102
Jim Laskeyeb577ba2006-08-02 12:30:23 +0000103//===---------------------------------------------------------------------===//
104///
105/// RegisterScheduler class - Track the registration of instruction schedulers.
106///
107//===---------------------------------------------------------------------===//
108MachinePassRegistry RegisterScheduler::Registry;
109
110//===---------------------------------------------------------------------===//
111///
112/// ISHeuristic command line option for instruction schedulers.
113///
114//===---------------------------------------------------------------------===//
Dan Gohman844731a2008-05-13 00:00:25 +0000115static cl::opt<RegisterScheduler::FunctionPassCtor, false,
116 RegisterPassParser<RegisterScheduler> >
117ISHeuristic("pre-RA-sched",
118 cl::init(&createDefaultScheduler),
119 cl::desc("Instruction schedulers available (before register"
120 " allocation):"));
Jim Laskey13ec7022006-08-01 14:21:23 +0000121
Dan Gohman844731a2008-05-13 00:00:25 +0000122static RegisterScheduler
Dan Gohmanb8cab922008-10-14 20:25:08 +0000123defaultListDAGScheduler("default", "Best scheduler for the target",
Dan Gohman844731a2008-05-13 00:00:25 +0000124 createDefaultScheduler);
Evan Cheng4ef10862006-01-23 07:01:07 +0000125
Chris Lattner1c08c712005-01-07 07:47:53 +0000126namespace llvm {
127 //===--------------------------------------------------------------------===//
Jim Laskey9373beb2006-08-01 19:14:14 +0000128 /// createDefaultScheduler - This creates an instruction scheduler appropriate
129 /// for the target.
Dan Gohman47ac0f02009-02-11 04:27:20 +0000130 ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS,
Bill Wendling98a366d2009-04-29 23:29:43 +0000131 CodeGenOpt::Level OptLevel) {
Dan Gohmane9530ec2009-01-15 16:58:17 +0000132 const TargetLowering &TLI = IS->getTargetLowering();
133
Bill Wendling98a366d2009-04-29 23:29:43 +0000134 if (OptLevel == CodeGenOpt::None)
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000135 return createFastDAGScheduler(IS, OptLevel);
Evan Cheng211ffa12010-05-19 20:19:50 +0000136 if (TLI.getSchedulingPreference() == Sched::Latency)
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000137 return createTDListDAGScheduler(IS, OptLevel);
Evan Cheng15a16de2010-05-20 06:13:19 +0000138 if (TLI.getSchedulingPreference() == Sched::RegPressure)
139 return createBURRListDAGScheduler(IS, OptLevel);
140 assert(TLI.getSchedulingPreference() == Sched::Hybrid &&
Evan Cheng211ffa12010-05-19 20:19:50 +0000141 "Unknown sched type!");
Evan Cheng15a16de2010-05-20 06:13:19 +0000142 return createHybridListDAGScheduler(IS, OptLevel);
Jim Laskey9373beb2006-08-01 19:14:14 +0000143 }
Chris Lattner1c08c712005-01-07 07:47:53 +0000144}
145
Evan Chengff9b3732008-01-30 18:18:23 +0000146// EmitInstrWithCustomInserter - This method should be implemented by targets
Dan Gohman533297b2009-10-29 18:10:34 +0000147// that mark instructions with the 'usesCustomInserter' flag. These
Chris Lattner025c39b2005-08-26 20:54:47 +0000148// instructions are special in various ways, which require special support to
149// insert. The specified MachineInstr is created but not inserted into any
Dan Gohman533297b2009-10-29 18:10:34 +0000150// basic blocks, and this method is called to expand it into a sequence of
151// instructions, potentially also creating new basic blocks and control flow.
152// When new basic blocks are inserted and the edges from MBB to its successors
153// are modified, the method should insert pairs of <OldSucc, NewSucc> into the
154// DenseMap.
Dan Gohmanaf1d8ca2010-05-01 00:01:06 +0000155MachineBasicBlock *
156TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI,
157 MachineBasicBlock *MBB) const {
Torok Edwinf3689232009-07-12 20:07:01 +0000158#ifndef NDEBUG
David Greene1a053232010-01-05 01:26:11 +0000159 dbgs() << "If a target marks an instruction with "
Dan Gohman533297b2009-10-29 18:10:34 +0000160 "'usesCustomInserter', it must implement "
Torok Edwinf3689232009-07-12 20:07:01 +0000161 "TargetLowering::EmitInstrWithCustomInserter!";
162#endif
Torok Edwinc23197a2009-07-14 16:55:14 +0000163 llvm_unreachable(0);
Daniel Dunbara279bc32009-09-20 02:20:51 +0000164 return 0;
Chris Lattner025c39b2005-08-26 20:54:47 +0000165}
166
Chris Lattner7041ee32005-01-11 05:56:49 +0000167//===----------------------------------------------------------------------===//
168// SelectionDAGISel code
169//===----------------------------------------------------------------------===//
Chris Lattner1c08c712005-01-07 07:47:53 +0000170
Dan Gohmanf0757b02010-04-21 01:34:56 +0000171SelectionDAGISel::SelectionDAGISel(const TargetMachine &tm, CodeGenOpt::Level OL) :
Dan Gohmanad2afc22009-07-31 18:16:33 +0000172 MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000173 FuncInfo(new FunctionLoweringInfo(TLI)),
Dan Gohman7451d3e2010-05-29 17:03:36 +0000174 CurDAG(new SelectionDAG(tm)),
Dan Gohman55e59c12010-04-19 19:05:59 +0000175 SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000176 GFI(),
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000177 OptLevel(OL),
Dan Gohman7c3234c2008-08-27 23:52:12 +0000178 DAGSize(0)
179{}
180
181SelectionDAGISel::~SelectionDAGISel() {
Dan Gohman2048b852009-11-23 18:04:58 +0000182 delete SDB;
Dan Gohman7c3234c2008-08-27 23:52:12 +0000183 delete CurDAG;
184 delete FuncInfo;
185}
186
Chris Lattner495a0b52005-08-17 06:37:43 +0000187void SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const {
Jim Laskeyc7c3f112006-10-16 20:52:31 +0000188 AU.addRequired<AliasAnalysis>();
Dan Gohmana3477fe2009-07-31 23:36:22 +0000189 AU.addPreserved<AliasAnalysis>();
Gordon Henriksen5eca0752008-08-17 18:44:35 +0000190 AU.addRequired<GCModuleInfo>();
Dan Gohmana3477fe2009-07-31 23:36:22 +0000191 AU.addPreserved<GCModuleInfo>();
Dan Gohmanad2afc22009-07-31 18:16:33 +0000192 MachineFunctionPass::getAnalysisUsage(AU);
Chris Lattner495a0b52005-08-17 06:37:43 +0000193}
Chris Lattner1c08c712005-01-07 07:47:53 +0000194
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000195/// FunctionCallsSetJmp - Return true if the function has a call to setjmp or
Bill Wendling8d717c72010-05-26 20:39:00 +0000196/// other function that gcc recognizes as "returning twice". This is used to
197/// limit code-gen optimizations on the machine function.
Bill Wendling804a2312010-05-26 21:53:50 +0000198///
199/// FIXME: Remove after <rdar://problem/8031714> is fixed.
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000200static bool FunctionCallsSetJmp(const Function *F) {
201 const Module *M = F->getParent();
Bill Wendling8d717c72010-05-26 20:39:00 +0000202 static const char *ReturnsTwiceFns[] = {
203 "setjmp",
204 "sigsetjmp",
205 "setjmp_syscall",
206 "savectx",
207 "qsetjmp",
208 "vfork",
209 "getcontext"
210 };
211#define NUM_RETURNS_TWICE_FNS sizeof(ReturnsTwiceFns) / sizeof(const char *)
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000212
Bill Wendling8d717c72010-05-26 20:39:00 +0000213 for (unsigned I = 0; I < NUM_RETURNS_TWICE_FNS; ++I)
214 if (const Function *Callee = M->getFunction(ReturnsTwiceFns[I])) {
215 if (!Callee->use_empty())
216 for (Value::const_use_iterator
217 I = Callee->use_begin(), E = Callee->use_end();
218 I != E; ++I)
219 if (const CallInst *CI = dyn_cast<CallInst>(I))
220 if (CI->getParent()->getParent() == F)
221 return true;
222 }
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000223
224 return false;
Bill Wendling8d717c72010-05-26 20:39:00 +0000225#undef NUM_RETURNS_TWICE_FNS
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000226}
227
Dan Gohmanad2afc22009-07-31 18:16:33 +0000228bool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) {
Dan Gohman4344a5d2008-09-09 23:05:00 +0000229 // Do some sanity-checking on the command-line options.
230 assert((!EnableFastISelVerbose || EnableFastISel) &&
231 "-fast-isel-verbose requires -fast-isel");
232 assert((!EnableFastISelAbort || EnableFastISel) &&
233 "-fast-isel-abort requires -fast-isel");
234
Dan Gohmanae541aa2010-04-15 04:33:49 +0000235 const Function &Fn = *mf.getFunction();
Dan Gohman8a110532008-09-05 22:59:21 +0000236 const TargetInstrInfo &TII = *TM.getInstrInfo();
237 const TargetRegisterInfo &TRI = *TM.getRegisterInfo();
238
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000239 MF = &mf;
Dan Gohman79ce2762009-01-15 19:20:50 +0000240 RegInfo = &MF->getRegInfo();
Dan Gohmanc0fb65d2010-04-14 17:02:07 +0000241 AA = &getAnalysis<AliasAnalysis>();
242 GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0;
243
David Greene1a053232010-01-05 01:26:11 +0000244 DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n");
Chris Lattner1c08c712005-01-07 07:47:53 +0000245
Chris Lattnerde6e7832010-04-05 06:10:13 +0000246 CurDAG->init(*MF);
Dan Gohman7451d3e2010-05-29 17:03:36 +0000247 FuncInfo->set(Fn, *MF);
Dan Gohman2048b852009-11-23 18:04:58 +0000248 SDB->init(GFI, *AA);
Chris Lattner1c08c712005-01-07 07:47:53 +0000249
Dan Gohman6a732b52010-04-14 20:05:00 +0000250 SelectAllBasicBlocks(Fn);
Misha Brukmanedf128a2005-04-21 22:36:52 +0000251
Dan Gohman1b79a2f2010-05-01 00:33:28 +0000252 // If the first basic block in the function has live ins that need to be
Dan Gohman8a110532008-09-05 22:59:21 +0000253 // copied into vregs, emit the copies into the top of the block before
254 // emitting the code for the block.
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000255 MachineBasicBlock *EntryMBB = MF->begin();
256 RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII);
257
Devang Patel394427b2010-05-26 20:18:50 +0000258 DenseMap<unsigned, unsigned> LiveInMap;
259 if (!FuncInfo->ArgDbgValues.empty())
260 for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(),
261 E = RegInfo->livein_end(); LI != E; ++LI)
262 if (LI->second)
263 LiveInMap.insert(std::make_pair(LI->first, LI->second));
264
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000265 // Insert DBG_VALUE instructions for function arguments to the entry block.
266 for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) {
267 MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1];
268 unsigned Reg = MI->getOperand(0).getReg();
269 if (TargetRegisterInfo::isPhysicalRegister(Reg))
270 EntryMBB->insert(EntryMBB->begin(), MI);
271 else {
272 MachineInstr *Def = RegInfo->getVRegDef(Reg);
273 MachineBasicBlock::iterator InsertPos = Def;
Evan Chengf1ced252010-05-04 00:58:39 +0000274 // FIXME: VR def may not be in entry block.
275 Def->getParent()->insert(llvm::next(InsertPos), MI);
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000276 }
Devang Patel394427b2010-05-26 20:18:50 +0000277
278 // If Reg is live-in then update debug info to track its copy in a vreg.
279 DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg);
280 if (LDI != LiveInMap.end()) {
281 MachineInstr *Def = RegInfo->getVRegDef(LDI->second);
282 MachineBasicBlock::iterator InsertPos = Def;
283 const MDNode *Variable =
284 MI->getOperand(MI->getNumOperands()-1).getMetadata();
285 unsigned Offset = MI->getOperand(1).getImm();
286 // Def is never a terminator here, so it is ok to increment InsertPos.
287 BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(),
288 TII.get(TargetOpcode::DBG_VALUE))
289 .addReg(LDI->second, RegState::Debug)
290 .addImm(Offset).addMetadata(Variable);
291 }
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000292 }
293
Bill Wendling53f76022010-05-17 23:09:50 +0000294 // Determine if there are any calls in this machine function.
295 MachineFrameInfo *MFI = MF->getFrameInfo();
296 if (!MFI->hasCalls()) {
297 for (MachineFunction::const_iterator
298 I = MF->begin(), E = MF->end(); I != E; ++I) {
299 const MachineBasicBlock *MBB = I;
300 for (MachineBasicBlock::const_iterator
301 II = MBB->begin(), IE = MBB->end(); II != IE; ++II) {
302 const TargetInstrDesc &TID = TM.getInstrInfo()->get(II->getOpcode());
303 if (II->isInlineAsm() || (TID.isCall() && !TID.isReturn())) {
304 MFI->setHasCalls(true);
305 goto done;
306 }
307 }
308 }
309 done:;
310 }
311
Bill Wendling9af7e9a2010-05-26 19:46:12 +0000312 // Determine if there is a call to setjmp in the machine function.
313 MF->setCallsSetJmp(FunctionCallsSetJmp(&Fn));
314
Evan Cheng2ad0fcf2010-04-28 23:08:54 +0000315 // Release function-specific state. SDB and CurDAG are already cleared
316 // at this point.
317 FuncInfo->clear();
Dan Gohman8a110532008-09-05 22:59:21 +0000318
Chris Lattner1c08c712005-01-07 07:47:53 +0000319 return true;
320}
321
Dan Gohmaneabaed22010-07-07 16:47:08 +0000322void
323SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin,
Dan Gohmana9a33212010-04-20 00:29:35 +0000324 BasicBlock::const_iterator End,
325 bool &HadTailCall) {
Dan Gohman98ca4f22009-08-05 01:29:28 +0000326 // Lower all of the non-terminator instructions. If a call is emitted
Dan Gohmanf89d1dc2010-04-16 05:06:56 +0000327 // as a tail call, cease emitting nodes for this block. Terminators
328 // are handled below.
Dan Gohmanc105a2b2010-04-22 20:55:53 +0000329 for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I)
Dan Gohmanf89d1dc2010-04-16 05:06:56 +0000330 SDB->visit(*I);
Dan Gohmanf350b272008-08-23 02:25:05 +0000331
Chris Lattnera651cf62005-01-17 19:43:36 +0000332 // Make sure the root of the DAG is up-to-date.
Dan Gohman2048b852009-11-23 18:04:58 +0000333 CurDAG->setRoot(SDB->getControlRoot());
Dan Gohman2048b852009-11-23 18:04:58 +0000334 HadTailCall = SDB->HasTailCall;
335 SDB->clear();
Dan Gohman95140a42010-05-01 00:25:44 +0000336
337 // Final step, emit the lowered DAG as machine code.
Dan Gohmaneabaed22010-07-07 16:47:08 +0000338 CodeGenAndEmitDAG();
Chris Lattner1c08c712005-01-07 07:47:53 +0000339}
340
Evan Cheng54e146b2010-01-09 00:21:08 +0000341namespace {
342/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted
343/// nodes from the worklist.
344class SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener {
345 SmallVector<SDNode*, 128> &Worklist;
Chris Lattner25e0ab92010-03-14 19:43:04 +0000346 SmallPtrSet<SDNode*, 128> &InWorklist;
Evan Cheng54e146b2010-01-09 00:21:08 +0000347public:
Chris Lattner25e0ab92010-03-14 19:43:04 +0000348 SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl,
349 SmallPtrSet<SDNode*, 128> &inwl)
350 : Worklist(wl), InWorklist(inwl) {}
Evan Cheng54e146b2010-01-09 00:21:08 +0000351
Chris Lattner25e0ab92010-03-14 19:43:04 +0000352 void RemoveFromWorklist(SDNode *N) {
353 if (!InWorklist.erase(N)) return;
354
355 SmallVector<SDNode*, 128>::iterator I =
356 std::find(Worklist.begin(), Worklist.end(), N);
357 assert(I != Worklist.end() && "Not in worklist");
358
359 *I = Worklist.back();
360 Worklist.pop_back();
361 }
362
Evan Cheng54e146b2010-01-09 00:21:08 +0000363 virtual void NodeDeleted(SDNode *N, SDNode *E) {
Chris Lattner25e0ab92010-03-14 19:43:04 +0000364 RemoveFromWorklist(N);
Evan Cheng54e146b2010-01-09 00:21:08 +0000365 }
366
367 virtual void NodeUpdated(SDNode *N) {
368 // Ignore updates.
369 }
370};
371}
372
Dan Gohmanf350b272008-08-23 02:25:05 +0000373void SelectionDAGISel::ComputeLiveOutVRegInfo() {
Chris Lattneread0d882008-06-17 06:09:18 +0000374 SmallPtrSet<SDNode*, 128> VisitedNodes;
375 SmallVector<SDNode*, 128> Worklist;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000376
Gabor Greifba36cb52008-08-28 21:40:38 +0000377 Worklist.push_back(CurDAG->getRoot().getNode());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000378
Chris Lattneread0d882008-06-17 06:09:18 +0000379 APInt Mask;
380 APInt KnownZero;
381 APInt KnownOne;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000382
Benjamin Kramer7b1e2a52010-01-07 17:27:56 +0000383 do {
384 SDNode *N = Worklist.pop_back_val();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000385
Chris Lattneread0d882008-06-17 06:09:18 +0000386 // If we've already seen this node, ignore it.
387 if (!VisitedNodes.insert(N))
388 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000389
Chris Lattneread0d882008-06-17 06:09:18 +0000390 // Otherwise, add all chain operands to the worklist.
391 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
Owen Anderson825b72b2009-08-11 20:47:22 +0000392 if (N->getOperand(i).getValueType() == MVT::Other)
Gabor Greifba36cb52008-08-28 21:40:38 +0000393 Worklist.push_back(N->getOperand(i).getNode());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000394
Chris Lattneread0d882008-06-17 06:09:18 +0000395 // If this is a CopyToReg with a vreg dest, process it.
396 if (N->getOpcode() != ISD::CopyToReg)
397 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000398
Chris Lattneread0d882008-06-17 06:09:18 +0000399 unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg();
400 if (!TargetRegisterInfo::isVirtualRegister(DestReg))
401 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000402
Chris Lattneread0d882008-06-17 06:09:18 +0000403 // Ignore non-scalar or non-integer values.
Dan Gohman475871a2008-07-27 21:46:04 +0000404 SDValue Src = N->getOperand(2);
Owen Andersone50ed302009-08-10 22:56:29 +0000405 EVT SrcVT = Src.getValueType();
Chris Lattneread0d882008-06-17 06:09:18 +0000406 if (!SrcVT.isInteger() || SrcVT.isVector())
407 continue;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000408
Dan Gohmanf350b272008-08-23 02:25:05 +0000409 unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src);
Chris Lattneread0d882008-06-17 06:09:18 +0000410 Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits());
Dan Gohmanf350b272008-08-23 02:25:05 +0000411 CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne);
Daniel Dunbara279bc32009-09-20 02:20:51 +0000412
Chris Lattneread0d882008-06-17 06:09:18 +0000413 // Only install this information if it tells us something.
414 if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) {
415 DestReg -= TargetRegisterInfo::FirstVirtualRegister;
Dan Gohmanf7d6cd42009-08-01 03:51:09 +0000416 if (DestReg >= FuncInfo->LiveOutRegInfo.size())
417 FuncInfo->LiveOutRegInfo.resize(DestReg+1);
418 FunctionLoweringInfo::LiveOutInfo &LOI =
419 FuncInfo->LiveOutRegInfo[DestReg];
Chris Lattneread0d882008-06-17 06:09:18 +0000420 LOI.NumSignBits = NumSignBits;
Dan Gohmana80efce2009-03-27 23:55:04 +0000421 LOI.KnownOne = KnownOne;
422 LOI.KnownZero = KnownZero;
Chris Lattneread0d882008-06-17 06:09:18 +0000423 }
Benjamin Kramer7b1e2a52010-01-07 17:27:56 +0000424 } while (!Worklist.empty());
Chris Lattneread0d882008-06-17 06:09:18 +0000425}
426
Dan Gohmaneabaed22010-07-07 16:47:08 +0000427void SelectionDAGISel::CodeGenAndEmitDAG() {
Dan Gohman462dc7f2008-07-21 20:00:07 +0000428 std::string GroupName;
429 if (TimePassesIsEnabled)
430 GroupName = "Instruction Selection and Scheduling";
431 std::string BlockName;
432 if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs ||
Duncan Sands25cf2272008-11-24 14:53:14 +0000433 ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs ||
434 ViewSUnitDAGs)
Dan Gohmanf7d6cd42009-08-01 03:51:09 +0000435 BlockName = MF->getFunction()->getNameStr() + ":" +
Dan Gohmaneabaed22010-07-07 16:47:08 +0000436 FuncInfo->MBB->getBasicBlock()->getNameStr();
Dan Gohman462dc7f2008-07-21 20:00:07 +0000437
Dan Gohman927f8662010-06-18 16:00:29 +0000438 DEBUG(dbgs() << "Initial selection DAG:\n"; CurDAG->dump());
Dan Gohman462dc7f2008-07-21 20:00:07 +0000439
Dan Gohmanf350b272008-08-23 02:25:05 +0000440 if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName);
Dan Gohman417e11b2007-10-08 15:12:17 +0000441
Chris Lattneraf21d552005-10-10 16:47:10 +0000442 // Run the DAG combiner in pre-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000443 {
444 NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled);
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000445 CurDAG->Combine(Unrestricted, *AA, OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000446 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000447
Dan Gohman927f8662010-06-18 16:00:29 +0000448 DEBUG(dbgs() << "Optimized lowered selection DAG:\n"; CurDAG->dump());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000449
Chris Lattner1c08c712005-01-07 07:47:53 +0000450 // Second step, hack on the DAG until it only uses operations and types that
451 // the target supports.
Dan Gohman714efc62009-12-05 17:51:33 +0000452 if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " +
453 BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000454
Dan Gohman714efc62009-12-05 17:51:33 +0000455 bool Changed;
Dan Gohman03c3dc72010-06-18 15:56:31 +0000456 {
457 NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000458 Changed = CurDAG->LegalizeTypes();
459 }
460
Dan Gohman927f8662010-06-18 16:00:29 +0000461 DEBUG(dbgs() << "Type-legalized selection DAG:\n"; CurDAG->dump());
Dan Gohman714efc62009-12-05 17:51:33 +0000462
463 if (Changed) {
464 if (ViewDAGCombineLT)
465 CurDAG->viewGraph("dag-combine-lt input for " + BlockName);
466
467 // Run the DAG combiner in post-type-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000468 {
469 NamedRegionTimer T("DAG Combining after legalize types", GroupName,
470 TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000471 CurDAG->Combine(NoIllegalTypes, *AA, OptLevel);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000472 }
473
Dan Gohman927f8662010-06-18 16:00:29 +0000474 DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n";
475 CurDAG->dump());
Dan Gohman714efc62009-12-05 17:51:33 +0000476 }
Dan Gohman462dc7f2008-07-21 20:00:07 +0000477
Dan Gohman03c3dc72010-06-18 15:56:31 +0000478 {
479 NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000480 Changed = CurDAG->LegalizeVectors();
481 }
Duncan Sands25cf2272008-11-24 14:53:14 +0000482
Dan Gohman714efc62009-12-05 17:51:33 +0000483 if (Changed) {
Dan Gohman03c3dc72010-06-18 15:56:31 +0000484 {
485 NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled);
Bill Wendling98820072009-12-28 01:51:30 +0000486 CurDAG->LegalizeTypes();
Eli Friedman5c22c802009-05-23 12:35:30 +0000487 }
488
Dan Gohman714efc62009-12-05 17:51:33 +0000489 if (ViewDAGCombineLT)
490 CurDAG->viewGraph("dag-combine-lv input for " + BlockName);
Eli Friedman5c22c802009-05-23 12:35:30 +0000491
Dan Gohman714efc62009-12-05 17:51:33 +0000492 // Run the DAG combiner in post-type-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000493 {
494 NamedRegionTimer T("DAG Combining after legalize vectors", GroupName,
495 TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000496 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
Eli Friedman5c22c802009-05-23 12:35:30 +0000497 }
Dan Gohman714efc62009-12-05 17:51:33 +0000498
Dan Gohman927f8662010-06-18 16:00:29 +0000499 DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n";
500 CurDAG->dump());
Chris Lattner70587ea2008-07-10 23:37:50 +0000501 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000502
Dan Gohmanf350b272008-08-23 02:25:05 +0000503 if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000504
Dan Gohman03c3dc72010-06-18 15:56:31 +0000505 {
506 NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled);
Dan Gohman714efc62009-12-05 17:51:33 +0000507 CurDAG->Legalize(OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000508 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000509
Dan Gohman927f8662010-06-18 16:00:29 +0000510 DEBUG(dbgs() << "Legalized selection DAG:\n"; CurDAG->dump());
Daniel Dunbara279bc32009-09-20 02:20:51 +0000511
Dan Gohmanf350b272008-08-23 02:25:05 +0000512 if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000513
Chris Lattneraf21d552005-10-10 16:47:10 +0000514 // Run the DAG combiner in post-legalize mode.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000515 {
516 NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled);
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +0000517 CurDAG->Combine(NoIllegalOperations, *AA, OptLevel);
Evan Chengebffb662008-07-01 17:59:20 +0000518 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000519
Dan Gohman927f8662010-06-18 16:00:29 +0000520 DEBUG(dbgs() << "Optimized legalized selection DAG:\n"; CurDAG->dump());
Dan Gohman417e11b2007-10-08 15:12:17 +0000521
Dan Gohman4e39e9d2010-06-24 14:30:44 +0000522 if (OptLevel != CodeGenOpt::None)
Dan Gohmanf350b272008-08-23 02:25:05 +0000523 ComputeLiveOutVRegInfo();
Evan Cheng552c4a82006-04-28 02:09:19 +0000524
Chris Lattner552186d2010-03-14 19:27:55 +0000525 if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName);
526
Chris Lattnera33ef482005-03-30 01:10:47 +0000527 // Third, instruction select all of the operations to machine code, adding the
528 // code to the MachineBasicBlock.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000529 {
530 NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled);
Chris Lattner7c306da2010-03-02 06:34:30 +0000531 DoInstructionSelection();
Evan Chengebffb662008-07-01 17:59:20 +0000532 }
Evan Chengdb8d56b2008-06-30 20:45:06 +0000533
Dan Gohman927f8662010-06-18 16:00:29 +0000534 DEBUG(dbgs() << "Selected selection DAG:\n"; CurDAG->dump());
Dan Gohman462dc7f2008-07-21 20:00:07 +0000535
Dan Gohmanf350b272008-08-23 02:25:05 +0000536 if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName);
Dan Gohman462dc7f2008-07-21 20:00:07 +0000537
Dan Gohman5e843682008-07-14 18:19:29 +0000538 // Schedule machine code.
Dan Gohman47ac0f02009-02-11 04:27:20 +0000539 ScheduleDAGSDNodes *Scheduler = CreateScheduler();
Dan Gohman03c3dc72010-06-18 15:56:31 +0000540 {
541 NamedRegionTimer T("Instruction Scheduling", GroupName,
542 TimePassesIsEnabled);
Dan Gohmaneabaed22010-07-07 16:47:08 +0000543 Scheduler->Run(CurDAG, FuncInfo->MBB, FuncInfo->InsertPt);
Dan Gohman5e843682008-07-14 18:19:29 +0000544 }
545
Dan Gohman462dc7f2008-07-21 20:00:07 +0000546 if (ViewSUnitDAGs) Scheduler->viewGraph();
547
Daniel Dunbara279bc32009-09-20 02:20:51 +0000548 // Emit machine code to BB. This can change 'BB' to the last block being
Evan Chengdb8d56b2008-06-30 20:45:06 +0000549 // inserted into.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000550 {
551 NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled);
Dan Gohmaneabaed22010-07-07 16:47:08 +0000552 FuncInfo->MBB = Scheduler->EmitSchedule();
Dan Gohman5fc3da02010-07-07 18:22:13 +0000553 FuncInfo->InsertPt = Scheduler->InsertPos;
Dan Gohman5e843682008-07-14 18:19:29 +0000554 }
555
556 // Free the scheduler state.
Dan Gohman03c3dc72010-06-18 15:56:31 +0000557 {
558 NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName,
559 TimePassesIsEnabled);
Dan Gohman5e843682008-07-14 18:19:29 +0000560 delete Scheduler;
Evan Chengebffb662008-07-01 17:59:20 +0000561 }
Evan Chengdb8d56b2008-06-30 20:45:06 +0000562
Dan Gohman95140a42010-05-01 00:25:44 +0000563 // Free the SelectionDAG state, now that we're finished with it.
564 CurDAG->clear();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000565}
Chris Lattner1c08c712005-01-07 07:47:53 +0000566
Chris Lattner7c306da2010-03-02 06:34:30 +0000567void SelectionDAGISel::DoInstructionSelection() {
568 DEBUG(errs() << "===== Instruction selection begins:\n");
569
570 PreprocessISelDAG();
571
572 // Select target instructions for the DAG.
573 {
574 // Number all nodes with a topological order and set DAGSize.
575 DAGSize = CurDAG->AssignTopologicalOrder();
576
577 // Create a dummy node (which is not added to allnodes), that adds
578 // a reference to the root node, preventing it from being deleted,
579 // and tracking any changes of the root.
580 HandleSDNode Dummy(CurDAG->getRoot());
581 ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode());
582 ++ISelPosition;
583
584 // The AllNodes list is now topological-sorted. Visit the
585 // nodes by starting at the end of the list (the root of the
586 // graph) and preceding back toward the beginning (the entry
587 // node).
588 while (ISelPosition != CurDAG->allnodes_begin()) {
589 SDNode *Node = --ISelPosition;
590 // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes,
591 // but there are currently some corner cases that it misses. Also, this
592 // makes it theoretically possible to disable the DAGCombiner.
593 if (Node->use_empty())
594 continue;
595
596 SDNode *ResNode = Select(Node);
597
Chris Lattner82dd3d32010-03-02 07:50:03 +0000598 // FIXME: This is pretty gross. 'Select' should be changed to not return
599 // anything at all and this code should be nuked with a tactical strike.
600
Chris Lattner7c306da2010-03-02 06:34:30 +0000601 // If node should not be replaced, continue with the next one.
Chris Lattner82dd3d32010-03-02 07:50:03 +0000602 if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE)
Chris Lattner7c306da2010-03-02 06:34:30 +0000603 continue;
604 // Replace node.
605 if (ResNode)
606 ReplaceUses(Node, ResNode);
607
608 // If after the replacement this node is not used any more,
609 // remove this dead node.
610 if (Node->use_empty()) { // Don't delete EntryToken, etc.
611 ISelUpdater ISU(ISelPosition);
612 CurDAG->RemoveDeadNode(Node, &ISU);
613 }
614 }
615
616 CurDAG->setRoot(Dummy.getValue());
617 }
Bill Wendling53f76022010-05-17 23:09:50 +0000618
Chris Lattner7c306da2010-03-02 06:34:30 +0000619 DEBUG(errs() << "===== Instruction selection ends:\n");
620
621 PostprocessISelDAG();
Chris Lattner7c306da2010-03-02 06:34:30 +0000622}
623
Dan Gohman25208642010-04-14 19:53:31 +0000624/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and
625/// do other setup for EH landing-pad blocks.
Dan Gohmaneabaed22010-07-07 16:47:08 +0000626void SelectionDAGISel::PrepareEHLandingPad() {
Dan Gohman25208642010-04-14 19:53:31 +0000627 // Add a label to mark the beginning of the landing pad. Deletion of the
628 // landing pad can thus be detected via the MachineModuleInfo.
Dan Gohmaneabaed22010-07-07 16:47:08 +0000629 MCSymbol *Label = MF->getMMI().addLandingPad(FuncInfo->MBB);
Dan Gohman25208642010-04-14 19:53:31 +0000630
Dan Gohman55e59c12010-04-19 19:05:59 +0000631 const TargetInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL);
Dan Gohmaneabaed22010-07-07 16:47:08 +0000632 BuildMI(*FuncInfo->MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II)
633 .addSym(Label);
Dan Gohman25208642010-04-14 19:53:31 +0000634
635 // Mark exception register as live in.
636 unsigned Reg = TLI.getExceptionAddressRegister();
Dan Gohmaneabaed22010-07-07 16:47:08 +0000637 if (Reg) FuncInfo->MBB->addLiveIn(Reg);
Dan Gohman25208642010-04-14 19:53:31 +0000638
639 // Mark exception selector register as live in.
640 Reg = TLI.getExceptionSelectorRegister();
Dan Gohmaneabaed22010-07-07 16:47:08 +0000641 if (Reg) FuncInfo->MBB->addLiveIn(Reg);
Dan Gohman25208642010-04-14 19:53:31 +0000642
643 // FIXME: Hack around an exception handling flaw (PR1508): the personality
644 // function and list of typeids logically belong to the invoke (or, if you
645 // like, the basic block containing the invoke), and need to be associated
646 // with it in the dwarf exception handling tables. Currently however the
647 // information is provided by an intrinsic (eh.selector) that can be moved
648 // to unexpected places by the optimizers: if the unwind edge is critical,
649 // then breaking it can result in the intrinsics being in the successor of
650 // the landing pad, not the landing pad itself. This results
651 // in exceptions not being caught because no typeids are associated with
652 // the invoke. This may not be the only way things can go wrong, but it
653 // is the only way we try to work around for the moment.
Dan Gohmaneabaed22010-07-07 16:47:08 +0000654 const BasicBlock *LLVMBB = FuncInfo->MBB->getBasicBlock();
Dan Gohman25208642010-04-14 19:53:31 +0000655 const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator());
656
657 if (Br && Br->isUnconditional()) { // Critical edge?
658 BasicBlock::const_iterator I, E;
659 for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I)
660 if (isa<EHSelectorInst>(I))
661 break;
662
663 if (I == E)
664 // No catch info found - try to extract some from the successor.
665 CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo);
666 }
667}
Chris Lattner7c306da2010-03-02 06:34:30 +0000668
Dan Gohman46510a72010-04-15 01:51:59 +0000669void SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) {
Dan Gohmana43abd12008-09-29 21:55:50 +0000670 // Initialize the Fast-ISel state, if needed.
671 FastISel *FastIS = 0;
672 if (EnableFastISel)
Dan Gohmana4160c32010-07-07 16:29:44 +0000673 FastIS = TLI.createFastISel(*FuncInfo);
Dan Gohmana43abd12008-09-29 21:55:50 +0000674
675 // Iterate over all basic blocks in the function.
Dan Gohman46510a72010-04-15 01:51:59 +0000676 for (Function::const_iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) {
677 const BasicBlock *LLVMBB = &*I;
Dan Gohmaneabaed22010-07-07 16:47:08 +0000678 FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB];
679 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
Dan Gohmanf350b272008-08-23 02:25:05 +0000680
Dan Gohmanba5be5c2010-04-20 15:00:41 +0000681 BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI();
Dan Gohman46510a72010-04-15 01:51:59 +0000682 BasicBlock::const_iterator const End = LLVMBB->end();
Dan Gohman4df83ed2010-07-07 19:20:32 +0000683 BasicBlock::const_iterator BI = End;
Dan Gohman5edd3612008-08-28 20:28:56 +0000684
Dan Gohmanf350b272008-08-23 02:25:05 +0000685 // Before doing SelectionDAG ISel, see if FastISel has been requested.
Dan Gohmand725f042010-05-01 02:44:23 +0000686 if (FastIS) {
Dan Gohmaneabaed22010-07-07 16:47:08 +0000687 FastIS->startNewBlock();
Dan Gohman4df83ed2010-07-07 19:20:32 +0000688
Dan Gohmana43abd12008-09-29 21:55:50 +0000689 // Do FastISel on as many instructions as possible.
Dan Gohman4df83ed2010-07-07 19:20:32 +0000690 for (; BI != Begin; --BI) {
691 const Instruction *Inst = llvm::prior(BI);
692
693 // If we no longer require this instruction, skip it.
694 if (!Inst->mayWriteToMemory() &&
695 !isa<TerminatorInst>(Inst) &&
696 !isa<DbgInfoIntrinsic>(Inst) &&
697 !FuncInfo->isExportedInst(Inst))
Dan Gohman20d4be12010-07-01 02:58:57 +0000698 continue;
Dan Gohman4df83ed2010-07-07 19:20:32 +0000699
700 // Bottom-up: reset the insert pos at the top, after any local-value
701 // instructions.
702 MachineBasicBlock::iterator LVIP = FastIS->getLastLocalValue();
703 if (LVIP != FuncInfo->MBB->end())
704 FuncInfo->InsertPt = next(LVIP);
705 else
706 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
Dan Gohman20d4be12010-07-01 02:58:57 +0000707
Dan Gohman21c14e32010-01-12 04:32:35 +0000708 // Try to select the instruction with FastISel.
Dan Gohman4df83ed2010-07-07 19:20:32 +0000709 if (FastIS->SelectInstruction(Inst))
Dan Gohmana43abd12008-09-29 21:55:50 +0000710 continue;
Dan Gohmana43abd12008-09-29 21:55:50 +0000711
712 // Then handle certain instructions as single-LLVM-Instruction blocks.
Dan Gohman4df83ed2010-07-07 19:20:32 +0000713 if (isa<CallInst>(Inst)) {
Chris Lattnerc19ae9d2010-03-04 19:46:56 +0000714 ++NumFastIselFailures;
Dan Gohmana43abd12008-09-29 21:55:50 +0000715 if (EnableFastISelVerbose || EnableFastISelAbort) {
David Greene1a053232010-01-05 01:26:11 +0000716 dbgs() << "FastISel missed call: ";
Dan Gohman4df83ed2010-07-07 19:20:32 +0000717 Inst->dump();
Dan Gohmana43abd12008-09-29 21:55:50 +0000718 }
719
Dan Gohman4df83ed2010-07-07 19:20:32 +0000720 if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) {
721 unsigned &R = FuncInfo->ValueMap[Inst];
Dan Gohmana43abd12008-09-29 21:55:50 +0000722 if (!R)
Dan Gohman4df83ed2010-07-07 19:20:32 +0000723 R = FuncInfo->CreateRegs(Inst->getType());
Dan Gohmana43abd12008-09-29 21:55:50 +0000724 }
725
Dan Gohmanb4afb132009-11-20 02:51:26 +0000726 bool HadTailCall = false;
Dan Gohman4df83ed2010-07-07 19:20:32 +0000727 SelectBasicBlock(Inst, BI, HadTailCall);
Dan Gohmanb4afb132009-11-20 02:51:26 +0000728
729 // If the call was emitted as a tail call, we're done with the block.
730 if (HadTailCall) {
Dan Gohman4df83ed2010-07-07 19:20:32 +0000731 --BI;
Dan Gohmanb4afb132009-11-20 02:51:26 +0000732 break;
733 }
734
Dan Gohmana43abd12008-09-29 21:55:50 +0000735 continue;
Dan Gohmanf350b272008-08-23 02:25:05 +0000736 }
Dan Gohmana43abd12008-09-29 21:55:50 +0000737
738 // Otherwise, give up on FastISel for the rest of the block.
739 // For now, be a little lenient about non-branch terminators.
Dan Gohman61b7cea2010-07-07 23:47:25 +0000740 if (!isa<TerminatorInst>(Inst) || isa<BranchInst>(Inst)) {
Chris Lattnerc19ae9d2010-03-04 19:46:56 +0000741 ++NumFastIselFailures;
Dan Gohmana43abd12008-09-29 21:55:50 +0000742 if (EnableFastISelVerbose || EnableFastISelAbort) {
David Greene1a053232010-01-05 01:26:11 +0000743 dbgs() << "FastISel miss: ";
Dan Gohman4df83ed2010-07-07 19:20:32 +0000744 Inst->dump();
Dan Gohmana43abd12008-09-29 21:55:50 +0000745 }
746 if (EnableFastISelAbort)
747 // The "fast" selector couldn't handle something and bailed.
748 // For the purpose of debugging, just abort.
Torok Edwinc23197a2009-07-14 16:55:14 +0000749 llvm_unreachable("FastISel didn't select the entire block");
Dan Gohmana43abd12008-09-29 21:55:50 +0000750 }
751 break;
Dan Gohmanf350b272008-08-23 02:25:05 +0000752 }
753 }
754
Dan Gohman4df83ed2010-07-07 19:20:32 +0000755 FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI();
756
757 // Setup an EH landing-pad block.
758 if (FuncInfo->MBB->isLandingPad())
759 PrepareEHLandingPad();
760
761 // Lower any arguments needed in this block if this is the entry block.
762 if (LLVMBB == &Fn.getEntryBlock())
763 LowerArguments(LLVMBB);
764
Dan Gohmand2ff6472008-09-02 20:17:56 +0000765 // Run SelectionDAG instruction selection on the remainder of the block
766 // not handled by FastISel. If FastISel is not run, this is the entire
Dan Gohman3df24e62008-09-03 23:12:08 +0000767 // block.
Dan Gohman4df83ed2010-07-07 19:20:32 +0000768 bool HadTailCall;
769 SelectBasicBlock(Begin, BI, HadTailCall);
Dan Gohmanf350b272008-08-23 02:25:05 +0000770
Dan Gohmaneabaed22010-07-07 16:47:08 +0000771 FinishBasicBlock();
Dan Gohman620427d2010-04-22 19:55:20 +0000772 FuncInfo->PHINodesToUpdate.clear();
Evan Cheng39fd6e82008-08-07 00:43:25 +0000773 }
Dan Gohmana43abd12008-09-29 21:55:50 +0000774
775 delete FastIS;
Dan Gohman0e5f1302008-07-07 23:02:41 +0000776}
777
Dan Gohmanfed90b62008-07-28 21:51:04 +0000778void
Dan Gohmaneabaed22010-07-07 16:47:08 +0000779SelectionDAGISel::FinishBasicBlock() {
Dan Gohmanf350b272008-08-23 02:25:05 +0000780
David Greene1a053232010-01-05 01:26:11 +0000781 DEBUG(dbgs() << "Total amount of phi nodes to update: "
Dan Gohman927f8662010-06-18 16:00:29 +0000782 << FuncInfo->PHINodesToUpdate.size() << "\n";
783 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i)
David Greene1a053232010-01-05 01:26:11 +0000784 dbgs() << "Node " << i << " : ("
Dan Gohman620427d2010-04-22 19:55:20 +0000785 << FuncInfo->PHINodesToUpdate[i].first
786 << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n");
Daniel Dunbara279bc32009-09-20 02:20:51 +0000787
Chris Lattnera33ef482005-03-30 01:10:47 +0000788 // Next, now that we know what the last MBB the LLVM BB expanded is, update
Chris Lattner1c08c712005-01-07 07:47:53 +0000789 // PHI nodes in successors.
Dan Gohman2048b852009-11-23 18:04:58 +0000790 if (SDB->SwitchCases.empty() &&
791 SDB->JTCases.empty() &&
792 SDB->BitTestCases.empty()) {
Dan Gohman620427d2010-04-22 19:55:20 +0000793 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
794 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
Chris Lattner518bb532010-02-09 19:54:29 +0000795 assert(PHI->isPHI() &&
Nate Begemanf15485a2006-03-27 01:32:24 +0000796 "This is not a machine PHI node that we are updating!");
Dan Gohmaneabaed22010-07-07 16:47:08 +0000797 if (!FuncInfo->MBB->isSuccessor(PHI->getParent()))
Jakob Stoklund Olesen580bba22010-03-05 21:49:10 +0000798 continue;
Dan Gohman620427d2010-04-22 19:55:20 +0000799 PHI->addOperand(
800 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
Dan Gohmaneabaed22010-07-07 16:47:08 +0000801 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Nate Begemanf15485a2006-03-27 01:32:24 +0000802 }
803 return;
Chris Lattner1c08c712005-01-07 07:47:53 +0000804 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000805
Dan Gohman2048b852009-11-23 18:04:58 +0000806 for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000807 // Lower header first, if it wasn't already lowered
Dan Gohman2048b852009-11-23 18:04:58 +0000808 if (!SDB->BitTestCases[i].Emitted) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000809 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohmaneabaed22010-07-07 16:47:08 +0000810 FuncInfo->MBB = SDB->BitTestCases[i].Parent;
811 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000812 // Emit the code
Dan Gohmaneabaed22010-07-07 16:47:08 +0000813 SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +0000814 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +0000815 SDB->clear();
Dan Gohmaneabaed22010-07-07 16:47:08 +0000816 CodeGenAndEmitDAG();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000817 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000818
Dan Gohman2048b852009-11-23 18:04:58 +0000819 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) {
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000820 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohmaneabaed22010-07-07 16:47:08 +0000821 FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB;
822 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000823 // Emit the code
824 if (j+1 != ej)
Dan Gohman2048b852009-11-23 18:04:58 +0000825 SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB,
826 SDB->BitTestCases[i].Reg,
Dan Gohman99be8ae2010-04-19 22:41:47 +0000827 SDB->BitTestCases[i].Cases[j],
Dan Gohmaneabaed22010-07-07 16:47:08 +0000828 FuncInfo->MBB);
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000829 else
Dan Gohman2048b852009-11-23 18:04:58 +0000830 SDB->visitBitTestCase(SDB->BitTestCases[i].Default,
831 SDB->BitTestCases[i].Reg,
Dan Gohman99be8ae2010-04-19 22:41:47 +0000832 SDB->BitTestCases[i].Cases[j],
Dan Gohmaneabaed22010-07-07 16:47:08 +0000833 FuncInfo->MBB);
Daniel Dunbara279bc32009-09-20 02:20:51 +0000834
835
Dan Gohman2048b852009-11-23 18:04:58 +0000836 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +0000837 SDB->clear();
Dan Gohmaneabaed22010-07-07 16:47:08 +0000838 CodeGenAndEmitDAG();
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000839 }
840
841 // Update PHI Nodes
Dan Gohman620427d2010-04-22 19:55:20 +0000842 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
843 pi != pe; ++pi) {
844 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000845 MachineBasicBlock *PHIBB = PHI->getParent();
Chris Lattner518bb532010-02-09 19:54:29 +0000846 assert(PHI->isPHI() &&
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000847 "This is not a machine PHI node that we are updating!");
848 // This is "default" BB. We have two jumps to it. From "header" BB and
849 // from last "case" BB.
Dan Gohman2048b852009-11-23 18:04:58 +0000850 if (PHIBB == SDB->BitTestCases[i].Default) {
Jim Grosbachf4549b02010-01-15 00:36:15 +0000851 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +0000852 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
853 false));
Dan Gohman2048b852009-11-23 18:04:58 +0000854 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent));
Jim Grosbachf4549b02010-01-15 00:36:15 +0000855 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +0000856 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
857 false));
Dan Gohman2048b852009-11-23 18:04:58 +0000858 PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases.
Chris Lattner9ce2e9d2007-12-30 00:57:42 +0000859 back().ThisBB));
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000860 }
861 // One of "cases" BB.
Dan Gohman2048b852009-11-23 18:04:58 +0000862 for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size();
Dan Gohman7c3234c2008-08-27 23:52:12 +0000863 j != ej; ++j) {
Dan Gohman2048b852009-11-23 18:04:58 +0000864 MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB;
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +0000865 if (cBB->isSuccessor(PHIBB)) {
Jim Grosbachf4549b02010-01-15 00:36:15 +0000866 PHI->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +0000867 CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
868 false));
Chris Lattner9ce2e9d2007-12-30 00:57:42 +0000869 PHI->addOperand(MachineOperand::CreateMBB(cBB));
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000870 }
871 }
872 }
873 }
Dan Gohman2048b852009-11-23 18:04:58 +0000874 SDB->BitTestCases.clear();
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000875
Nate Begeman9453eea2006-04-23 06:26:20 +0000876 // If the JumpTable record is filled in, then we need to emit a jump table.
877 // Updating the PHI nodes is tricky in this case, since we need to determine
878 // whether the PHI is a successor of the range check MBB or the jump table MBB
Dan Gohman2048b852009-11-23 18:04:58 +0000879 for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) {
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +0000880 // Lower header first, if it wasn't already lowered
Dan Gohman2048b852009-11-23 18:04:58 +0000881 if (!SDB->JTCases[i].first.Emitted) {
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +0000882 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohmaneabaed22010-07-07 16:47:08 +0000883 FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB;
884 FuncInfo->InsertPt = FuncInfo->MBB->end();
Anton Korobeynikov3a84b9b2007-03-25 15:07:15 +0000885 // Emit the code
Dan Gohman99be8ae2010-04-19 22:41:47 +0000886 SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first,
Dan Gohmaneabaed22010-07-07 16:47:08 +0000887 FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +0000888 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +0000889 SDB->clear();
Dan Gohmaneabaed22010-07-07 16:47:08 +0000890 CodeGenAndEmitDAG();
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000891 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000892
Nate Begeman37efe672006-04-22 18:53:45 +0000893 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohmaneabaed22010-07-07 16:47:08 +0000894 FuncInfo->MBB = SDB->JTCases[i].second.MBB;
895 FuncInfo->InsertPt = FuncInfo->MBB->end();
Nate Begeman37efe672006-04-22 18:53:45 +0000896 // Emit the code
Dan Gohman2048b852009-11-23 18:04:58 +0000897 SDB->visitJumpTable(SDB->JTCases[i].second);
898 CurDAG->setRoot(SDB->getRoot());
Dan Gohman2048b852009-11-23 18:04:58 +0000899 SDB->clear();
Dan Gohmaneabaed22010-07-07 16:47:08 +0000900 CodeGenAndEmitDAG();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000901
Nate Begeman37efe672006-04-22 18:53:45 +0000902 // Update PHI Nodes
Dan Gohman620427d2010-04-22 19:55:20 +0000903 for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size();
904 pi != pe; ++pi) {
905 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first;
Nate Begeman37efe672006-04-22 18:53:45 +0000906 MachineBasicBlock *PHIBB = PHI->getParent();
Chris Lattner518bb532010-02-09 19:54:29 +0000907 assert(PHI->isPHI() &&
Nate Begeman37efe672006-04-22 18:53:45 +0000908 "This is not a machine PHI node that we are updating!");
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000909 // "default" BB. We can go there only from header BB.
Dan Gohman2048b852009-11-23 18:04:58 +0000910 if (PHIBB == SDB->JTCases[i].second.Default) {
Evan Chengce319102009-09-19 09:51:03 +0000911 PHI->addOperand
Dan Gohman620427d2010-04-22 19:55:20 +0000912 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
913 false));
Evan Chengce319102009-09-19 09:51:03 +0000914 PHI->addOperand
Dan Gohman2048b852009-11-23 18:04:58 +0000915 (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB));
Nate Begemanf4360a42006-05-03 03:48:02 +0000916 }
Anton Korobeynikov4198c582007-04-09 12:31:58 +0000917 // JT BB. Just iterate over successors here
Dan Gohmaneabaed22010-07-07 16:47:08 +0000918 if (FuncInfo->MBB->isSuccessor(PHIBB)) {
Evan Chengce319102009-09-19 09:51:03 +0000919 PHI->addOperand
Dan Gohman620427d2010-04-22 19:55:20 +0000920 (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second,
921 false));
Dan Gohmaneabaed22010-07-07 16:47:08 +0000922 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Nate Begeman37efe672006-04-22 18:53:45 +0000923 }
924 }
Nate Begeman37efe672006-04-22 18:53:45 +0000925 }
Dan Gohman2048b852009-11-23 18:04:58 +0000926 SDB->JTCases.clear();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000927
Chris Lattnerb2e806e2006-10-22 23:00:53 +0000928 // If the switch block involved a branch to one of the actual successors, we
929 // need to update PHI nodes in that block.
Dan Gohman620427d2010-04-22 19:55:20 +0000930 for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) {
931 MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first;
Chris Lattner518bb532010-02-09 19:54:29 +0000932 assert(PHI->isPHI() &&
Chris Lattnerb2e806e2006-10-22 23:00:53 +0000933 "This is not a machine PHI node that we are updating!");
Dan Gohmaneabaed22010-07-07 16:47:08 +0000934 if (FuncInfo->MBB->isSuccessor(PHI->getParent())) {
Dan Gohman620427d2010-04-22 19:55:20 +0000935 PHI->addOperand(
936 MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false));
Dan Gohmaneabaed22010-07-07 16:47:08 +0000937 PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB));
Chris Lattnerb2e806e2006-10-22 23:00:53 +0000938 }
939 }
Daniel Dunbara279bc32009-09-20 02:20:51 +0000940
Nate Begemanf15485a2006-03-27 01:32:24 +0000941 // If we generated any switch lowering information, build and codegen any
942 // additional DAGs necessary.
Dan Gohman2048b852009-11-23 18:04:58 +0000943 for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) {
Nate Begemanf15485a2006-03-27 01:32:24 +0000944 // Set the current basic block to the mbb we wish to insert the code into
Dan Gohmaneabaed22010-07-07 16:47:08 +0000945 MachineBasicBlock *ThisBB = FuncInfo->MBB = SDB->SwitchCases[i].ThisBB;
946 FuncInfo->InsertPt = FuncInfo->MBB->end();
Daniel Dunbara279bc32009-09-20 02:20:51 +0000947
Dan Gohman95140a42010-05-01 00:25:44 +0000948 // Determine the unique successors.
949 SmallVector<MachineBasicBlock *, 2> Succs;
950 Succs.push_back(SDB->SwitchCases[i].TrueBB);
951 if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB)
952 Succs.push_back(SDB->SwitchCases[i].FalseBB);
953
954 // Emit the code. Note that this could result in ThisBB being split, so
955 // we need to check for updates.
Dan Gohmaneabaed22010-07-07 16:47:08 +0000956 SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB);
Dan Gohman2048b852009-11-23 18:04:58 +0000957 CurDAG->setRoot(SDB->getRoot());
Dan Gohman95140a42010-05-01 00:25:44 +0000958 SDB->clear();
Dan Gohmaneabaed22010-07-07 16:47:08 +0000959 CodeGenAndEmitDAG();
960 ThisBB = FuncInfo->MBB;
Daniel Dunbara279bc32009-09-20 02:20:51 +0000961
Chris Lattnerd5e93c02006-09-07 01:59:34 +0000962 // Handle any PHI nodes in successors of this chunk, as if we were coming
963 // from the original BB before switch expansion. Note that PHI nodes can
964 // occur multiple times in PHINodesToUpdate. We have to be very careful to
965 // handle them the right number of times.
Dan Gohman95140a42010-05-01 00:25:44 +0000966 for (unsigned i = 0, e = Succs.size(); i != e; ++i) {
Dan Gohmaneabaed22010-07-07 16:47:08 +0000967 FuncInfo->MBB = Succs[i];
968 FuncInfo->InsertPt = FuncInfo->MBB->end();
Dan Gohman4df83ed2010-07-07 19:20:32 +0000969 // FuncInfo->MBB may have been removed from the CFG if a branch was
970 // constant folded.
Dan Gohmaneabaed22010-07-07 16:47:08 +0000971 if (ThisBB->isSuccessor(FuncInfo->MBB)) {
972 for (MachineBasicBlock::iterator Phi = FuncInfo->MBB->begin();
973 Phi != FuncInfo->MBB->end() && Phi->isPHI();
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +0000974 ++Phi) {
975 // This value for this PHI node is recorded in PHINodesToUpdate.
976 for (unsigned pn = 0; ; ++pn) {
Dan Gohman620427d2010-04-22 19:55:20 +0000977 assert(pn != FuncInfo->PHINodesToUpdate.size() &&
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +0000978 "Didn't find PHI entry!");
Dan Gohman620427d2010-04-22 19:55:20 +0000979 if (FuncInfo->PHINodesToUpdate[pn].first == Phi) {
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +0000980 Phi->addOperand(MachineOperand::
Dan Gohman620427d2010-04-22 19:55:20 +0000981 CreateReg(FuncInfo->PHINodesToUpdate[pn].second,
Jakob Stoklund Olesendd437ba2010-01-11 21:02:33 +0000982 false));
983 Phi->addOperand(MachineOperand::CreateMBB(ThisBB));
984 break;
985 }
Evan Cheng8be58a12009-09-18 08:26:06 +0000986 }
Chris Lattnerd5e93c02006-09-07 01:59:34 +0000987 }
Nate Begemanf15485a2006-03-27 01:32:24 +0000988 }
989 }
Chris Lattnera33ef482005-03-30 01:10:47 +0000990 }
Dan Gohman2048b852009-11-23 18:04:58 +0000991 SDB->SwitchCases.clear();
Chris Lattner1c08c712005-01-07 07:47:53 +0000992}
Evan Chenga9c20912006-01-21 02:32:06 +0000993
Jim Laskey13ec7022006-08-01 14:21:23 +0000994
Dan Gohman0a3776d2009-02-06 18:26:51 +0000995/// Create the scheduler. If a specific scheduler was specified
996/// via the SchedulerRegistry, use it, otherwise select the
997/// one preferred by the target.
Dan Gohman5e843682008-07-14 18:19:29 +0000998///
Dan Gohman47ac0f02009-02-11 04:27:20 +0000999ScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() {
Jim Laskeyeb577ba2006-08-02 12:30:23 +00001000 RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault();
Daniel Dunbara279bc32009-09-20 02:20:51 +00001001
Jim Laskey13ec7022006-08-01 14:21:23 +00001002 if (!Ctor) {
Jim Laskeyeb577ba2006-08-02 12:30:23 +00001003 Ctor = ISHeuristic;
Jim Laskey9373beb2006-08-01 19:14:14 +00001004 RegisterScheduler::setDefault(Ctor);
Evan Cheng4ef10862006-01-23 07:01:07 +00001005 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001006
Bill Wendlingbe8cc2a2009-04-29 00:15:41 +00001007 return Ctor(this, OptLevel);
Evan Chenga9c20912006-01-21 02:32:06 +00001008}
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001009
Dan Gohmanfc54c552009-01-15 22:18:12 +00001010ScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() {
1011 return new ScheduleHazardRecognizer();
Jim Laskey9ff542f2006-08-01 18:29:48 +00001012}
1013
Chris Lattner75548062006-10-11 03:58:02 +00001014//===----------------------------------------------------------------------===//
1015// Helper functions used by the generated instruction selector.
1016//===----------------------------------------------------------------------===//
1017// Calls to these methods are generated by tblgen.
1018
1019/// CheckAndMask - The isel is trying to match something like (and X, 255). If
1020/// the dag combiner simplified the 255, we still want to match. RHS is the
1021/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value
1022/// specified in the .td file (e.g. 255).
Daniel Dunbara279bc32009-09-20 02:20:51 +00001023bool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS,
Dan Gohmandc9b3d02007-07-24 23:00:27 +00001024 int64_t DesiredMaskS) const {
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001025 const APInt &ActualMask = RHS->getAPIntValue();
1026 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001027
Chris Lattner75548062006-10-11 03:58:02 +00001028 // If the actual mask exactly matches, success!
1029 if (ActualMask == DesiredMask)
1030 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001031
Chris Lattner75548062006-10-11 03:58:02 +00001032 // If the actual AND mask is allowing unallowed bits, this doesn't match.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001033 if (ActualMask.intersects(~DesiredMask))
Chris Lattner75548062006-10-11 03:58:02 +00001034 return false;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001035
Chris Lattner75548062006-10-11 03:58:02 +00001036 // Otherwise, the DAG Combiner may have proven that the value coming in is
1037 // either already zero or is not demanded. Check for known zero input bits.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001038 APInt NeededMask = DesiredMask & ~ActualMask;
Dan Gohmanea859be2007-06-22 14:59:07 +00001039 if (CurDAG->MaskedValueIsZero(LHS, NeededMask))
Chris Lattner75548062006-10-11 03:58:02 +00001040 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001041
Chris Lattner75548062006-10-11 03:58:02 +00001042 // TODO: check to see if missing bits are just not demanded.
1043
1044 // Otherwise, this pattern doesn't match.
1045 return false;
1046}
1047
1048/// CheckOrMask - The isel is trying to match something like (or X, 255). If
1049/// the dag combiner simplified the 255, we still want to match. RHS is the
1050/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value
1051/// specified in the .td file (e.g. 255).
Daniel Dunbara279bc32009-09-20 02:20:51 +00001052bool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS,
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001053 int64_t DesiredMaskS) const {
1054 const APInt &ActualMask = RHS->getAPIntValue();
1055 const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001056
Chris Lattner75548062006-10-11 03:58:02 +00001057 // If the actual mask exactly matches, success!
1058 if (ActualMask == DesiredMask)
1059 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001060
Chris Lattner75548062006-10-11 03:58:02 +00001061 // If the actual AND mask is allowing unallowed bits, this doesn't match.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001062 if (ActualMask.intersects(~DesiredMask))
Chris Lattner75548062006-10-11 03:58:02 +00001063 return false;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001064
Chris Lattner75548062006-10-11 03:58:02 +00001065 // Otherwise, the DAG Combiner may have proven that the value coming in is
1066 // either already zero or is not demanded. Check for known zero input bits.
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001067 APInt NeededMask = DesiredMask & ~ActualMask;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001068
Dan Gohman2e68b6f2008-02-25 21:11:39 +00001069 APInt KnownZero, KnownOne;
Dan Gohmanea859be2007-06-22 14:59:07 +00001070 CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne);
Daniel Dunbara279bc32009-09-20 02:20:51 +00001071
Chris Lattner75548062006-10-11 03:58:02 +00001072 // If all the missing bits in the or are already known to be set, match!
1073 if ((NeededMask & KnownOne) == NeededMask)
1074 return true;
Daniel Dunbara279bc32009-09-20 02:20:51 +00001075
Chris Lattner75548062006-10-11 03:58:02 +00001076 // TODO: check to see if missing bits are just not demanded.
Daniel Dunbara279bc32009-09-20 02:20:51 +00001077
Chris Lattner75548062006-10-11 03:58:02 +00001078 // Otherwise, this pattern doesn't match.
1079 return false;
1080}
1081
Jim Laskey9ff542f2006-08-01 18:29:48 +00001082
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001083/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated
1084/// by tblgen. Others should not call it.
1085void SelectionDAGISel::
Dan Gohmanf350b272008-08-23 02:25:05 +00001086SelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) {
Dan Gohman475871a2008-07-27 21:46:04 +00001087 std::vector<SDValue> InOps;
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001088 std::swap(InOps, Ops);
1089
Chris Lattnerdecc2672010-04-07 05:20:54 +00001090 Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0
1091 Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1
1092 Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc
Dale Johannesenf1e309e2010-07-02 20:16:09 +00001093 Ops.push_back(InOps[InlineAsm::Op_IsAlignStack]); // 3
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001094
Chris Lattnerdecc2672010-04-07 05:20:54 +00001095 unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size();
Owen Anderson825b72b2009-08-11 20:47:22 +00001096 if (InOps[e-1].getValueType() == MVT::Flag)
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001097 --e; // Don't process a flag operand if it is here.
Daniel Dunbara279bc32009-09-20 02:20:51 +00001098
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001099 while (i != e) {
Dan Gohmanf5aeb1a2008-09-12 16:56:44 +00001100 unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue();
Chris Lattnerdecc2672010-04-07 05:20:54 +00001101 if (!InlineAsm::isMemKind(Flags)) {
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001102 // Just skip over this operand, copying the operands verbatim.
Evan Cheng697cbbf2009-03-20 18:03:34 +00001103 Ops.insert(Ops.end(), InOps.begin()+i,
1104 InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1);
1105 i += InlineAsm::getNumOperandRegisters(Flags) + 1;
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001106 } else {
Evan Cheng697cbbf2009-03-20 18:03:34 +00001107 assert(InlineAsm::getNumOperandRegisters(Flags) == 1 &&
1108 "Memory operand with multiple values?");
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001109 // Otherwise, this is a memory operand. Ask the target to select it.
Dan Gohman475871a2008-07-27 21:46:04 +00001110 std::vector<SDValue> SelOps;
Chris Lattnerdecc2672010-04-07 05:20:54 +00001111 if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps))
Chris Lattner75361b62010-04-07 22:58:41 +00001112 report_fatal_error("Could not match memory address. Inline asm"
Chris Lattner87d677c2010-04-07 23:50:38 +00001113 " failure!");
Daniel Dunbara279bc32009-09-20 02:20:51 +00001114
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001115 // Add this to the output node.
Chris Lattnerdecc2672010-04-07 05:20:54 +00001116 unsigned NewFlags =
1117 InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size());
1118 Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32));
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001119 Ops.insert(Ops.end(), SelOps.begin(), SelOps.end());
1120 i += 2;
1121 }
1122 }
Daniel Dunbara279bc32009-09-20 02:20:51 +00001123
Chris Lattner0e43f2b2006-02-24 02:13:54 +00001124 // Add the flag input back if present.
1125 if (e != InOps.size())
1126 Ops.push_back(InOps.back());
1127}
Devang Patel794fd752007-05-01 21:15:47 +00001128
Owen Andersone50ed302009-08-10 22:56:29 +00001129/// findFlagUse - Return use of EVT::Flag value produced by the specified
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001130/// SDNode.
1131///
1132static SDNode *findFlagUse(SDNode *N) {
1133 unsigned FlagResNo = N->getNumValues()-1;
1134 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
1135 SDUse &Use = I.getUse();
1136 if (Use.getResNo() == FlagResNo)
1137 return Use.getUser();
1138 }
1139 return NULL;
1140}
1141
1142/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def".
1143/// This function recursively traverses up the operand chain, ignoring
1144/// certain nodes.
1145static bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse,
Chris Lattnerd1b73822010-03-02 22:20:06 +00001146 SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited,
1147 bool IgnoreChains) {
Chris Lattnerda244a02010-02-23 19:32:27 +00001148 // The NodeID's are given uniques ID's where a node ID is guaranteed to be
1149 // greater than all of its (recursive) operands. If we scan to a point where
1150 // 'use' is smaller than the node we're scanning for, then we know we will
1151 // never find it.
1152 //
1153 // The Use may be -1 (unassigned) if it is a newly allocated node. This can
1154 // happen because we scan down to newly selected nodes in the case of flag
1155 // uses.
1156 if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1))
1157 return false;
1158
1159 // Don't revisit nodes if we already scanned it and didn't fail, we know we
1160 // won't fail if we scan it again.
1161 if (!Visited.insert(Use))
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001162 return false;
1163
1164 for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) {
Chris Lattnerd1b73822010-03-02 22:20:06 +00001165 // Ignore chain uses, they are validated by HandleMergeInputChains.
1166 if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains)
1167 continue;
1168
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001169 SDNode *N = Use->getOperand(i).getNode();
1170 if (N == Def) {
1171 if (Use == ImmedUse || Use == Root)
1172 continue; // We are not looking for immediate use.
1173 assert(N != Root);
1174 return true;
1175 }
1176
1177 // Traverse up the operand chain.
Chris Lattnerd1b73822010-03-02 22:20:06 +00001178 if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains))
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001179 return true;
1180 }
1181 return false;
1182}
1183
Evan Cheng014bf212010-02-15 19:41:07 +00001184/// IsProfitableToFold - Returns true if it's profitable to fold the specific
1185/// operand node N of U during instruction selection that starts at Root.
1186bool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U,
1187 SDNode *Root) const {
1188 if (OptLevel == CodeGenOpt::None) return false;
1189 return N.hasOneUse();
1190}
1191
1192/// IsLegalToFold - Returns true if the specific operand node N of
1193/// U can be folded during instruction selection that starts at Root.
Chris Lattnerd1b73822010-03-02 22:20:06 +00001194bool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root,
Dan Gohmand858e902010-04-17 15:26:15 +00001195 CodeGenOpt::Level OptLevel,
1196 bool IgnoreChains) {
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001197 if (OptLevel == CodeGenOpt::None) return false;
1198
1199 // If Root use can somehow reach N through a path that that doesn't contain
1200 // U then folding N would create a cycle. e.g. In the following
1201 // diagram, Root can reach N through X. If N is folded into into Root, then
1202 // X is both a predecessor and a successor of U.
1203 //
1204 // [N*] //
1205 // ^ ^ //
1206 // / \ //
1207 // [U*] [X]? //
1208 // ^ ^ //
1209 // \ / //
1210 // \ / //
1211 // [Root*] //
1212 //
1213 // * indicates nodes to be folded together.
1214 //
1215 // If Root produces a flag, then it gets (even more) interesting. Since it
1216 // will be "glued" together with its flag use in the scheduler, we need to
1217 // check if it might reach N.
1218 //
1219 // [N*] //
1220 // ^ ^ //
1221 // / \ //
1222 // [U*] [X]? //
1223 // ^ ^ //
1224 // \ \ //
1225 // \ | //
1226 // [Root*] | //
1227 // ^ | //
1228 // f | //
1229 // | / //
1230 // [Y] / //
1231 // ^ / //
1232 // f / //
1233 // | / //
1234 // [FU] //
1235 //
1236 // If FU (flag use) indirectly reaches N (the load), and Root folds N
1237 // (call it Fold), then X is a predecessor of FU and a successor of
1238 // Fold. But since Fold and FU are flagged together, this will create
1239 // a cycle in the scheduling graph.
1240
Chris Lattner9bbcd5e2010-03-05 05:49:45 +00001241 // If the node has flags, walk down the graph to the "lowest" node in the
1242 // flagged set.
Owen Andersone50ed302009-08-10 22:56:29 +00001243 EVT VT = Root->getValueType(Root->getNumValues()-1);
Owen Anderson825b72b2009-08-11 20:47:22 +00001244 while (VT == MVT::Flag) {
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001245 SDNode *FU = findFlagUse(Root);
1246 if (FU == NULL)
1247 break;
1248 Root = FU;
1249 VT = Root->getValueType(Root->getNumValues()-1);
Chris Lattner18fdaba2010-03-05 06:19:13 +00001250
1251 // If our query node has a flag result with a use, we've walked up it. If
1252 // the user (which has already been selected) has a chain or indirectly uses
1253 // the chain, our WalkChainUsers predicate will not consider it. Because of
1254 // this, we cannot ignore chains in this predicate.
1255 IgnoreChains = false;
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001256 }
Chris Lattner18fdaba2010-03-05 06:19:13 +00001257
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001258
Chris Lattner9bbcd5e2010-03-05 05:49:45 +00001259 SmallPtrSet<SDNode*, 16> Visited;
1260 return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains);
Anton Korobeynikovc1c6ef82009-05-08 18:51:58 +00001261}
1262
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001263SDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) {
1264 std::vector<SDValue> Ops(N->op_begin(), N->op_end());
Dan Gohmane1f188f2009-10-29 22:30:23 +00001265 SelectInlineAsmMemoryOperands(Ops);
1266
1267 std::vector<EVT> VTs;
1268 VTs.push_back(MVT::Other);
1269 VTs.push_back(MVT::Flag);
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001270 SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(),
Dan Gohmane1f188f2009-10-29 22:30:23 +00001271 VTs, &Ops[0], Ops.size());
Chris Lattnerd1b73822010-03-02 22:20:06 +00001272 New->setNodeId(-1);
Dan Gohmane1f188f2009-10-29 22:30:23 +00001273 return New.getNode();
1274}
1275
Dan Gohmaneeb3a002010-01-05 01:24:18 +00001276SDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) {
Chris Lattner518bb532010-02-09 19:54:29 +00001277 return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0));
Dan Gohmane1f188f2009-10-29 22:30:23 +00001278}
1279
Chris Lattner2a49d572010-02-28 22:37:22 +00001280/// GetVBR - decode a vbr encoding whose top bit is set.
1281ALWAYS_INLINE static uint64_t
1282GetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) {
1283 assert(Val >= 128 && "Not a VBR");
1284 Val &= 127; // Remove first vbr bit.
1285
1286 unsigned Shift = 7;
1287 uint64_t NextBits;
1288 do {
Chris Lattner14df8dc2010-02-28 22:38:43 +00001289 NextBits = MatcherTable[Idx++];
Chris Lattner2a49d572010-02-28 22:37:22 +00001290 Val |= (NextBits&127) << Shift;
1291 Shift += 7;
1292 } while (NextBits & 128);
1293
1294 return Val;
1295}
1296
Chris Lattner2a49d572010-02-28 22:37:22 +00001297
1298/// UpdateChainsAndFlags - When a match is complete, this method updates uses of
1299/// interior flag and chain results to use the new flag and chain results.
Chris Lattner82dd3d32010-03-02 07:50:03 +00001300void SelectionDAGISel::
1301UpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain,
1302 const SmallVectorImpl<SDNode*> &ChainNodesMatched,
1303 SDValue InputFlag,
1304 const SmallVectorImpl<SDNode*> &FlagResultNodesMatched,
1305 bool isMorphNodeTo) {
1306 SmallVector<SDNode*, 4> NowDeadNodes;
1307
1308 ISelUpdater ISU(ISelPosition);
1309
Chris Lattner2a49d572010-02-28 22:37:22 +00001310 // Now that all the normal results are replaced, we replace the chain and
1311 // flag results if present.
1312 if (!ChainNodesMatched.empty()) {
1313 assert(InputChain.getNode() != 0 &&
1314 "Matched input chains but didn't produce a chain");
1315 // Loop over all of the nodes we matched that produced a chain result.
1316 // Replace all the chain results with the final chain we ended up with.
1317 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1318 SDNode *ChainNode = ChainNodesMatched[i];
1319
Chris Lattner82dd3d32010-03-02 07:50:03 +00001320 // If this node was already deleted, don't look at it.
1321 if (ChainNode->getOpcode() == ISD::DELETED_NODE)
1322 continue;
1323
Chris Lattner2a49d572010-02-28 22:37:22 +00001324 // Don't replace the results of the root node if we're doing a
1325 // MorphNodeTo.
1326 if (ChainNode == NodeToMatch && isMorphNodeTo)
1327 continue;
1328
1329 SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1);
1330 if (ChainVal.getValueType() == MVT::Flag)
1331 ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2);
1332 assert(ChainVal.getValueType() == MVT::Other && "Not a chain?");
Chris Lattner82dd3d32010-03-02 07:50:03 +00001333 CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU);
1334
Chris Lattner856fb392010-03-28 05:28:31 +00001335 // If the node became dead and we haven't already seen it, delete it.
1336 if (ChainNode->use_empty() &&
1337 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode))
Chris Lattner82dd3d32010-03-02 07:50:03 +00001338 NowDeadNodes.push_back(ChainNode);
Chris Lattner2a49d572010-02-28 22:37:22 +00001339 }
1340 }
1341
1342 // If the result produces a flag, update any flag results in the matched
1343 // pattern with the flag result.
1344 if (InputFlag.getNode() != 0) {
1345 // Handle any interior nodes explicitly marked.
1346 for (unsigned i = 0, e = FlagResultNodesMatched.size(); i != e; ++i) {
1347 SDNode *FRN = FlagResultNodesMatched[i];
Chris Lattner82dd3d32010-03-02 07:50:03 +00001348
1349 // If this node was already deleted, don't look at it.
1350 if (FRN->getOpcode() == ISD::DELETED_NODE)
1351 continue;
1352
Chris Lattner2a49d572010-02-28 22:37:22 +00001353 assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Flag &&
1354 "Doesn't have a flag result");
1355 CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1),
Chris Lattner82dd3d32010-03-02 07:50:03 +00001356 InputFlag, &ISU);
1357
Chris Lattner19e37cb2010-03-28 04:54:33 +00001358 // If the node became dead and we haven't already seen it, delete it.
1359 if (FRN->use_empty() &&
1360 !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN))
Chris Lattner82dd3d32010-03-02 07:50:03 +00001361 NowDeadNodes.push_back(FRN);
Chris Lattner2a49d572010-02-28 22:37:22 +00001362 }
1363 }
1364
Chris Lattner82dd3d32010-03-02 07:50:03 +00001365 if (!NowDeadNodes.empty())
1366 CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU);
1367
Chris Lattner2a49d572010-02-28 22:37:22 +00001368 DEBUG(errs() << "ISEL: Match complete!\n");
1369}
1370
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001371enum ChainResult {
1372 CR_Simple,
1373 CR_InducesCycle,
1374 CR_LeadsToInteriorNode
1375};
1376
1377/// WalkChainUsers - Walk down the users of the specified chained node that is
1378/// part of the pattern we're matching, looking at all of the users we find.
1379/// This determines whether something is an interior node, whether we have a
1380/// non-pattern node in between two pattern nodes (which prevent folding because
1381/// it would induce a cycle) and whether we have a TokenFactor node sandwiched
1382/// between pattern nodes (in which case the TF becomes part of the pattern).
1383///
1384/// The walk we do here is guaranteed to be small because we quickly get down to
1385/// already selected nodes "below" us.
1386static ChainResult
1387WalkChainUsers(SDNode *ChainedNode,
1388 SmallVectorImpl<SDNode*> &ChainedNodesInPattern,
1389 SmallVectorImpl<SDNode*> &InteriorChainedNodes) {
1390 ChainResult Result = CR_Simple;
1391
1392 for (SDNode::use_iterator UI = ChainedNode->use_begin(),
1393 E = ChainedNode->use_end(); UI != E; ++UI) {
1394 // Make sure the use is of the chain, not some other value we produce.
1395 if (UI.getUse().getValueType() != MVT::Other) continue;
1396
1397 SDNode *User = *UI;
1398
1399 // If we see an already-selected machine node, then we've gone beyond the
1400 // pattern that we're selecting down into the already selected chunk of the
1401 // DAG.
1402 if (User->isMachineOpcode() ||
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001403 User->getOpcode() == ISD::HANDLENODE) // Root of the graph.
1404 continue;
Chris Lattnerd1b73822010-03-02 22:20:06 +00001405
1406 if (User->getOpcode() == ISD::CopyToReg ||
1407 User->getOpcode() == ISD::CopyFromReg ||
Chris Lattner7561d482010-03-14 02:33:54 +00001408 User->getOpcode() == ISD::INLINEASM ||
1409 User->getOpcode() == ISD::EH_LABEL) {
Chris Lattnerd1b73822010-03-02 22:20:06 +00001410 // If their node ID got reset to -1 then they've already been selected.
1411 // Treat them like a MachineOpcode.
1412 if (User->getNodeId() == -1)
1413 continue;
1414 }
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001415
1416 // If we have a TokenFactor, we handle it specially.
1417 if (User->getOpcode() != ISD::TokenFactor) {
1418 // If the node isn't a token factor and isn't part of our pattern, then it
1419 // must be a random chained node in between two nodes we're selecting.
1420 // This happens when we have something like:
1421 // x = load ptr
1422 // call
1423 // y = x+4
1424 // store y -> ptr
1425 // Because we structurally match the load/store as a read/modify/write,
1426 // but the call is chained between them. We cannot fold in this case
1427 // because it would induce a cycle in the graph.
1428 if (!std::count(ChainedNodesInPattern.begin(),
1429 ChainedNodesInPattern.end(), User))
1430 return CR_InducesCycle;
1431
1432 // Otherwise we found a node that is part of our pattern. For example in:
1433 // x = load ptr
1434 // y = x+4
1435 // store y -> ptr
1436 // This would happen when we're scanning down from the load and see the
1437 // store as a user. Record that there is a use of ChainedNode that is
1438 // part of the pattern and keep scanning uses.
1439 Result = CR_LeadsToInteriorNode;
1440 InteriorChainedNodes.push_back(User);
1441 continue;
1442 }
1443
1444 // If we found a TokenFactor, there are two cases to consider: first if the
1445 // TokenFactor is just hanging "below" the pattern we're matching (i.e. no
1446 // uses of the TF are in our pattern) we just want to ignore it. Second,
1447 // the TokenFactor can be sandwiched in between two chained nodes, like so:
1448 // [Load chain]
1449 // ^
1450 // |
1451 // [Load]
1452 // ^ ^
1453 // | \ DAG's like cheese
1454 // / \ do you?
1455 // / |
1456 // [TokenFactor] [Op]
1457 // ^ ^
1458 // | |
1459 // \ /
1460 // \ /
1461 // [Store]
1462 //
1463 // In this case, the TokenFactor becomes part of our match and we rewrite it
1464 // as a new TokenFactor.
1465 //
1466 // To distinguish these two cases, do a recursive walk down the uses.
1467 switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) {
1468 case CR_Simple:
1469 // If the uses of the TokenFactor are just already-selected nodes, ignore
1470 // it, it is "below" our pattern.
1471 continue;
1472 case CR_InducesCycle:
1473 // If the uses of the TokenFactor lead to nodes that are not part of our
1474 // pattern that are not selected, folding would turn this into a cycle,
1475 // bail out now.
1476 return CR_InducesCycle;
1477 case CR_LeadsToInteriorNode:
1478 break; // Otherwise, keep processing.
1479 }
1480
1481 // Okay, we know we're in the interesting interior case. The TokenFactor
1482 // is now going to be considered part of the pattern so that we rewrite its
1483 // uses (it may have uses that are not part of the pattern) with the
1484 // ultimate chain result of the generated code. We will also add its chain
1485 // inputs as inputs to the ultimate TokenFactor we create.
1486 Result = CR_LeadsToInteriorNode;
1487 ChainedNodesInPattern.push_back(User);
1488 InteriorChainedNodes.push_back(User);
1489 continue;
1490 }
1491
1492 return Result;
1493}
1494
Chris Lattner6b307922010-03-02 00:00:03 +00001495/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains
Chris Lattner00592ec2010-03-02 19:34:59 +00001496/// operation for when the pattern matched at least one node with a chains. The
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001497/// input vector contains a list of all of the chained nodes that we match. We
1498/// must determine if this is a valid thing to cover (i.e. matching it won't
1499/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will
1500/// be used as the input node chain for the generated nodes.
Chris Lattner6b307922010-03-02 00:00:03 +00001501static SDValue
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001502HandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched,
Chris Lattner6b307922010-03-02 00:00:03 +00001503 SelectionDAG *CurDAG) {
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001504 // Walk all of the chained nodes we've matched, recursively scanning down the
1505 // users of the chain result. This adds any TokenFactor nodes that are caught
1506 // in between chained nodes to the chained and interior nodes list.
1507 SmallVector<SDNode*, 3> InteriorChainedNodes;
1508 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
1509 if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched,
1510 InteriorChainedNodes) == CR_InducesCycle)
1511 return SDValue(); // Would induce a cycle.
1512 }
Chris Lattner6b307922010-03-02 00:00:03 +00001513
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001514 // Okay, we have walked all the matched nodes and collected TokenFactor nodes
1515 // that we are interested in. Form our input TokenFactor node.
Chris Lattner6b307922010-03-02 00:00:03 +00001516 SmallVector<SDValue, 3> InputChains;
1517 for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) {
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001518 // Add the input chain of this node to the InputChains list (which will be
1519 // the operands of the generated TokenFactor) if it's not an interior node.
1520 SDNode *N = ChainNodesMatched[i];
1521 if (N->getOpcode() != ISD::TokenFactor) {
1522 if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N))
1523 continue;
1524
1525 // Otherwise, add the input chain.
1526 SDValue InChain = ChainNodesMatched[i]->getOperand(0);
1527 assert(InChain.getValueType() == MVT::Other && "Not a chain");
Chris Lattner6b307922010-03-02 00:00:03 +00001528 InputChains.push_back(InChain);
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001529 continue;
1530 }
1531
1532 // If we have a token factor, we want to add all inputs of the token factor
1533 // that are not part of the pattern we're matching.
1534 for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) {
1535 if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(),
Chris Lattner6183fbd2010-03-02 02:37:23 +00001536 N->getOperand(op).getNode()))
1537 InputChains.push_back(N->getOperand(op));
Chris Lattnerc6d7ad32010-03-02 02:22:10 +00001538 }
Chris Lattner6b307922010-03-02 00:00:03 +00001539 }
1540
1541 SDValue Res;
1542 if (InputChains.size() == 1)
1543 return InputChains[0];
1544 return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(),
1545 MVT::Other, &InputChains[0], InputChains.size());
1546}
Chris Lattner2a49d572010-02-28 22:37:22 +00001547
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001548/// MorphNode - Handle morphing a node in place for the selector.
1549SDNode *SelectionDAGISel::
1550MorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList,
1551 const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) {
1552 // It is possible we're using MorphNodeTo to replace a node with no
1553 // normal results with one that has a normal result (or we could be
1554 // adding a chain) and the input could have flags and chains as well.
Chris Lattnercaa88702010-03-28 08:43:23 +00001555 // In this case we need to shift the operands down.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001556 // FIXME: This is a horrible hack and broken in obscure cases, no worse
Chris Lattnera6f86932010-03-27 18:54:50 +00001557 // than the old isel though.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001558 int OldFlagResultNo = -1, OldChainResultNo = -1;
1559
1560 unsigned NTMNumResults = Node->getNumValues();
1561 if (Node->getValueType(NTMNumResults-1) == MVT::Flag) {
1562 OldFlagResultNo = NTMNumResults-1;
1563 if (NTMNumResults != 1 &&
1564 Node->getValueType(NTMNumResults-2) == MVT::Other)
1565 OldChainResultNo = NTMNumResults-2;
1566 } else if (Node->getValueType(NTMNumResults-1) == MVT::Other)
1567 OldChainResultNo = NTMNumResults-1;
1568
Chris Lattner61c97f62010-03-02 07:14:49 +00001569 // Call the underlying SelectionDAG routine to do the transmogrification. Note
1570 // that this deletes operands of the old node that become dead.
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001571 SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps);
1572
1573 // MorphNodeTo can operate in two ways: if an existing node with the
1574 // specified operands exists, it can just return it. Otherwise, it
1575 // updates the node in place to have the requested operands.
1576 if (Res == Node) {
1577 // If we updated the node in place, reset the node ID. To the isel,
1578 // this should be just like a newly allocated machine node.
1579 Res->setNodeId(-1);
1580 }
1581
1582 unsigned ResNumResults = Res->getNumValues();
1583 // Move the flag if needed.
1584 if ((EmitNodeInfo & OPFL_FlagOutput) && OldFlagResultNo != -1 &&
1585 (unsigned)OldFlagResultNo != ResNumResults-1)
1586 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldFlagResultNo),
1587 SDValue(Res, ResNumResults-1));
1588
1589 if ((EmitNodeInfo & OPFL_FlagOutput) != 0)
Bill Wendlingd9cb7ca2010-07-04 08:58:43 +00001590 --ResNumResults;
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001591
1592 // Move the chain reference if needed.
1593 if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 &&
1594 (unsigned)OldChainResultNo != ResNumResults-1)
1595 CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo),
1596 SDValue(Res, ResNumResults-1));
1597
1598 // Otherwise, no replacement happened because the node already exists. Replace
1599 // Uses of the old node with the new one.
1600 if (Res != Node)
1601 CurDAG->ReplaceAllUsesWith(Node, Res);
1602
1603 return Res;
1604}
1605
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001606/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
1607ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001608CheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1609 SDValue N, const SmallVectorImpl<SDValue> &RecordedNodes) {
1610 // Accept if it is exactly the same as a previously recorded node.
1611 unsigned RecNo = MatcherTable[MatcherIndex++];
1612 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
1613 return N == RecordedNodes[RecNo];
1614}
1615
1616/// CheckPatternPredicate - Implements OP_CheckPatternPredicate.
1617ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001618CheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1619 SelectionDAGISel &SDISel) {
1620 return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]);
1621}
1622
1623/// CheckNodePredicate - Implements OP_CheckNodePredicate.
1624ALWAYS_INLINE static bool
1625CheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1626 SelectionDAGISel &SDISel, SDNode *N) {
1627 return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]);
1628}
1629
1630ALWAYS_INLINE static bool
1631CheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1632 SDNode *N) {
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00001633 uint16_t Opc = MatcherTable[MatcherIndex++];
1634 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
1635 return N->getOpcode() == Opc;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001636}
1637
1638ALWAYS_INLINE static bool
1639CheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1640 SDValue N, const TargetLowering &TLI) {
1641 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1642 if (N.getValueType() == VT) return true;
1643
1644 // Handle the case when VT is iPTR.
1645 return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy();
1646}
1647
1648ALWAYS_INLINE static bool
Chris Lattnerda828e32010-03-03 07:46:25 +00001649CheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1650 SDValue N, const TargetLowering &TLI,
1651 unsigned ChildNo) {
1652 if (ChildNo >= N.getNumOperands())
1653 return false; // Match fails if out of range child #.
1654 return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI);
1655}
1656
1657
1658ALWAYS_INLINE static bool
1659CheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1660 SDValue N) {
1661 return cast<CondCodeSDNode>(N)->get() ==
1662 (ISD::CondCode)MatcherTable[MatcherIndex++];
1663}
1664
1665ALWAYS_INLINE static bool
1666CheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1667 SDValue N, const TargetLowering &TLI) {
1668 MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
1669 if (cast<VTSDNode>(N)->getVT() == VT)
1670 return true;
1671
1672 // Handle the case when VT is iPTR.
1673 return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy();
1674}
1675
1676ALWAYS_INLINE static bool
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001677CheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1678 SDValue N) {
1679 int64_t Val = MatcherTable[MatcherIndex++];
1680 if (Val & 128)
1681 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1682
1683 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N);
1684 return C != 0 && C->getSExtValue() == Val;
1685}
1686
Chris Lattnerda828e32010-03-03 07:46:25 +00001687ALWAYS_INLINE static bool
1688CheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1689 SDValue N, SelectionDAGISel &SDISel) {
1690 int64_t Val = MatcherTable[MatcherIndex++];
1691 if (Val & 128)
1692 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1693
1694 if (N->getOpcode() != ISD::AND) return false;
1695
1696 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1697 return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val);
1698}
1699
1700ALWAYS_INLINE static bool
1701CheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex,
1702 SDValue N, SelectionDAGISel &SDISel) {
1703 int64_t Val = MatcherTable[MatcherIndex++];
1704 if (Val & 128)
1705 Val = GetVBR(Val, MatcherTable, MatcherIndex);
1706
1707 if (N->getOpcode() != ISD::OR) return false;
1708
1709 ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1));
1710 return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val);
1711}
1712
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001713/// IsPredicateKnownToFail - If we know how and can do so without pushing a
1714/// scope, evaluate the current node. If the current predicate is known to
1715/// fail, set Result=true and return anything. If the current predicate is
1716/// known to pass, set Result=false and return the MatcherIndex to continue
1717/// with. If the current predicate is unknown, set Result=false and return the
1718/// MatcherIndex to continue with.
1719static unsigned IsPredicateKnownToFail(const unsigned char *Table,
1720 unsigned Index, SDValue N,
Chris Lattnerda828e32010-03-03 07:46:25 +00001721 bool &Result, SelectionDAGISel &SDISel,
1722 SmallVectorImpl<SDValue> &RecordedNodes){
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001723 switch (Table[Index++]) {
1724 default:
1725 Result = false;
1726 return Index-1; // Could not evaluate this predicate.
Chris Lattnerda828e32010-03-03 07:46:25 +00001727 case SelectionDAGISel::OPC_CheckSame:
1728 Result = !::CheckSame(Table, Index, N, RecordedNodes);
1729 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001730 case SelectionDAGISel::OPC_CheckPatternPredicate:
Chris Lattnerda828e32010-03-03 07:46:25 +00001731 Result = !::CheckPatternPredicate(Table, Index, SDISel);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001732 return Index;
1733 case SelectionDAGISel::OPC_CheckPredicate:
Chris Lattnerda828e32010-03-03 07:46:25 +00001734 Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode());
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001735 return Index;
1736 case SelectionDAGISel::OPC_CheckOpcode:
1737 Result = !::CheckOpcode(Table, Index, N.getNode());
1738 return Index;
1739 case SelectionDAGISel::OPC_CheckType:
1740 Result = !::CheckType(Table, Index, N, SDISel.TLI);
1741 return Index;
1742 case SelectionDAGISel::OPC_CheckChild0Type:
1743 case SelectionDAGISel::OPC_CheckChild1Type:
1744 case SelectionDAGISel::OPC_CheckChild2Type:
1745 case SelectionDAGISel::OPC_CheckChild3Type:
1746 case SelectionDAGISel::OPC_CheckChild4Type:
1747 case SelectionDAGISel::OPC_CheckChild5Type:
1748 case SelectionDAGISel::OPC_CheckChild6Type:
Chris Lattnerda828e32010-03-03 07:46:25 +00001749 case SelectionDAGISel::OPC_CheckChild7Type:
1750 Result = !::CheckChildType(Table, Index, N, SDISel.TLI,
1751 Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001752 return Index;
Chris Lattnerda828e32010-03-03 07:46:25 +00001753 case SelectionDAGISel::OPC_CheckCondCode:
1754 Result = !::CheckCondCode(Table, Index, N);
1755 return Index;
1756 case SelectionDAGISel::OPC_CheckValueType:
1757 Result = !::CheckValueType(Table, Index, N, SDISel.TLI);
1758 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001759 case SelectionDAGISel::OPC_CheckInteger:
1760 Result = !::CheckInteger(Table, Index, N);
1761 return Index;
Chris Lattnerda828e32010-03-03 07:46:25 +00001762 case SelectionDAGISel::OPC_CheckAndImm:
1763 Result = !::CheckAndImm(Table, Index, N, SDISel);
1764 return Index;
1765 case SelectionDAGISel::OPC_CheckOrImm:
1766 Result = !::CheckOrImm(Table, Index, N, SDISel);
1767 return Index;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001768 }
1769}
1770
Dan Gohmanb3579832010-04-15 17:08:50 +00001771namespace {
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00001772
Chris Lattner2a49d572010-02-28 22:37:22 +00001773struct MatchScope {
1774 /// FailIndex - If this match fails, this is the index to continue with.
1775 unsigned FailIndex;
1776
1777 /// NodeStack - The node stack when the scope was formed.
1778 SmallVector<SDValue, 4> NodeStack;
1779
1780 /// NumRecordedNodes - The number of recorded nodes when the scope was formed.
1781 unsigned NumRecordedNodes;
1782
1783 /// NumMatchedMemRefs - The number of matched memref entries.
1784 unsigned NumMatchedMemRefs;
1785
1786 /// InputChain/InputFlag - The current chain/flag
1787 SDValue InputChain, InputFlag;
1788
1789 /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty.
1790 bool HasChainNodesMatched, HasFlagResultNodesMatched;
1791};
1792
Dan Gohmanb3579832010-04-15 17:08:50 +00001793}
1794
Chris Lattner2a49d572010-02-28 22:37:22 +00001795SDNode *SelectionDAGISel::
1796SelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable,
1797 unsigned TableSize) {
1798 // FIXME: Should these even be selected? Handle these cases in the caller?
1799 switch (NodeToMatch->getOpcode()) {
1800 default:
1801 break;
1802 case ISD::EntryToken: // These nodes remain the same.
1803 case ISD::BasicBlock:
1804 case ISD::Register:
Chris Lattner3b9d6212010-03-14 17:53:23 +00001805 //case ISD::VALUETYPE:
1806 //case ISD::CONDCODE:
Chris Lattner2a49d572010-02-28 22:37:22 +00001807 case ISD::HANDLENODE:
Chris Lattnerdecc2672010-04-07 05:20:54 +00001808 case ISD::MDNODE_SDNODE:
Chris Lattner2a49d572010-02-28 22:37:22 +00001809 case ISD::TargetConstant:
1810 case ISD::TargetConstantFP:
1811 case ISD::TargetConstantPool:
1812 case ISD::TargetFrameIndex:
1813 case ISD::TargetExternalSymbol:
1814 case ISD::TargetBlockAddress:
1815 case ISD::TargetJumpTable:
1816 case ISD::TargetGlobalTLSAddress:
1817 case ISD::TargetGlobalAddress:
1818 case ISD::TokenFactor:
1819 case ISD::CopyFromReg:
1820 case ISD::CopyToReg:
Chris Lattner7561d482010-03-14 02:33:54 +00001821 case ISD::EH_LABEL:
Chris Lattnerd1b73822010-03-02 22:20:06 +00001822 NodeToMatch->setNodeId(-1); // Mark selected.
Chris Lattner2a49d572010-02-28 22:37:22 +00001823 return 0;
1824 case ISD::AssertSext:
1825 case ISD::AssertZext:
1826 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0),
1827 NodeToMatch->getOperand(0));
1828 return 0;
1829 case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch);
Chris Lattner2a49d572010-02-28 22:37:22 +00001830 case ISD::UNDEF: return Select_UNDEF(NodeToMatch);
1831 }
1832
1833 assert(!NodeToMatch->isMachineOpcode() && "Node already selected!");
1834
1835 // Set up the node stack with NodeToMatch as the only node on the stack.
1836 SmallVector<SDValue, 8> NodeStack;
1837 SDValue N = SDValue(NodeToMatch, 0);
1838 NodeStack.push_back(N);
1839
1840 // MatchScopes - Scopes used when matching, if a match failure happens, this
1841 // indicates where to continue checking.
1842 SmallVector<MatchScope, 8> MatchScopes;
1843
1844 // RecordedNodes - This is the set of nodes that have been recorded by the
1845 // state machine.
1846 SmallVector<SDValue, 8> RecordedNodes;
1847
1848 // MatchedMemRefs - This is the set of MemRef's we've seen in the input
1849 // pattern.
1850 SmallVector<MachineMemOperand*, 2> MatchedMemRefs;
1851
1852 // These are the current input chain and flag for use when generating nodes.
1853 // Various Emit operations change these. For example, emitting a copytoreg
1854 // uses and updates these.
1855 SDValue InputChain, InputFlag;
1856
1857 // ChainNodesMatched - If a pattern matches nodes that have input/output
1858 // chains, the OPC_EmitMergeInputChains operation is emitted which indicates
1859 // which ones they are. The result is captured into this list so that we can
1860 // update the chain results when the pattern is complete.
1861 SmallVector<SDNode*, 3> ChainNodesMatched;
1862 SmallVector<SDNode*, 3> FlagResultNodesMatched;
1863
1864 DEBUG(errs() << "ISEL: Starting pattern match on root node: ";
1865 NodeToMatch->dump(CurDAG);
1866 errs() << '\n');
1867
Chris Lattner7390eeb2010-03-01 18:47:11 +00001868 // Determine where to start the interpreter. Normally we start at opcode #0,
1869 // but if the state machine starts with an OPC_SwitchOpcode, then we
1870 // accelerate the first lookup (which is guaranteed to be hot) with the
1871 // OpcodeOffset table.
Chris Lattner2a49d572010-02-28 22:37:22 +00001872 unsigned MatcherIndex = 0;
Chris Lattner7390eeb2010-03-01 18:47:11 +00001873
1874 if (!OpcodeOffset.empty()) {
1875 // Already computed the OpcodeOffset table, just index into it.
1876 if (N.getOpcode() < OpcodeOffset.size())
1877 MatcherIndex = OpcodeOffset[N.getOpcode()];
1878 DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n");
1879
1880 } else if (MatcherTable[0] == OPC_SwitchOpcode) {
1881 // Otherwise, the table isn't computed, but the state machine does start
1882 // with an OPC_SwitchOpcode instruction. Populate the table now, since this
1883 // is the first time we're selecting an instruction.
1884 unsigned Idx = 1;
1885 while (1) {
1886 // Get the size of this case.
1887 unsigned CaseSize = MatcherTable[Idx++];
1888 if (CaseSize & 128)
1889 CaseSize = GetVBR(CaseSize, MatcherTable, Idx);
1890 if (CaseSize == 0) break;
1891
1892 // Get the opcode, add the index to the table.
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00001893 uint16_t Opc = MatcherTable[Idx++];
1894 Opc |= (unsigned short)MatcherTable[Idx++] << 8;
Chris Lattner7390eeb2010-03-01 18:47:11 +00001895 if (Opc >= OpcodeOffset.size())
1896 OpcodeOffset.resize((Opc+1)*2);
1897 OpcodeOffset[Opc] = Idx;
1898 Idx += CaseSize;
1899 }
1900
1901 // Okay, do the lookup for the first opcode.
1902 if (N.getOpcode() < OpcodeOffset.size())
1903 MatcherIndex = OpcodeOffset[N.getOpcode()];
1904 }
1905
Chris Lattner2a49d572010-02-28 22:37:22 +00001906 while (1) {
1907 assert(MatcherIndex < TableSize && "Invalid index");
Dan Gohman19b38262010-03-09 02:15:05 +00001908#ifndef NDEBUG
1909 unsigned CurrentOpcodeIndex = MatcherIndex;
1910#endif
Chris Lattner2a49d572010-02-28 22:37:22 +00001911 BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++];
1912 switch (Opcode) {
1913 case OPC_Scope: {
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001914 // Okay, the semantics of this operation are that we should push a scope
1915 // then evaluate the first child. However, pushing a scope only to have
1916 // the first check fail (which then pops it) is inefficient. If we can
1917 // determine immediately that the first check (or first several) will
1918 // immediately fail, don't even bother pushing a scope for them.
1919 unsigned FailIndex;
1920
1921 while (1) {
1922 unsigned NumToSkip = MatcherTable[MatcherIndex++];
1923 if (NumToSkip & 128)
1924 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
1925 // Found the end of the scope with no match.
1926 if (NumToSkip == 0) {
1927 FailIndex = 0;
1928 break;
1929 }
1930
1931 FailIndex = MatcherIndex+NumToSkip;
1932
Chris Lattnera6f86932010-03-27 18:54:50 +00001933 unsigned MatcherIndexOfPredicate = MatcherIndex;
1934 (void)MatcherIndexOfPredicate; // silence warning.
1935
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001936 // If we can't evaluate this predicate without pushing a scope (e.g. if
1937 // it is a 'MoveParent') or if the predicate succeeds on this node, we
1938 // push the scope and evaluate the full predicate chain.
1939 bool Result;
1940 MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N,
Chris Lattnerda828e32010-03-03 07:46:25 +00001941 Result, *this, RecordedNodes);
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001942 if (!Result)
1943 break;
1944
Chris Lattnera6f86932010-03-27 18:54:50 +00001945 DEBUG(errs() << " Skipped scope entry (due to false predicate) at "
1946 << "index " << MatcherIndexOfPredicate
1947 << ", continuing at " << FailIndex << "\n");
Chris Lattnerbed993d2010-03-28 19:46:56 +00001948 ++NumDAGIselRetries;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001949
1950 // Otherwise, we know that this case of the Scope is guaranteed to fail,
1951 // move to the next case.
1952 MatcherIndex = FailIndex;
1953 }
1954
1955 // If the whole scope failed to match, bail.
1956 if (FailIndex == 0) break;
1957
Chris Lattner2a49d572010-02-28 22:37:22 +00001958 // Push a MatchScope which indicates where to go if the first child fails
1959 // to match.
1960 MatchScope NewEntry;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00001961 NewEntry.FailIndex = FailIndex;
Chris Lattner2a49d572010-02-28 22:37:22 +00001962 NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end());
1963 NewEntry.NumRecordedNodes = RecordedNodes.size();
1964 NewEntry.NumMatchedMemRefs = MatchedMemRefs.size();
1965 NewEntry.InputChain = InputChain;
1966 NewEntry.InputFlag = InputFlag;
1967 NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty();
1968 NewEntry.HasFlagResultNodesMatched = !FlagResultNodesMatched.empty();
1969 MatchScopes.push_back(NewEntry);
1970 continue;
1971 }
1972 case OPC_RecordNode:
1973 // Remember this node, it may end up being an operand in the pattern.
1974 RecordedNodes.push_back(N);
1975 continue;
1976
1977 case OPC_RecordChild0: case OPC_RecordChild1:
1978 case OPC_RecordChild2: case OPC_RecordChild3:
1979 case OPC_RecordChild4: case OPC_RecordChild5:
1980 case OPC_RecordChild6: case OPC_RecordChild7: {
1981 unsigned ChildNo = Opcode-OPC_RecordChild0;
1982 if (ChildNo >= N.getNumOperands())
1983 break; // Match fails if out of range child #.
1984
1985 RecordedNodes.push_back(N->getOperand(ChildNo));
1986 continue;
1987 }
1988 case OPC_RecordMemRef:
1989 MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand());
1990 continue;
1991
1992 case OPC_CaptureFlagInput:
1993 // If the current node has an input flag, capture it in InputFlag.
1994 if (N->getNumOperands() != 0 &&
1995 N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag)
1996 InputFlag = N->getOperand(N->getNumOperands()-1);
1997 continue;
1998
1999 case OPC_MoveChild: {
2000 unsigned ChildNo = MatcherTable[MatcherIndex++];
2001 if (ChildNo >= N.getNumOperands())
2002 break; // Match fails if out of range child #.
2003 N = N.getOperand(ChildNo);
2004 NodeStack.push_back(N);
2005 continue;
2006 }
2007
2008 case OPC_MoveParent:
2009 // Pop the current node off the NodeStack.
2010 NodeStack.pop_back();
2011 assert(!NodeStack.empty() && "Node stack imbalance!");
2012 N = NodeStack.back();
2013 continue;
2014
Chris Lattnerda828e32010-03-03 07:46:25 +00002015 case OPC_CheckSame:
2016 if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002017 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002018 case OPC_CheckPatternPredicate:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002019 if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002020 continue;
2021 case OPC_CheckPredicate:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002022 if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this,
2023 N.getNode()))
2024 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002025 continue;
Chris Lattner57bf8a42010-03-04 01:23:08 +00002026 case OPC_CheckComplexPat: {
2027 unsigned CPNum = MatcherTable[MatcherIndex++];
2028 unsigned RecNo = MatcherTable[MatcherIndex++];
2029 assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat");
2030 if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo], CPNum,
2031 RecordedNodes))
Chris Lattner2a49d572010-02-28 22:37:22 +00002032 break;
2033 continue;
Chris Lattner57bf8a42010-03-04 01:23:08 +00002034 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002035 case OPC_CheckOpcode:
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002036 if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break;
2037 continue;
2038
2039 case OPC_CheckType:
2040 if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002041 continue;
2042
Chris Lattnereb669212010-03-01 06:59:22 +00002043 case OPC_SwitchOpcode: {
2044 unsigned CurNodeOpcode = N.getOpcode();
Chris Lattner7d892d62010-03-01 07:43:08 +00002045 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
Chris Lattnereb669212010-03-01 06:59:22 +00002046 unsigned CaseSize;
2047 while (1) {
2048 // Get the size of this case.
2049 CaseSize = MatcherTable[MatcherIndex++];
2050 if (CaseSize & 128)
2051 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2052 if (CaseSize == 0) break;
2053
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002054 uint16_t Opc = MatcherTable[MatcherIndex++];
2055 Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
2056
Chris Lattnereb669212010-03-01 06:59:22 +00002057 // If the opcode matches, then we will execute this case.
Chris Lattnerd5d5a3d2010-03-25 06:33:05 +00002058 if (CurNodeOpcode == Opc)
Chris Lattnereb669212010-03-01 06:59:22 +00002059 break;
2060
2061 // Otherwise, skip over this case.
2062 MatcherIndex += CaseSize;
2063 }
2064
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002065 // If no cases matched, bail out.
Chris Lattnereb669212010-03-01 06:59:22 +00002066 if (CaseSize == 0) break;
2067
2068 // Otherwise, execute the case we found.
2069 DEBUG(errs() << " OpcodeSwitch from " << SwitchStart
2070 << " to " << MatcherIndex << "\n");
2071 continue;
2072 }
2073
Chris Lattnercfe2eab2010-03-03 06:28:15 +00002074 case OPC_SwitchType: {
2075 MVT::SimpleValueType CurNodeVT = N.getValueType().getSimpleVT().SimpleTy;
2076 unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart;
2077 unsigned CaseSize;
2078 while (1) {
2079 // Get the size of this case.
2080 CaseSize = MatcherTable[MatcherIndex++];
2081 if (CaseSize & 128)
2082 CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex);
2083 if (CaseSize == 0) break;
2084
2085 MVT::SimpleValueType CaseVT =
2086 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2087 if (CaseVT == MVT::iPTR)
2088 CaseVT = TLI.getPointerTy().SimpleTy;
2089
2090 // If the VT matches, then we will execute this case.
2091 if (CurNodeVT == CaseVT)
2092 break;
2093
2094 // Otherwise, skip over this case.
2095 MatcherIndex += CaseSize;
2096 }
2097
2098 // If no cases matched, bail out.
2099 if (CaseSize == 0) break;
2100
2101 // Otherwise, execute the case we found.
2102 DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString()
2103 << "] from " << SwitchStart << " to " << MatcherIndex<<'\n');
2104 continue;
2105 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002106 case OPC_CheckChild0Type: case OPC_CheckChild1Type:
2107 case OPC_CheckChild2Type: case OPC_CheckChild3Type:
2108 case OPC_CheckChild4Type: case OPC_CheckChild5Type:
Chris Lattnerda828e32010-03-03 07:46:25 +00002109 case OPC_CheckChild6Type: case OPC_CheckChild7Type:
2110 if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI,
2111 Opcode-OPC_CheckChild0Type))
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002112 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002113 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002114 case OPC_CheckCondCode:
Chris Lattnerda828e32010-03-03 07:46:25 +00002115 if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002116 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002117 case OPC_CheckValueType:
2118 if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002119 continue;
Chris Lattnerf1b7c7d2010-03-03 07:31:15 +00002120 case OPC_CheckInteger:
2121 if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002122 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002123 case OPC_CheckAndImm:
2124 if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002125 continue;
Chris Lattnerda828e32010-03-03 07:46:25 +00002126 case OPC_CheckOrImm:
2127 if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002128 continue;
Chris Lattner2a49d572010-02-28 22:37:22 +00002129
2130 case OPC_CheckFoldableChainNode: {
2131 assert(NodeStack.size() != 1 && "No parent node");
2132 // Verify that all intermediate nodes between the root and this one have
2133 // a single use.
2134 bool HasMultipleUses = false;
2135 for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i)
2136 if (!NodeStack[i].hasOneUse()) {
2137 HasMultipleUses = true;
2138 break;
2139 }
2140 if (HasMultipleUses) break;
2141
2142 // Check to see that the target thinks this is profitable to fold and that
2143 // we can fold it without inducing cycles in the graph.
2144 if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(),
2145 NodeToMatch) ||
2146 !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(),
Dan Gohmand858e902010-04-17 15:26:15 +00002147 NodeToMatch, OptLevel,
2148 true/*We validate our own chains*/))
Chris Lattner2a49d572010-02-28 22:37:22 +00002149 break;
2150
2151 continue;
2152 }
Chris Lattner2a49d572010-02-28 22:37:22 +00002153 case OPC_EmitInteger: {
2154 MVT::SimpleValueType VT =
2155 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2156 int64_t Val = MatcherTable[MatcherIndex++];
2157 if (Val & 128)
2158 Val = GetVBR(Val, MatcherTable, MatcherIndex);
2159 RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT));
2160 continue;
2161 }
2162 case OPC_EmitRegister: {
2163 MVT::SimpleValueType VT =
2164 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2165 unsigned RegNo = MatcherTable[MatcherIndex++];
2166 RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT));
2167 continue;
2168 }
2169
2170 case OPC_EmitConvertToTarget: {
2171 // Convert from IMM/FPIMM to target version.
2172 unsigned RecNo = MatcherTable[MatcherIndex++];
2173 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2174 SDValue Imm = RecordedNodes[RecNo];
2175
2176 if (Imm->getOpcode() == ISD::Constant) {
2177 int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue();
2178 Imm = CurDAG->getTargetConstant(Val, Imm.getValueType());
2179 } else if (Imm->getOpcode() == ISD::ConstantFP) {
2180 const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue();
2181 Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType());
2182 }
2183
2184 RecordedNodes.push_back(Imm);
2185 continue;
2186 }
2187
Chris Lattneraa4e3392010-03-28 05:50:16 +00002188 case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0
2189 case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1
2190 // These are space-optimized forms of OPC_EmitMergeInputChains.
2191 assert(InputChain.getNode() == 0 &&
2192 "EmitMergeInputChains should be the first chain producing node");
2193 assert(ChainNodesMatched.empty() &&
2194 "Should only have one EmitMergeInputChains per match");
2195
2196 // Read all of the chained nodes.
2197 unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1;
2198 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2199 ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2200
2201 // FIXME: What if other value results of the node have uses not matched
2202 // by this pattern?
2203 if (ChainNodesMatched.back() != NodeToMatch &&
2204 !RecordedNodes[RecNo].hasOneUse()) {
2205 ChainNodesMatched.clear();
2206 break;
2207 }
2208
2209 // Merge the input chains if they are not intra-pattern references.
2210 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2211
2212 if (InputChain.getNode() == 0)
2213 break; // Failed to merge.
2214 continue;
2215 }
2216
Chris Lattner2a49d572010-02-28 22:37:22 +00002217 case OPC_EmitMergeInputChains: {
2218 assert(InputChain.getNode() == 0 &&
2219 "EmitMergeInputChains should be the first chain producing node");
2220 // This node gets a list of nodes we matched in the input that have
2221 // chains. We want to token factor all of the input chains to these nodes
2222 // together. However, if any of the input chains is actually one of the
2223 // nodes matched in this pattern, then we have an intra-match reference.
2224 // Ignore these because the newly token factored chain should not refer to
2225 // the old nodes.
2226 unsigned NumChains = MatcherTable[MatcherIndex++];
2227 assert(NumChains != 0 && "Can't TF zero chains");
2228
2229 assert(ChainNodesMatched.empty() &&
2230 "Should only have one EmitMergeInputChains per match");
2231
Chris Lattner2a49d572010-02-28 22:37:22 +00002232 // Read all of the chained nodes.
Chris Lattner00592ec2010-03-02 19:34:59 +00002233 for (unsigned i = 0; i != NumChains; ++i) {
2234 unsigned RecNo = MatcherTable[MatcherIndex++];
Chris Lattner2a49d572010-02-28 22:37:22 +00002235 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2236 ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2237
2238 // FIXME: What if other value results of the node have uses not matched
2239 // by this pattern?
2240 if (ChainNodesMatched.back() != NodeToMatch &&
2241 !RecordedNodes[RecNo].hasOneUse()) {
2242 ChainNodesMatched.clear();
2243 break;
2244 }
2245 }
Chris Lattner6b307922010-03-02 00:00:03 +00002246
2247 // If the inner loop broke out, the match fails.
2248 if (ChainNodesMatched.empty())
2249 break;
Chris Lattner2a49d572010-02-28 22:37:22 +00002250
Chris Lattner6b307922010-03-02 00:00:03 +00002251 // Merge the input chains if they are not intra-pattern references.
2252 InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG);
2253
2254 if (InputChain.getNode() == 0)
2255 break; // Failed to merge.
Chris Lattner2a49d572010-02-28 22:37:22 +00002256
Chris Lattner2a49d572010-02-28 22:37:22 +00002257 continue;
2258 }
2259
2260 case OPC_EmitCopyToReg: {
2261 unsigned RecNo = MatcherTable[MatcherIndex++];
2262 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2263 unsigned DestPhysReg = MatcherTable[MatcherIndex++];
2264
2265 if (InputChain.getNode() == 0)
2266 InputChain = CurDAG->getEntryNode();
2267
2268 InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(),
2269 DestPhysReg, RecordedNodes[RecNo],
2270 InputFlag);
2271
2272 InputFlag = InputChain.getValue(1);
2273 continue;
2274 }
2275
2276 case OPC_EmitNodeXForm: {
2277 unsigned XFormNo = MatcherTable[MatcherIndex++];
2278 unsigned RecNo = MatcherTable[MatcherIndex++];
2279 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2280 RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo));
2281 continue;
2282 }
2283
2284 case OPC_EmitNode:
2285 case OPC_MorphNodeTo: {
Chris Lattner14df8dc2010-02-28 22:38:43 +00002286 uint16_t TargetOpc = MatcherTable[MatcherIndex++];
2287 TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8;
Chris Lattner2a49d572010-02-28 22:37:22 +00002288 unsigned EmitNodeInfo = MatcherTable[MatcherIndex++];
2289 // Get the result VT list.
2290 unsigned NumVTs = MatcherTable[MatcherIndex++];
2291 SmallVector<EVT, 4> VTs;
2292 for (unsigned i = 0; i != NumVTs; ++i) {
2293 MVT::SimpleValueType VT =
2294 (MVT::SimpleValueType)MatcherTable[MatcherIndex++];
2295 if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy;
2296 VTs.push_back(VT);
2297 }
2298
2299 if (EmitNodeInfo & OPFL_Chain)
2300 VTs.push_back(MVT::Other);
2301 if (EmitNodeInfo & OPFL_FlagOutput)
2302 VTs.push_back(MVT::Flag);
2303
Chris Lattner7d892d62010-03-01 07:43:08 +00002304 // This is hot code, so optimize the two most common cases of 1 and 2
2305 // results.
2306 SDVTList VTList;
2307 if (VTs.size() == 1)
2308 VTList = CurDAG->getVTList(VTs[0]);
2309 else if (VTs.size() == 2)
2310 VTList = CurDAG->getVTList(VTs[0], VTs[1]);
2311 else
2312 VTList = CurDAG->getVTList(VTs.data(), VTs.size());
Chris Lattner2a49d572010-02-28 22:37:22 +00002313
2314 // Get the operand list.
2315 unsigned NumOps = MatcherTable[MatcherIndex++];
2316 SmallVector<SDValue, 8> Ops;
2317 for (unsigned i = 0; i != NumOps; ++i) {
2318 unsigned RecNo = MatcherTable[MatcherIndex++];
2319 if (RecNo & 128)
2320 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2321
2322 assert(RecNo < RecordedNodes.size() && "Invalid EmitNode");
2323 Ops.push_back(RecordedNodes[RecNo]);
2324 }
2325
2326 // If there are variadic operands to add, handle them now.
2327 if (EmitNodeInfo & OPFL_VariadicInfo) {
2328 // Determine the start index to copy from.
2329 unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo);
2330 FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0;
2331 assert(NodeToMatch->getNumOperands() >= FirstOpToCopy &&
2332 "Invalid variadic node");
2333 // Copy all of the variadic operands, not including a potential flag
2334 // input.
2335 for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands();
2336 i != e; ++i) {
2337 SDValue V = NodeToMatch->getOperand(i);
2338 if (V.getValueType() == MVT::Flag) break;
2339 Ops.push_back(V);
2340 }
2341 }
2342
2343 // If this has chain/flag inputs, add them.
2344 if (EmitNodeInfo & OPFL_Chain)
2345 Ops.push_back(InputChain);
2346 if ((EmitNodeInfo & OPFL_FlagInput) && InputFlag.getNode() != 0)
2347 Ops.push_back(InputFlag);
2348
2349 // Create the node.
2350 SDNode *Res = 0;
2351 if (Opcode != OPC_MorphNodeTo) {
2352 // If this is a normal EmitNode command, just create the new node and
2353 // add the results to the RecordedNodes list.
2354 Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(),
2355 VTList, Ops.data(), Ops.size());
2356
2357 // Add all the non-flag/non-chain results to the RecordedNodes list.
2358 for (unsigned i = 0, e = VTs.size(); i != e; ++i) {
2359 if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break;
2360 RecordedNodes.push_back(SDValue(Res, i));
2361 }
2362
2363 } else {
Chris Lattner3ff1e4d2010-03-02 06:55:04 +00002364 Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(),
2365 EmitNodeInfo);
Chris Lattner2a49d572010-02-28 22:37:22 +00002366 }
2367
2368 // If the node had chain/flag results, update our notion of the current
2369 // chain and flag.
Chris Lattner82dd3d32010-03-02 07:50:03 +00002370 if (EmitNodeInfo & OPFL_FlagOutput) {
Chris Lattner2a49d572010-02-28 22:37:22 +00002371 InputFlag = SDValue(Res, VTs.size()-1);
2372 if (EmitNodeInfo & OPFL_Chain)
2373 InputChain = SDValue(Res, VTs.size()-2);
2374 } else if (EmitNodeInfo & OPFL_Chain)
2375 InputChain = SDValue(Res, VTs.size()-1);
2376
2377 // If the OPFL_MemRefs flag is set on this node, slap all of the
2378 // accumulated memrefs onto it.
2379 //
2380 // FIXME: This is vastly incorrect for patterns with multiple outputs
2381 // instructions that access memory and for ComplexPatterns that match
2382 // loads.
2383 if (EmitNodeInfo & OPFL_MemRefs) {
2384 MachineSDNode::mmo_iterator MemRefs =
2385 MF->allocateMemRefsArray(MatchedMemRefs.size());
2386 std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs);
2387 cast<MachineSDNode>(Res)
2388 ->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size());
2389 }
2390
2391 DEBUG(errs() << " "
2392 << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created")
2393 << " node: "; Res->dump(CurDAG); errs() << "\n");
2394
2395 // If this was a MorphNodeTo then we're completely done!
2396 if (Opcode == OPC_MorphNodeTo) {
2397 // Update chain and flag uses.
2398 UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched,
Chris Lattner82dd3d32010-03-02 07:50:03 +00002399 InputFlag, FlagResultNodesMatched, true);
2400 return Res;
Chris Lattner2a49d572010-02-28 22:37:22 +00002401 }
2402
2403 continue;
2404 }
2405
2406 case OPC_MarkFlagResults: {
2407 unsigned NumNodes = MatcherTable[MatcherIndex++];
2408
2409 // Read and remember all the flag-result nodes.
2410 for (unsigned i = 0; i != NumNodes; ++i) {
2411 unsigned RecNo = MatcherTable[MatcherIndex++];
2412 if (RecNo & 128)
2413 RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex);
2414
2415 assert(RecNo < RecordedNodes.size() && "Invalid CheckSame");
2416 FlagResultNodesMatched.push_back(RecordedNodes[RecNo].getNode());
2417 }
2418 continue;
2419 }
2420
2421 case OPC_CompleteMatch: {
2422 // The match has been completed, and any new nodes (if any) have been
2423 // created. Patch up references to the matched dag to use the newly
2424 // created nodes.
2425 unsigned NumResults = MatcherTable[MatcherIndex++];
2426
2427 for (unsigned i = 0; i != NumResults; ++i) {
2428 unsigned ResSlot = MatcherTable[MatcherIndex++];
2429 if (ResSlot & 128)
2430 ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex);
2431
2432 assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame");
2433 SDValue Res = RecordedNodes[ResSlot];
2434
Chris Lattnerb0e483e2010-03-28 05:54:03 +00002435 assert(i < NodeToMatch->getNumValues() &&
2436 NodeToMatch->getValueType(i) != MVT::Other &&
2437 NodeToMatch->getValueType(i) != MVT::Flag &&
2438 "Invalid number of results to complete!");
Chris Lattner2a49d572010-02-28 22:37:22 +00002439 assert((NodeToMatch->getValueType(i) == Res.getValueType() ||
2440 NodeToMatch->getValueType(i) == MVT::iPTR ||
2441 Res.getValueType() == MVT::iPTR ||
2442 NodeToMatch->getValueType(i).getSizeInBits() ==
2443 Res.getValueType().getSizeInBits()) &&
2444 "invalid replacement");
2445 CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res);
2446 }
2447
2448 // If the root node defines a flag, add it to the flag nodes to update
2449 // list.
2450 if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Flag)
2451 FlagResultNodesMatched.push_back(NodeToMatch);
2452
2453 // Update chain and flag uses.
2454 UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched,
Chris Lattner82dd3d32010-03-02 07:50:03 +00002455 InputFlag, FlagResultNodesMatched, false);
Chris Lattner2a49d572010-02-28 22:37:22 +00002456
2457 assert(NodeToMatch->use_empty() &&
2458 "Didn't replace all uses of the node?");
2459
2460 // FIXME: We just return here, which interacts correctly with SelectRoot
2461 // above. We should fix this to not return an SDNode* anymore.
2462 return 0;
2463 }
2464 }
2465
2466 // If the code reached this point, then the match failed. See if there is
2467 // another child to try in the current 'Scope', otherwise pop it until we
2468 // find a case to check.
Dan Gohman19b38262010-03-09 02:15:05 +00002469 DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n");
Chris Lattnerbed993d2010-03-28 19:46:56 +00002470 ++NumDAGIselRetries;
Chris Lattner2a49d572010-02-28 22:37:22 +00002471 while (1) {
2472 if (MatchScopes.empty()) {
2473 CannotYetSelect(NodeToMatch);
2474 return 0;
2475 }
2476
2477 // Restore the interpreter state back to the point where the scope was
2478 // formed.
2479 MatchScope &LastScope = MatchScopes.back();
2480 RecordedNodes.resize(LastScope.NumRecordedNodes);
2481 NodeStack.clear();
2482 NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end());
2483 N = NodeStack.back();
2484
Chris Lattner2a49d572010-02-28 22:37:22 +00002485 if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size())
2486 MatchedMemRefs.resize(LastScope.NumMatchedMemRefs);
2487 MatcherIndex = LastScope.FailIndex;
2488
Dan Gohman19b38262010-03-09 02:15:05 +00002489 DEBUG(errs() << " Continuing at " << MatcherIndex << "\n");
2490
Chris Lattner2a49d572010-02-28 22:37:22 +00002491 InputChain = LastScope.InputChain;
2492 InputFlag = LastScope.InputFlag;
2493 if (!LastScope.HasChainNodesMatched)
2494 ChainNodesMatched.clear();
2495 if (!LastScope.HasFlagResultNodesMatched)
2496 FlagResultNodesMatched.clear();
2497
2498 // Check to see what the offset is at the new MatcherIndex. If it is zero
2499 // we have reached the end of this scope, otherwise we have another child
2500 // in the current scope to try.
2501 unsigned NumToSkip = MatcherTable[MatcherIndex++];
2502 if (NumToSkip & 128)
2503 NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex);
2504
2505 // If we have another child in this scope to match, update FailIndex and
2506 // try it.
2507 if (NumToSkip != 0) {
2508 LastScope.FailIndex = MatcherIndex+NumToSkip;
2509 break;
2510 }
2511
2512 // End of this scope, pop it and try the next child in the containing
2513 // scope.
2514 MatchScopes.pop_back();
2515 }
2516 }
2517}
2518
2519
2520
Dan Gohmaneeb3a002010-01-05 01:24:18 +00002521void SelectionDAGISel::CannotYetSelect(SDNode *N) {
Dan Gohmane1f188f2009-10-29 22:30:23 +00002522 std::string msg;
2523 raw_string_ostream Msg(msg);
2524 Msg << "Cannot yet select: ";
Chris Lattner2c4afd12010-03-04 00:21:16 +00002525
2526 if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN &&
2527 N->getOpcode() != ISD::INTRINSIC_WO_CHAIN &&
2528 N->getOpcode() != ISD::INTRINSIC_VOID) {
2529 N->printrFull(Msg, CurDAG);
2530 } else {
2531 bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other;
2532 unsigned iid =
2533 cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue();
2534 if (iid < Intrinsic::num_intrinsics)
2535 Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid);
2536 else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo())
2537 Msg << "target intrinsic %" << TII->getName(iid);
2538 else
2539 Msg << "unknown intrinsic #" << iid;
2540 }
Chris Lattner75361b62010-04-07 22:58:41 +00002541 report_fatal_error(Msg.str());
Dan Gohmane1f188f2009-10-29 22:30:23 +00002542}
2543
Devang Patel19974732007-05-03 01:11:54 +00002544char SelectionDAGISel::ID = 0;