SelectionDAGISel.cpp revision 6a732b5a669c85505a5785ee7ccb72eb9d1a4e6d
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 81c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 91c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This implements the SelectionDAGISel class. 111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define DEBUG_TYPE "isel" 1584fbac580941548a6ab1121ed3b0ffdc4e2bc080Dan Gohman#include "ScheduleDAGSDNodes.h" 162048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman#include "SelectionDAGBuilder.h" 176277eb2bb997a5da0808a8a5a57f18fd9faaf336Dan Gohman#include "FunctionLoweringInfo.h" 1884fbac580941548a6ab1121ed3b0ffdc4e2bc080Dan Gohman#include "llvm/CodeGen/SelectionDAGISel.h" 19c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 20713f043c16220b746804f668a72f4e0344cbe4d1Devang Patel#include "llvm/Analysis/DebugInfo.h" 215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 23ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 2775c478a96a542dc386152e00518441e63d22058dChris Lattner#include "llvm/LLVMContext.h" 2878eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman#include "llvm/CodeGen/FastISel.h" 295a29c9eed157af51a8d338b5a225b146881819e8Gordon Henriksen#include "llvm/CodeGen/GCStrategy.h" 305eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen#include "llvm/CodeGen/GCMetadata.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 35fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman#include "llvm/CodeGen/ScheduleHazardRecognizer.h" 36eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 386f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 39e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman#include "llvm/Target/TargetIntrinsicInfo.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 43124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 44a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 45db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 467d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin#include "llvm/Support/ErrorHandling.h" 47db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 48ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar#include "llvm/Support/raw_ostream.h" 49c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner#include "llvm/ADT/Statistic.h" 507e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 53c19ae9d91d30bc008e0be5f5d4727f333199f64cChris LattnerSTATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on"); 54bed993d8a4ede75a24a142437057b42498ce5b9fChris LattnerSTATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path"); 55c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner 56ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 57293d5f8bc02a9148238b2c79484637f56de65b9cDan GohmanEnableFastISelVerbose("fast-isel-verbose", cl::Hidden, 58d659d50482e2f9edf8f436e4a1aa30c68c6d020bDan Gohman cl::desc("Enable verbose messages in the \"fast\" " 59293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohman "instruction selector")); 60293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohmanstatic cl::opt<bool> 614344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan GohmanEnableFastISelAbort("fast-isel-abort", cl::Hidden, 624344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman cl::desc("Enable abort calls when \"fast\" instruction fails")); 63ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 64da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 657944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 66462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 67462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 68462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 69462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 70462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 71462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 72462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 73462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 74462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 75462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 76462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 77462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 78462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 79462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 8025cf2275ff7de3de3bc0e508abaf457413d74725Duncan SandsViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden, 8125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands cl::desc("Pop up a window to show dags before the post legalize types" 8225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands " dag combine pass")); 8325cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sandsstatic cl::opt<bool> 84a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 85a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 86a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 87a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 88a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 893e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 903e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 915bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 927944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 93462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 94462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 95462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 9625cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombineLT = false, 97462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 98462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 997944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 1007944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 101eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 102eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 103eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 104eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 105eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 106eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 107eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 108eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 109eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 110eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 111eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 112eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 113844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 114844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 115844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 116844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 117844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 118844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 11913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 120844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 121b8cab9227a0f6ffbdaae33e3c64268e265008a6aDan GohmandefaultListDAGScheduler("default", "Best scheduler for the target", 122844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1234ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 124f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohmannamespace llvm { 125f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman //===--------------------------------------------------------------------===// 126f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// createDefaultScheduler - This creates an instruction scheduler appropriate 127f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// for the target. 12847ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS, 12998a366d547772010e94609e4584489b3e5ce0043Bill Wendling CodeGenOpt::Level OptLevel) { 130e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman const TargetLowering &TLI = IS->getTargetLowering(); 131e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman 13298a366d547772010e94609e4584489b3e5ce0043Bill Wendling if (OptLevel == CodeGenOpt::None) 133be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createFastDAGScheduler(IS, OptLevel); 1349e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) 135be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createTDListDAGScheduler(IS, OptLevel); 1369e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman assert(TLI.getSchedulingPreference() == 137187361b056823df4ff292561fe47468dad956872Bill Wendling TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 138be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createBURRListDAGScheduler(IS, OptLevel); 1393a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 1401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 142ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 143533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// that mark instructions with the 'usesCustomInserter' flag. These 144025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 145025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 146533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// basic blocks, and this method is called to expand it into a sequence of 147533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// instructions, potentially also creating new basic blocks and control flow. 148533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// When new basic blocks are inserted and the edges from MBB to its successors 149533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// are modified, the method should insert pairs of <OldSucc, NewSucc> into the 150533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// DenseMap. 151ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 152fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng MachineBasicBlock *MBB, 153fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*> *EM) const { 154f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#ifndef NDEBUG 1551a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "If a target marks an instruction with " 156533297b58da8c74bec65551e1aface9801fc2259Dan Gohman "'usesCustomInserter', it must implement " 157f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "TargetLowering::EmitInstrWithCustomInserter!"; 158f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#endif 159c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable(0); 160a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar return 0; 161025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 162025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 1637041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 1647041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 1657041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 1661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 16798a366d547772010e94609e4584489b3e5ce0043Bill WendlingSelectionDAGISel::SelectionDAGISel(TargetMachine &tm, CodeGenOpt::Level OL) : 168ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()), 1697c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 1707c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG(new SelectionDAG(TLI, *FuncInfo)), 1712048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB(new SelectionDAGBuilder(*CurDAG, TLI, *FuncInfo, OL)), 1727c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 173be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling OptLevel(OL), 1747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DAGSize(0) 1757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman{} 1767c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 1777c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 1782048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman delete SDB; 1797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 1807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 1817c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 1827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 183495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 184c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 185a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<AliasAnalysis>(); 1865eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 187a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<GCModuleInfo>(); 188ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass::getAnalysisUsage(AU); 189495a0b51915eb763576874f29192820b731edc22Chris Lattner} 1901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 191ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohmanbool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) { 1924344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman // Do some sanity-checking on the command-line options. 1934344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelVerbose || EnableFastISel) && 1944344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-verbose requires -fast-isel"); 1954344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelAbort || EnableFastISel) && 1964344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-abort requires -fast-isel"); 1974344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman 198c0fb65da040668df543db514f05e4be571edf700Dan Gohman Function &Fn = *mf.getFunction(); 1998a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII = *TM.getInstrInfo(); 2008a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI = *TM.getRegisterInfo(); 2018a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 202c0fb65da040668df543db514f05e4be571edf700Dan Gohman MF = &mf; 20379ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman RegInfo = &MF->getRegInfo(); 204c0fb65da040668df543db514f05e4be571edf700Dan Gohman AA = &getAnalysis<AliasAnalysis>(); 205c0fb65da040668df543db514f05e4be571edf700Dan Gohman GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0; 206c0fb65da040668df543db514f05e4be571edf700Dan Gohman 2071a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n"); 2081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 209de6e783b2490447866b592cd39855e6f4d25efffChris Lattner CurDAG->init(*MF); 2106277eb2bb997a5da0808a8a5a57f18fd9faaf336Dan Gohman FuncInfo->set(Fn, *MF, EnableFastISel); 2112048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->init(GFI, *AA); 2121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2136a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman SelectAllBasicBlocks(Fn); 214edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2155dc44335b19dde981e4ad69ab7a650269460ed3cDan Gohman // Release function-specific state. SDB and CurDAG are already cleared 2165dc44335b19dde981e4ad69ab7a650269460ed3cDan Gohman // at this point. 2175dc44335b19dde981e4ad69ab7a650269460ed3cDan Gohman FuncInfo->clear(); 2185dc44335b19dde981e4ad69ab7a650269460ed3cDan Gohman 2198a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // If the first basic block in the function has live ins that need to be 2208a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 2218a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 22298708260f55cab997a5db77e930a2bd35f4172aaDan Gohman RegInfo->EmitLiveInCopies(MF->begin(), TRI, TII); 2238a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 22707f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// SetDebugLoc - Update MF's and SDB's DebugLocs if debug information is 22807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// attached with this instruction. 22923dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattnerstatic void SetDebugLoc(Instruction *I, SelectionDAGBuilder *SDB, 2300eb419800ae51d6e0e00a656ede0627483755361Chris Lattner FastISel *FastIS, MachineFunction *MF) { 231de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner DebugLoc DL = I->getDebugLoc(); 232de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner if (DL.isUnknown()) return; 23323dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner 234de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner SDB->setCurDebugLoc(DL); 2350eb419800ae51d6e0e00a656ede0627483755361Chris Lattner 23623dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner if (FastIS) 237de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner FastIS->setCurDebugLoc(DL); 2380eb419800ae51d6e0e00a656ede0627483755361Chris Lattner 23923dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner // If the function doesn't have a default debug location yet, set 24023dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner // it. This is kind of a hack. 24123dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner if (MF->getDefaultDebugLoc().isUnknown()) 242de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner MF->setDefaultDebugLoc(DL); 24307f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman} 24407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 24507f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// ResetDebugLoc - Set MF's and SDB's DebugLocs to Unknown. 2463990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattnerstatic void ResetDebugLoc(SelectionDAGBuilder *SDB, FastISel *FastIS) { 247a4f2bb08de92ccec21cbb3d0a9518384b0173660Chris Lattner SDB->setCurDebugLoc(DebugLoc()); 24807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman if (FastIS) 249a4f2bb08de92ccec21cbb3d0a9518384b0173660Chris Lattner FastIS->setCurDebugLoc(DebugLoc()); 25007f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman} 25107f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 252f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, 253f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator Begin, 254b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman BasicBlock::iterator End, 255b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool &HadTailCall) { 2562048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 257f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 25898ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 25998ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // as a tail call, cease emitting nodes for this block. 2602048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (BasicBlock::iterator I = Begin; I != End && !SDB->HasTailCall; ++I) { 26123dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner SetDebugLoc(I, SDB, 0, MF); 26207f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 2637f6b8b8891adedce162ce23f5b540f98af202b22Dan Gohman // Visit the instruction. Terminators are handled below. 2647f6b8b8891adedce162ce23f5b540f98af202b22Dan Gohman if (!isa<TerminatorInst>(I)) 2652048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visit(*I); 26607f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 2677f6b8b8891adedce162ce23f5b540f98af202b22Dan Gohman ResetDebugLoc(SDB, 0); 268123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel } 269f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 2702048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->HasTailCall) { 27198ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Ensure that all instructions which are used outside of their defining 27298ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // blocks are available as virtual registers. Invoke is handled elsewhere. 27398ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman for (BasicBlock::iterator I = Begin; I != End; ++I) 27498ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (!isa<PHINode>(I) && !isa<InvokeInst>(I)) 2752048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->CopyToExportRegsIfNeeded(I); 276f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 27798ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Handle PHI nodes in successor blocks. 27898ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (End == LLVMBB->end()) { 27998ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman HandlePHINodesInSuccessorBlocks(LLVMBB); 2803df24e667f04a7003342b534310919abc9c87418Dan Gohman 28198ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower the terminator after the copies are emitted. 28223dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner SetDebugLoc(LLVMBB->getTerminator(), SDB, 0, MF); 2832048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visit(*LLVMBB->getTerminator()); 28407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, 0); 28598ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman } 2863df24e667f04a7003342b534310919abc9c87418Dan Gohman } 287a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 288a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 2892048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 290c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 291f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Final step, emit the lowered DAG as machine code. 292f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 2932048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman HadTailCall = SDB->HasTailCall; 2942048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 2951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengnamespace { 29854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted 29954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// nodes from the worklist. 30054e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengclass SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener { 30154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng SmallVector<SDNode*, 128> &Worklist; 30225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &InWorklist; 30354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengpublic: 30425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl, 30525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &inwl) 30625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner : Worklist(wl), InWorklist(inwl) {} 30725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 30825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner void RemoveFromWorklist(SDNode *N) { 30925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!InWorklist.erase(N)) return; 31025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 31125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallVector<SDNode*, 128>::iterator I = 31225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner std::find(Worklist.begin(), Worklist.end(), N); 31325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(I != Worklist.end() && "Not in worklist"); 31425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 31525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner *I = Worklist.back(); 31625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.pop_back(); 31725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 31825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 31954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeDeleted(SDNode *N, SDNode *E) { 32025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner RemoveFromWorklist(N); 32154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 32254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 32354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeUpdated(SDNode *N) { 32454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng // Ignore updates. 32554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 32654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng}; 32754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng} 32854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 329046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng/// TrivialTruncElim - Eliminate some trivial nops that can result from 330046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng/// ShrinkDemandedOps: (trunc (ext n)) -> n. 331046632f272b22a653c204c0ef56eb4076368d4bbEvan Chengstatic bool TrivialTruncElim(SDValue Op, 332046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng TargetLowering::TargetLoweringOpt &TLO) { 333046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng SDValue N0 = Op.getOperand(0); 334046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng EVT VT = Op.getValueType(); 335046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng if ((N0.getOpcode() == ISD::ZERO_EXTEND || 336046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOpcode() == ISD::SIGN_EXTEND || 337046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOpcode() == ISD::ANY_EXTEND) && 338046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOperand(0).getValueType() == VT) { 339046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng return TLO.CombineTo(Op, N0.getOperand(0)); 340046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng } 341046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng return false; 342046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng} 343046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng 34454eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// ShrinkDemandedOps - A late transformation pass that shrink expressions 34554eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// using TargetLowering::TargetLoweringOpt::ShrinkDemandedOp. It converts 34654eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// x+y to (VT)((SmallVT)x+(SmallVT)y) if the casts are free. 347d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Chengvoid SelectionDAGISel::ShrinkDemandedOps() { 348d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng SmallVector<SDNode*, 128> Worklist; 34925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> InWorklist; 350d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 351d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Add all the dag nodes to the worklist. 352d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.reserve(CurDAG->allnodes_size()); 353d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(), 35425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner E = CurDAG->allnodes_end(); I != E; ++I) { 355d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.push_back(I); 35625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(I); 35725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 358d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 359d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng TargetLowering::TargetLoweringOpt TLO(*CurDAG, true); 360d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng while (!Worklist.empty()) { 3617b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 36225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.erase(N); 363d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 364d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (N->use_empty() && N != CurDAG->getRoot().getNode()) { 365c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner // Deleting this node may make its operands dead, add them to the worklist 366c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner // if they aren't already there. 367c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 368c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner if (InWorklist.insert(N->getOperand(i).getNode())) 369c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner Worklist.push_back(N->getOperand(i).getNode()); 370c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner 37154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng CurDAG->DeleteNode(N); 372d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng continue; 373d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 374d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 375d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Run ShrinkDemandedOp on scalar binary operations. 37625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (N->getNumValues() != 1 || 37725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner !N->getValueType(0).isSimple() || !N->getValueType(0).isInteger()) 37825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner continue; 37925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 38025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner unsigned BitWidth = N->getValueType(0).getScalarType().getSizeInBits(); 38125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner APInt Demanded = APInt::getAllOnesValue(BitWidth); 38225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner APInt KnownZero, KnownOne; 38325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!TLI.SimplifyDemandedBits(SDValue(N, 0), Demanded, 38425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner KnownZero, KnownOne, TLO) && 38525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner (N->getOpcode() != ISD::TRUNCATE || 38625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner !TrivialTruncElim(SDValue(N, 0), TLO))) 38725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner continue; 38825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 38925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Revisit the node. 39025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(!InWorklist.count(N) && "Already in worklist"); 39125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(N); 39225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(N); 39325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 39425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Replace the old value with the new one. 39525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DEBUG(errs() << "\nShrinkDemandedOps replacing "; 39625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner TLO.Old.getNode()->dump(CurDAG); 39725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner errs() << "\nWith: "; 39825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner TLO.New.getNode()->dump(CurDAG); 39925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner errs() << '\n'); 40025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 40125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (InWorklist.insert(TLO.New.getNode())) 40225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(TLO.New.getNode()); 40325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 40425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover DeadNodes(Worklist, InWorklist); 40525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner CurDAG->ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, &DeadNodes); 40625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 40725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!TLO.Old.getNode()->use_empty()) continue; 40825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 40925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner for (unsigned i = 0, e = TLO.Old.getNode()->getNumOperands(); 41025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner i != e; ++i) { 41125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDNode *OpNode = TLO.Old.getNode()->getOperand(i).getNode(); 41225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (OpNode->hasOneUse()) { 41325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Add OpNode to the end of the list to revisit. 41425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DeadNodes.RemoveFromWorklist(OpNode); 41525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(OpNode); 41625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(OpNode); 417d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 418d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 41925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 42025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DeadNodes.RemoveFromWorklist(TLO.Old.getNode()); 42125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner CurDAG->DeleteNode(TLO.Old.getNode()); 422d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 423d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng} 424d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 425f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 426ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 427ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 428a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 429ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 430a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 431ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 432ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 433ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 434a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4357b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer do { 4367b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 437a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 438ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 439ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 440ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 441a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 442ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 443ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 444825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 445ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 446a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 447ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 448ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 449ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 450a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 451ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 452ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 453ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 454a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 455ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 456475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 457e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 458ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 459ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 460a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 461f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 462ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 463f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 464a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 465ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 466ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 467ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 468f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (DestReg >= FuncInfo->LiveOutRegInfo.size()) 469f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo.resize(DestReg+1); 470f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FunctionLoweringInfo::LiveOutInfo &LOI = 471f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo[DestReg]; 472ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 473a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownOne = KnownOne; 474a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownZero = KnownZero; 475ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 4767b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer } while (!Worklist.empty()); 477ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 478ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 479f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 480462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 481462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 482462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 483462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 484462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 48525cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 48625cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 487f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman BlockName = MF->getFunction()->getNameStr() + ":" + 488f6ccee5a9d2b9573f679bca6266ade3eb8cd3f88Daniel Dunbar BB->getBasicBlock()->getNameStr(); 489462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 4901a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Initial selection DAG:\n"); 491f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 492462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 493f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 494417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 495af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 496ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 4975e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 498be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 499ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 500be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 501ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 502a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5031a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized lowered selection DAG:\n"); 504f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 505a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 5071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 508714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 509714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman BlockName); 510714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 511714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman bool Changed; 512714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 513714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 514714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 515714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 516714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 517714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 518714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 5191a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Type-legalized selection DAG:\n"); 520714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 521462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 522714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 523714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 524714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 525714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 526714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 527462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 528714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize types", GroupName); 529714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 530462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 531714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 532462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 533462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5341a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n"); 535f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 536714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 537462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 538714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 539714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Vector Legalization", GroupName); 540714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 541714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 542714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 543714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 5445c22c8074404797f1313b1334757254fb5c6487aEli Friedman 545714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 5465c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (TimePassesIsEnabled) { 547714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization 2", GroupName); 5489882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 5495c22c8074404797f1313b1334757254fb5c6487aEli Friedman } else { 5509882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 5515c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 5525c22c8074404797f1313b1334757254fb5c6487aEli Friedman 553714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 554714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 5555c22c8074404797f1313b1334757254fb5c6487aEli Friedman 556714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 557714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 558714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName); 559714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 560714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 561714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 5625c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 563714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 5641a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n"); 565714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 56670587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 567a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 568f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 569462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 570ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5715e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 572714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 573ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 574714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 575ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 576a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5771a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Legalized selection DAG:\n"); 578f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 579a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 580f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 581462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 582af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 583ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5845e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 585be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 586ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 587be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 588ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 589a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5901a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized legalized selection DAG:\n"); 591f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 592417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 593d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (OptLevel != CodeGenOpt::None) { 594d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng ShrinkDemandedOps(); 595f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 596d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 597552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 598552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 599552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner 600a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 601a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 602ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 6035e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 6047c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 605ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 6067c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 607ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 608db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 6091a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Selected selection DAG:\n"); 610f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 611462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 612f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 613462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 6145e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 61547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 6165e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 6175e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 61847ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 6195e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 62047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 6215e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6225e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 623462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 624462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 625a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 626db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 627ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 6285e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 6292048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = Scheduler->EmitSchedule(&SDB->EdgeMapping); 630ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 6312048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = Scheduler->EmitSchedule(&SDB->EdgeMapping); 6325e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6335e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 6345e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 6355e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 6365e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 6375e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 6385e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 6395e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 640ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 641db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 6421a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Selected machine code:\n"); 6431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 644a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 645f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 6467c306da505e2d7f64e160890b274a47fa0740962Chris Lattnervoid SelectionDAGISel::DoInstructionSelection() { 6477c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection begins:\n"); 6487c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6497c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PreprocessISelDAG(); 6507c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6517c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Select target instructions for the DAG. 6527c306da505e2d7f64e160890b274a47fa0740962Chris Lattner { 6537c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Number all nodes with a topological order and set DAGSize. 6547c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DAGSize = CurDAG->AssignTopologicalOrder(); 6557c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6567c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Create a dummy node (which is not added to allnodes), that adds 6577c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // a reference to the root node, preventing it from being deleted, 6587c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // and tracking any changes of the root. 6597c306da505e2d7f64e160890b274a47fa0740962Chris Lattner HandleSDNode Dummy(CurDAG->getRoot()); 6607c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode()); 6617c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ++ISelPosition; 6627c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6637c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // The AllNodes list is now topological-sorted. Visit the 6647c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // nodes by starting at the end of the list (the root of the 6657c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // graph) and preceding back toward the beginning (the entry 6667c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // node). 6677c306da505e2d7f64e160890b274a47fa0740962Chris Lattner while (ISelPosition != CurDAG->allnodes_begin()) { 6687c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *Node = --ISelPosition; 6697c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes, 6707c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // but there are currently some corner cases that it misses. Also, this 6717c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // makes it theoretically possible to disable the DAGCombiner. 6727c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) 6737c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 6747c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6757c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *ResNode = Select(Node); 6767c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 67782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // FIXME: This is pretty gross. 'Select' should be changed to not return 67882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // anything at all and this code should be nuked with a tactical strike. 67982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 6807c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If node should not be replaced, continue with the next one. 68182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE) 6827c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 6837c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Replace node. 6847c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (ResNode) 6857c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ReplaceUses(Node, ResNode); 6867c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6877c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If after the replacement this node is not used any more, 6887c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // remove this dead node. 6897c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) { // Don't delete EntryToken, etc. 6907c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelUpdater ISU(ISelPosition); 6917c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->RemoveDeadNode(Node, &ISU); 6927c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6937c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6947c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6957c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->setRoot(Dummy.getValue()); 6967c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6977c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection ends:\n"); 6987c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6997c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PostprocessISelDAG(); 7007c306da505e2d7f64e160890b274a47fa0740962Chris Lattner} 7017c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7022520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and 7032520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// do other setup for EH landing-pad blocks. 7042520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohmanvoid SelectionDAGISel::PrepareEHLandingPad(MachineBasicBlock *BB) { 7052520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 7062520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 7072520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman MCSymbol *Label = MF->getMMI().addLandingPad(BB); 7082520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7092520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const TargetInstrDesc &II = 7102520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman TLI.getTargetMachine().getInstrInfo()->get(TargetOpcode::EH_LABEL); 7112520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman BuildMI(BB, SDB->getCurDebugLoc(), II).addSym(Label); 7122520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7132520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception register as live in. 7142520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 7152520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Reg) BB->addLiveIn(Reg); 7162520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7172520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception selector register as live in. 7182520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 7192520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Reg) BB->addLiveIn(Reg); 7202520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7212520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 7222520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 7232520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // like, the basic block containing the invoke), and need to be associated 7242520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // with it in the dwarf exception handling tables. Currently however the 7252520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 7262520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 7272520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // then breaking it can result in the intrinsics being in the successor of 7282520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the landing pad, not the landing pad itself. This results 7292520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // in exceptions not being caught because no typeids are associated with 7302520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the invoke. This may not be the only way things can go wrong, but it 7312520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // is the only way we try to work around for the moment. 7322520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const BasicBlock *LLVMBB = BB->getBasicBlock(); 7332520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 7342520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7352520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 7362520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman BasicBlock::const_iterator I, E; 7372520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 7382520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (isa<EHSelectorInst>(I)) 7392520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman break; 7402520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7412520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (I == E) 7422520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // No catch info found - try to extract some from the successor. 7432520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo); 7442520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman } 7452520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman} 7467c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7476a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn) { 748a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 749a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 750a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISel) 7516a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman FastIS = TLI.createFastISel(*MF, FuncInfo->ValueMap, FuncInfo->MBBMap, 752dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman FuncInfo->StaticAllocaMap 753dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#ifndef NDEBUG 754dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman , FuncInfo->CatchInfoLost 755dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#endif 756dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman ); 757a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 758a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 75939fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 76039fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng BasicBlock *LLVMBB = &*I; 7617c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = FuncInfo->MBBMap[LLVMBB]; 762f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 7633df24e667f04a7003342b534310919abc9c87418Dan Gohman BasicBlock::iterator const Begin = LLVMBB->begin(); 7643df24e667f04a7003342b534310919abc9c87418Dan Gohman BasicBlock::iterator const End = LLVMBB->end(); 7659f1185076d60153fd35feb3cadb1b4cd8debc0b6Evan Cheng BasicBlock::iterator BI = Begin; 7665edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 7675edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Lower any arguments needed in this block if this is the entry block. 76833134c4a75558288d663267c8991f6bd37a530afDan Gohman bool SuppressFastISel = false; 76933134c4a75558288d663267c8991f6bd37a530afDan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 7705edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman LowerArguments(LLVMBB); 771f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 77233134c4a75558288d663267c8991f6bd37a530afDan Gohman // If any of the arguments has the byval attribute, forgo 77333134c4a75558288d663267c8991f6bd37a530afDan Gohman // fast-isel in the entry block. 774a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (FastIS) { 77533134c4a75558288d663267c8991f6bd37a530afDan Gohman unsigned j = 1; 77633134c4a75558288d663267c8991f6bd37a530afDan Gohman for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end(); 77733134c4a75558288d663267c8991f6bd37a530afDan Gohman I != E; ++I, ++j) 7780598866c052147c31b808391f58434ce3dbfb838Devang Patel if (Fn.paramHasAttr(j, Attribute::ByVal)) { 77977ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) 7801a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel skips entry block due to byval argument\n"; 78133134c4a75558288d663267c8991f6bd37a530afDan Gohman SuppressFastISel = true; 78233134c4a75558288d663267c8991f6bd37a530afDan Gohman break; 78333134c4a75558288d663267c8991f6bd37a530afDan Gohman } 78433134c4a75558288d663267c8991f6bd37a530afDan Gohman } 78533134c4a75558288d663267c8991f6bd37a530afDan Gohman } 78633134c4a75558288d663267c8991f6bd37a530afDan Gohman 7872520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Setup an EH landing-pad block. 7882520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (BB->isLandingPad()) 7892520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman PrepareEHLandingPad(BB); 7902520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 791f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 792dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (FastIS && !SuppressFastISel) { 793a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Emit code for any incoming arguments. This must happen before 794a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // beginning FastISel on the entry block. 795a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 7962048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 797a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman CodeGenAndEmitDAG(); 7982048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 799a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 800241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->startNewBlock(BB); 801a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 802a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman for (; BI != End; ++BI) { 803a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Just before the terminator instruction, insert instructions to 804a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // feed PHI nodes in successor blocks. 805a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<TerminatorInst>(BI)) 806a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!HandlePHINodesInSuccessorBlocksFast(LLVMBB, FastIS)) { 807c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 80807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 80977ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 8101a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 81177ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman BI->dump(); 81277ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman } 813a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar assert(!EnableFastISelAbort && 814f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "FastISel didn't handle a PHI in a successor"); 815a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 816a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 81733134c4a75558288d663267c8991f6bd37a530afDan Gohman 8186a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman SetDebugLoc(BI, SDB, FastIS, MF); 819381ca5572e3c37824e1c5be0fa02f7b5bdd4a1ceDan Gohman 82021c14e3649b3e2a70ac36ebb148f17648f10a2a9Dan Gohman // Try to select the instruction with FastISel. 82107f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman if (FastIS->SelectInstruction(BI)) { 82207f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 823a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 82407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman } 825a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 82607f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // Clear out the debug location so that it doesn't carry over to 82707f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // unrelated instructions. 82807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 829f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 830a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 831a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<CallInst>(BI)) { 832c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 833a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 8341a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel missed call: "; 835a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 836f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 837f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 838f012705c7e4ca8cf90b6b734ce1d5355daca5ba5Benjamin Kramer if (!BI->getType()->isVoidTy()) { 839a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman unsigned &R = FuncInfo->ValueMap[BI]; 840a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 841a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman R = FuncInfo->CreateRegForValue(BI); 842f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 843a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 844b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall = false; 8457896c9f436a4eda5ec15e882a7505ba482a2fcd0Chris Lattner SelectBasicBlock(LLVMBB, BI, llvm::next(BI), HadTailCall); 846b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 847b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman // If the call was emitted as a tail call, we're done with the block. 848b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman if (HadTailCall) { 849b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman BI = End; 850b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman break; 851b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman } 852b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 853241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // If the instruction was codegen'd with multiple blocks, 854241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // inform the FastISel object where to resume inserting. 855241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->setCurrentBlock(BB); 856a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 857f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 858a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 859a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Otherwise, give up on FastISel for the rest of the block. 860a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For now, be a little lenient about non-branch terminators. 861a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!isa<TerminatorInst>(BI) || isa<BranchInst>(BI)) { 862c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 863a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 8641a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 865a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 866a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 867a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 868a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 869a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 870c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 871a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 872a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 873f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 874f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 875f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 876d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // Run SelectionDAG instruction selection on the remainder of the block 877d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // not handled by FastISel. If FastISel is not run, this is the entire 8783df24e667f04a7003342b534310919abc9c87418Dan Gohman // block. 879390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel if (BI != End) { 880b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall; 881b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman SelectBasicBlock(LLVMBB, BI, End, HadTailCall); 882390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel } 883381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 8847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FinishBasicBlock(); 88539fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 886a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 887a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 8880e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 8890e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 890fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 8917c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::FinishBasicBlock() { 8921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8931a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Target-post-processed machine code:\n"); 894f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(BB->dump()); 8954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8961a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Total amount of phi nodes to update: " 8972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << SDB->PHINodesToUpdate.size() << "\n"); 8982048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman DEBUG(for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) 8991a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Node " << i << " : (" 9002048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << SDB->PHINodesToUpdate[i].first 9012048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << ", " << SDB->PHINodesToUpdate[i].second << ")\n"); 902a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 903a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 9041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 9052048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (SDB->SwitchCases.empty() && 9062048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.empty() && 9072048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.empty()) { 9082048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) { 9092048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[i].first; 910518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 911f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 912580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen if (!BB->isSuccessor(PHI->getParent())) 913580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen continue; 9142048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[i].second, 9159ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 9169ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 917f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 9182048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->PHINodesToUpdate.clear(); 919f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 9201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 9214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9222048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) { 9234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 9242048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->BitTestCases[i].Emitted) { 9254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 9262048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Parent; 9272048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 9284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 9292048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestHeader(SDB->BitTestCases[i]); 9302048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 931f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 9322048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 933a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 9344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9352048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) { 9364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 9372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Cases[j].ThisBB; 9382048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 9394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 9404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 9412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB, 9422048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 9432048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Cases[j]); 9444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 9452048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Default, 9462048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 9472048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Cases[j]); 948a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 949a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 9502048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 951f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 9522048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 9534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 9562048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned pi = 0, pe = SDB->PHINodesToUpdate.size(); pi != pe; ++pi) { 9572048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[pi].first; 9584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 959518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 9604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 9614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 9624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 9632048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->BitTestCases[i].Default) { 964f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 965f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 9662048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); 967f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 968f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 9692048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases. 9709ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 9714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 9732048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); 9747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 9752048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB; 976dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (cBB->isSuccessor(PHIBB)) { 977f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 978f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 9799ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 9804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9842048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.clear(); 9854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9869453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 9879453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 9889453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 9892048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) { 9903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 9912048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->JTCases[i].first.Emitted) { 9923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 9932048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].first.HeaderBB; 9942048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 9953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 9962048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first); 9972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 998f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 9992048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 10004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 1001a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 100237efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 10032048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].second.MBB; 10042048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 100537efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 10062048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTable(SDB->JTCases[i].second); 10072048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1008f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 10092048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 1010a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 101137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 10122048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned pi = 0, pe = SDB->PHINodesToUpdate.size(); pi != pe; ++pi) { 10132048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[pi].first; 101437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 1015518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 101637efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 10174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 10182048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->JTCases[i].second.Default) { 1019ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 10202048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 1021ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 10222048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB)); 1023f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 10244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 1025dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (BB->isSuccessor(PHIBB)) { 1026ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 10272048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 10289ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 102937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 103037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 103137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 10322048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.clear(); 1033a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1034b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 1035b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 10362048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) { 10372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[i].first; 1038518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 1039b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 1040b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 10412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[i].second, 10429ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 10439ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 1044b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1045b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1046a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1047f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 1048f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 10492048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) { 1050f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 10512048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock *ThisBB = BB = SDB->SwitchCases[i].ThisBB; 10522048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 1053a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1054f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 10552048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitSwitchCase(SDB->SwitchCases[i]); 10562048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1057f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 1058a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1059d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 1060d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 1061d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1062d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 10632048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman while ((BB = SDB->SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 1064fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng // If new BB's are created during scheduling, the edges may have been 1065ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // updated. That is, the edge from ThisBB to BB may have been split and 1066ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // BB's predecessor is now another block. 1067fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*>::iterator EI = 10682048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->EdgeMapping.find(BB); 10692048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (EI != SDB->EdgeMapping.end()) 1070fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng ThisBB = EI->second; 1071dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen 1072dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // BB may have been removed from the CFG if a branch was constant folded. 1073dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (ThisBB->isSuccessor(BB)) { 1074dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (MachineBasicBlock::iterator Phi = BB->begin(); 1075518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner Phi != BB->end() && Phi->isPHI(); 1076dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen ++Phi) { 1077dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // This value for this PHI node is recorded in PHINodesToUpdate. 1078dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (unsigned pn = 0; ; ++pn) { 1079dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen assert(pn != SDB->PHINodesToUpdate.size() && 1080dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen "Didn't find PHI entry!"); 1081dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (SDB->PHINodesToUpdate[pn].first == Phi) { 1082dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand:: 1083dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen CreateReg(SDB->PHINodesToUpdate[pn].second, 1084dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen false)); 1085dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1086dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen break; 1087dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen } 10888be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1089d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1090f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1091a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1092d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 10932048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (BB == SDB->SwitchCases[i].FalseBB) 10942048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].FalseBB = 0; 1095a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1096d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 10972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].TrueBB = SDB->SwitchCases[i].FalseBB; 10982048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].FalseBB = 0; 1099f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 11002048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman assert(SDB->SwitchCases[i].TrueBB == 0 && SDB->SwitchCases[i].FalseBB == 0); 11012048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 1102a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 11032048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases.clear(); 11047c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 11052048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->PHINodesToUpdate.clear(); 11061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1107a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 110813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 11090a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 11100a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 11110a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 11125e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 111347ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1114eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1115a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 111613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1117eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 11189373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 11194ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1120a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1121be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1122a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 11230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1124fc54c552963545a81e4ea38e60460590afb2d5aeDan GohmanScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 1125fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman return new ScheduleHazardRecognizer(); 11269ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 11279ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 1128755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1129755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1130755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1131755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1132755480681c795d585c73556c028b6143c46bda86Chris Lattner 1133755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1134755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1135755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1136755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1137a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1138dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 11392e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 11402e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1141a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1142755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1143755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1144755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1145a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1146755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 11472e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1148755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1149a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1150755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1151755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 11522e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1153ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1154755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1155a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1156755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1157755480681c795d585c73556c028b6143c46bda86Chris Lattner 1158755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1159755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1160755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1161755480681c795d585c73556c028b6143c46bda86Chris Lattner 1162755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1163755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1164755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1165755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1166a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 11672e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 11682e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 11692e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1170a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1171755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1172755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1173755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1174a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1175755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 11762e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1177755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1178a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1179755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1180755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 11812e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1182a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11832e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 1184ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 1185a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1186755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1187755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1188755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1189a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1190755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1191a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1192755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1193755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1194755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1195755480681c795d585c73556c028b6143c46bda86Chris Lattner 11969ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 11970e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 11980e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 11990e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1200f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1201475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 12020e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 12030e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1204decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0 1205decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1 1206decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc 12070e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1208decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size(); 1209825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (InOps[e-1].getValueType() == MVT::Flag) 12100e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 1211a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12120e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1213f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 1214decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (!InlineAsm::isMemKind(Flags)) { 12150e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1216697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1217697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1218697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 12190e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1220697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1221697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 12220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1223475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1224decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) 122575361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error("Could not match memory address. Inline asm" 122687d677c1856bfdcb91d9daeb69dc5f261c73851eChris Lattner " failure!"); 1227a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 1229decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned NewFlags = 1230decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size()); 1231decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32)); 12320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 12330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 12340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 12350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1236a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 12380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 12390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 12400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1241794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1242e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson/// findFlagUse - Return use of EVT::Flag value produced by the specified 1243c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1244c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1245c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic SDNode *findFlagUse(SDNode *N) { 1246c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1247c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1248c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1249c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1250c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1251c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1252c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1253c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1254c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1255c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1256c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1257c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1258c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1259d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, 1260d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) { 1261da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The NodeID's are given uniques ID's where a node ID is guaranteed to be 1262da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // greater than all of its (recursive) operands. If we scan to a point where 1263da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 'use' is smaller than the node we're scanning for, then we know we will 1264da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // never find it. 1265da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 1266da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The Use may be -1 (unassigned) if it is a newly allocated node. This can 1267da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // happen because we scan down to newly selected nodes in the case of flag 1268da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // uses. 1269da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1)) 1270da244a091dcde022ea4938793d81ee957903ed70Chris Lattner return false; 1271da244a091dcde022ea4938793d81ee957903ed70Chris Lattner 1272da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // Don't revisit nodes if we already scanned it and didn't fail, we know we 1273da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // won't fail if we scan it again. 1274da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if (!Visited.insert(Use)) 1275c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1276c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1277c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1278d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Ignore chain uses, they are validated by HandleMergeInputChains. 1279d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains) 1280d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1281d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1282c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1283c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1284c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1285c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1286c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1287c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1288c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1289c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1290c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1291d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains)) 1292c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1293c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1294c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1295c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1296c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1297014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsProfitableToFold - Returns true if it's profitable to fold the specific 1298014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// operand node N of U during instruction selection that starts at Root. 1299014bf215c3457bb34fee348265e8f63a70b4d503Evan Chengbool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U, 1300014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng SDNode *Root) const { 1301014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng if (OptLevel == CodeGenOpt::None) return false; 1302014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng return N.hasOneUse(); 1303014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng} 1304014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng 1305014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsLegalToFold - Returns true if the specific operand node N of 1306014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// U can be folded during instruction selection that starts at Root. 1307d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattnerbool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 1308d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) const { 1309c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1310c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1311c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1312c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1313c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1314c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1315c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1316c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1317c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1318c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1319c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1320c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1321c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1322c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1323c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1324c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1325c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1326c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1327c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root produces a flag, then it gets (even more) interesting. Since it 1328c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // will be "glued" together with its flag use in the scheduler, we need to 1329c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1330c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1331c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1332c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1333c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1334c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1335c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1336c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1337c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1338c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1339c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1340c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1341c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1342c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1343c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1344c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1345c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1346c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [FU] // 1347c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1348c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If FU (flag use) indirectly reaches N (the load), and Root folds N 1349c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // (call it Fold), then X is a predecessor of FU and a successor of 1350c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Fold. But since Fold and FU are flagged together, this will create 1351c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1352c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 13539bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // If the node has flags, walk down the graph to the "lowest" node in the 13549bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // flagged set. 1355e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1356825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (VT == MVT::Flag) { 1357c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *FU = findFlagUse(Root); 1358c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (FU == NULL) 1359c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1360c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov Root = FU; 1361c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 136218fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 136318fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // If our query node has a flag result with a use, we've walked up it. If 136418fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the user (which has already been selected) has a chain or indirectly uses 136518fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the chain, our WalkChainUsers predicate will not consider it. Because of 136618fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // this, we cannot ignore chains in this predicate. 136718fdabadca110671b436de52fe7bd492ad49e656Chris Lattner IgnoreChains = false; 1368c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 136918fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 1370c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 13719bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner SmallPtrSet<SDNode*, 16> Visited; 13729bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains); 1373c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1374c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1375eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) { 1376eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman std::vector<SDValue> Ops(N->op_begin(), N->op_end()); 1377e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SelectInlineAsmMemoryOperands(Ops); 1378e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1379e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::vector<EVT> VTs; 1380e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Other); 1381e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Flag); 1382eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(), 1383e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs, &Ops[0], Ops.size()); 1384d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner New->setNodeId(-1); 1385e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman return New.getNode(); 1386e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1387e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1388eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) { 1389518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0)); 1390e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1391e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 13922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// GetVBR - decode a vbr encoding whose top bit is set. 13932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerALWAYS_INLINE static uint64_t 13942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerGetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) { 13952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(Val >= 128 && "Not a VBR"); 13962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val &= 127; // Remove first vbr bit. 13972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned Shift = 7; 13992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner uint64_t NextBits; 14002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner do { 140114df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner NextBits = MatcherTable[Idx++]; 14022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val |= (NextBits&127) << Shift; 14032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Shift += 7; 14042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } while (NextBits & 128); 14052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 14062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return Val; 14072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 14082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 14092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 14102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// UpdateChainsAndFlags - When a match is complete, this method updates uses of 14112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// interior flag and chain results to use the new flag and chain results. 141282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattnervoid SelectionDAGISel:: 141382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris LattnerUpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain, 141482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &ChainNodesMatched, 141582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SDValue InputFlag, 141682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &FlagResultNodesMatched, 141782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner bool isMorphNodeTo) { 141882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SmallVector<SDNode*, 4> NowDeadNodes; 141982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 142082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner ISelUpdater ISU(ISelPosition); 142182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Now that all the normal results are replaced, we replace the chain and 14232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // flag results if present. 14242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!ChainNodesMatched.empty()) { 14252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() != 0 && 14262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Matched input chains but didn't produce a chain"); 14272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Loop over all of the nodes we matched that produced a chain result. 14282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Replace all the chain results with the final chain we ended up with. 14292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 14302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *ChainNode = ChainNodesMatched[i]; 14312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 143282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 143382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ChainNode->getOpcode() == ISD::DELETED_NODE) 143482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 143582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Don't replace the results of the root node if we're doing a 14372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MorphNodeTo. 14382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNode == NodeToMatch && isMorphNodeTo) 14392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 14402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 14412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); 14422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainVal.getValueType() == MVT::Flag) 14432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); 14442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainVal.getValueType() == MVT::Other && "Not a chain?"); 144582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU); 144682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 1447856fb395e46a8d485081acbf11928047d852c636Chris Lattner // If the node became dead and we haven't already seen it, delete it. 1448856fb395e46a8d485081acbf11928047d852c636Chris Lattner if (ChainNode->use_empty() && 1449856fb395e46a8d485081acbf11928047d852c636Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode)) 145082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(ChainNode); 14512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 14542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the result produces a flag, update any flag results in the matched 14552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern with the flag result. 14562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputFlag.getNode() != 0) { 14572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Handle any interior nodes explicitly marked. 14582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = FlagResultNodesMatched.size(); i != e; ++i) { 14592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *FRN = FlagResultNodesMatched[i]; 146082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 146182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 146282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (FRN->getOpcode() == ISD::DELETED_NODE) 146382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 146482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Flag && 14662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Doesn't have a flag result"); 14672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), 146882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, &ISU); 146982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 147019e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner // If the node became dead and we haven't already seen it, delete it. 147119e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner if (FRN->use_empty() && 147219e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN)) 147382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(FRN); 14742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 147782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (!NowDeadNodes.empty()) 147882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU); 147982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Match complete!\n"); 14812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 14822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1483c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerenum ChainResult { 1484c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_Simple, 1485c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_InducesCycle, 1486c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_LeadsToInteriorNode 1487c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner}; 1488c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1489c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// WalkChainUsers - Walk down the users of the specified chained node that is 1490c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// part of the pattern we're matching, looking at all of the users we find. 1491c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// This determines whether something is an interior node, whether we have a 1492c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// non-pattern node in between two pattern nodes (which prevent folding because 1493c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// it would induce a cycle) and whether we have a TokenFactor node sandwiched 1494c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// between pattern nodes (in which case the TF becomes part of the pattern). 1495c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// 1496c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// The walk we do here is guaranteed to be small because we quickly get down to 1497c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// already selected nodes "below" us. 1498c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerstatic ChainResult 1499c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerWalkChainUsers(SDNode *ChainedNode, 1500c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &ChainedNodesInPattern, 1501c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &InteriorChainedNodes) { 1502c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainResult Result = CR_Simple; 1503c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1504c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (SDNode::use_iterator UI = ChainedNode->use_begin(), 1505c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner E = ChainedNode->use_end(); UI != E; ++UI) { 1506c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Make sure the use is of the chain, not some other value we produce. 1507c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (UI.getUse().getValueType() != MVT::Other) continue; 1508c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1509c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *User = *UI; 1510c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1511c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we see an already-selected machine node, then we've gone beyond the 1512c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that we're selecting down into the already selected chunk of the 1513c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // DAG. 1514c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->isMachineOpcode() || 1515c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner User->getOpcode() == ISD::HANDLENODE) // Root of the graph. 1516c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1517d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1518d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getOpcode() == ISD::CopyToReg || 1519d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner User->getOpcode() == ISD::CopyFromReg || 15207561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::INLINEASM || 15217561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::EH_LABEL) { 1522d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // If their node ID got reset to -1 then they've already been selected. 1523d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Treat them like a MachineOpcode. 1524d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getNodeId() == -1) 1525d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1526d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner } 1527c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1528c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a TokenFactor, we handle it specially. 1529c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->getOpcode() != ISD::TokenFactor) { 1530c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the node isn't a token factor and isn't part of our pattern, then it 1531c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // must be a random chained node in between two nodes we're selecting. 1532c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This happens when we have something like: 1533c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1534c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // call 1535c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1536c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1537c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Because we structurally match the load/store as a read/modify/write, 1538c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // but the call is chained between them. We cannot fold in this case 1539c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // because it would induce a cycle in the graph. 1540c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainedNodesInPattern.begin(), 1541c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.end(), User)) 1542c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1543c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1544c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise we found a node that is part of our pattern. For example in: 1545c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1546c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1547c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1548c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This would happen when we're scanning down from the load and see the 1549c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store as a user. Record that there is a use of ChainedNode that is 1550c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // part of the pattern and keep scanning uses. 1551c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1552c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1553c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1554c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1555c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1556c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we found a TokenFactor, there are two cases to consider: first if the 1557c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // TokenFactor is just hanging "below" the pattern we're matching (i.e. no 1558c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses of the TF are in our pattern) we just want to ignore it. Second, 1559c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the TokenFactor can be sandwiched in between two chained nodes, like so: 1560c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load chain] 1561c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ 1562c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | 1563c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load] 1564c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1565c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | \ DAG's like cheese 1566c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / \ do you? 1567c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / | 1568c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [TokenFactor] [Op] 1569c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1570c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | | 1571c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1572c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1573c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Store] 1574c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1575c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // In this case, the TokenFactor becomes part of our match and we rewrite it 1576c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // as a new TokenFactor. 1577c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1578c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // To distinguish these two cases, do a recursive walk down the uses. 1579c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) { 1580c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_Simple: 1581c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor are just already-selected nodes, ignore 1582c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // it, it is "below" our pattern. 1583c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1584c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_InducesCycle: 1585c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor lead to nodes that are not part of our 1586c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that are not selected, folding would turn this into a cycle, 1587c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // bail out now. 1588c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1589c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_LeadsToInteriorNode: 1590c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner break; // Otherwise, keep processing. 1591c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1592c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1593c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we know we're in the interesting interior case. The TokenFactor 1594c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // is now going to be considered part of the pattern so that we rewrite its 1595c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses (it may have uses that are not part of the pattern) with the 1596c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ultimate chain result of the generated code. We will also add its chain 1597c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // inputs as inputs to the ultimate TokenFactor we create. 1598c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1599c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.push_back(User); 1600c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1601c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1602c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1603c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1604c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return Result; 1605c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner} 1606c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 16076b30792d2d7d142b8192241e6232aee004f745fbChris Lattner/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains 160800592ec857b4c3f31b46412e2738924238c59983Chris Lattner/// operation for when the pattern matched at least one node with a chains. The 1609c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// input vector contains a list of all of the chained nodes that we match. We 1610c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// must determine if this is a valid thing to cover (i.e. matching it won't 1611c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will 1612c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// be used as the input node chain for the generated nodes. 16136b30792d2d7d142b8192241e6232aee004f745fbChris Lattnerstatic SDValue 1614c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerHandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched, 16156b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SelectionDAG *CurDAG) { 1616c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Walk all of the chained nodes we've matched, recursively scanning down the 1617c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // users of the chain result. This adds any TokenFactor nodes that are caught 1618c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // in between chained nodes to the chained and interior nodes list. 1619c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVector<SDNode*, 3> InteriorChainedNodes; 1620c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1621c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched, 1622c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes) == CR_InducesCycle) 1623c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return SDValue(); // Would induce a cycle. 1624c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 16256b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 1626c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we have walked all the matched nodes and collected TokenFactor nodes 1627c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that we are interested in. Form our input TokenFactor node. 16286b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SmallVector<SDValue, 3> InputChains; 16296b30792d2d7d142b8192241e6232aee004f745fbChris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1630c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Add the input chain of this node to the InputChains list (which will be 1631c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the operands of the generated TokenFactor) if it's not an interior node. 1632c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *N = ChainNodesMatched[i]; 1633c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (N->getOpcode() != ISD::TokenFactor) { 1634c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N)) 1635c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1636c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1637c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise, add the input chain. 1638c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDValue InChain = ChainNodesMatched[i]->getOperand(0); 1639c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner assert(InChain.getValueType() == MVT::Other && "Not a chain"); 16406b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChains.push_back(InChain); 1641c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1642c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1643c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1644c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a token factor, we want to add all inputs of the token factor 1645c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that are not part of the pattern we're matching. 1646c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) { 1647c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(), 16486183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner N->getOperand(op).getNode())) 16496183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner InputChains.push_back(N->getOperand(op)); 1650c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 16516b30792d2d7d142b8192241e6232aee004f745fbChris Lattner } 16526b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 16536b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SDValue Res; 16546b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChains.size() == 1) 16556b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return InputChains[0]; 16566b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(), 16576b30792d2d7d142b8192241e6232aee004f745fbChris Lattner MVT::Other, &InputChains[0], InputChains.size()); 16586b30792d2d7d142b8192241e6232aee004f745fbChris Lattner} 16592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 16603ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner/// MorphNode - Handle morphing a node in place for the selector. 16613ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerSDNode *SelectionDAGISel:: 16623ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerMorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList, 16633ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) { 16643ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // It is possible we're using MorphNodeTo to replace a node with no 16653ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // normal results with one that has a normal result (or we could be 16663ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // adding a chain) and the input could have flags and chains as well. 1667caa8870fe09f5526e611434b6bb9f7040c7dfa60Chris Lattner // In this case we need to shift the operands down. 16683ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // FIXME: This is a horrible hack and broken in obscure cases, no worse 1669a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner // than the old isel though. 16703ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner int OldFlagResultNo = -1, OldChainResultNo = -1; 16713ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16723ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned NTMNumResults = Node->getNumValues(); 16733ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Node->getValueType(NTMNumResults-1) == MVT::Flag) { 16743ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldFlagResultNo = NTMNumResults-1; 16753ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (NTMNumResults != 1 && 16763ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Node->getValueType(NTMNumResults-2) == MVT::Other) 16773ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-2; 16783ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } else if (Node->getValueType(NTMNumResults-1) == MVT::Other) 16793ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-1; 16803ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 168161c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // Call the underlying SelectionDAG routine to do the transmogrification. Note 168261c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // that this deletes operands of the old node that become dead. 16833ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps); 16843ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16853ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // MorphNodeTo can operate in two ways: if an existing node with the 16863ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // specified operands exists, it can just return it. Otherwise, it 16873ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // updates the node in place to have the requested operands. 16883ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res == Node) { 16893ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // If we updated the node in place, reset the node ID. To the isel, 16903ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // this should be just like a newly allocated machine node. 16913ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res->setNodeId(-1); 16923ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } 16933ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16943ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned ResNumResults = Res->getNumValues(); 16953ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the flag if needed. 16963ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) && OldFlagResultNo != -1 && 16973ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldFlagResultNo != ResNumResults-1) 16983ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldFlagResultNo), 16993ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 17003ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 17013ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) != 0) 17023ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner --ResNumResults; 17033ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 17043ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the chain reference if needed. 17053ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 && 17063ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldChainResultNo != ResNumResults-1) 17073ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo), 17083ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 17093ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 17103ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Otherwise, no replacement happened because the node already exists. Replace 17113ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Uses of the old node with the new one. 17123ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res != Node) 17133ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesWith(Node, Res); 17143ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 17153ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner return Res; 17163ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner} 17173ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 1718f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1719f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1720da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1721da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const SmallVectorImpl<SDValue> &RecordedNodes) { 1722da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Accept if it is exactly the same as a previously recorded node. 1723da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 1724da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 1725da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return N == RecordedNodes[RecNo]; 1726da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1727da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1728da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1729da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1730f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1731f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel) { 1732f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]); 1733f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1734f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1735f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckNodePredicate - Implements OP_CheckNodePredicate. 1736f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1737f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1738f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel, SDNode *N) { 1739f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]); 1740f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1741f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1742f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1743f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1744f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDNode *N) { 1745d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 1746d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 1747d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner return N->getOpcode() == Opc; 1748f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1749f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1750f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1751f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1752f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N, const TargetLowering &TLI) { 1753f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1754f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (N.getValueType() == VT) return true; 1755f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1756f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Handle the case when VT is iPTR. 1757f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy(); 1758f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1759f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1760f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1761da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1762da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI, 1763da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned ChildNo) { 1764da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (ChildNo >= N.getNumOperands()) 1765da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return false; // Match fails if out of range child #. 1766da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI); 1767da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1768da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1769da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1770da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1771da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1772da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N) { 1773da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return cast<CondCodeSDNode>(N)->get() == 1774da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner (ISD::CondCode)MatcherTable[MatcherIndex++]; 1775da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1776da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1777da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1778da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1779da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI) { 1780da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1781da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (cast<VTSDNode>(N)->getVT() == VT) 1782da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return true; 1783da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1784da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Handle the case when VT is iPTR. 1785da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy(); 1786da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1787da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1788da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1789f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1790f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N) { 1791f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1792f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (Val & 128) 1793f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1794f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1795f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N); 1796f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return C != 0 && C->getSExtValue() == Val; 1797f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1798f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1799da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1800da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1801da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1802da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1803da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1804da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1805da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1806da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::AND) return false; 1807da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1808da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1809da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val); 1810da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1811da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1812da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1813da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1814da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1815da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1816da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1817da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1818da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1819da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::OR) return false; 1820da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1821da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1822da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val); 1823da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1824da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1825f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// IsPredicateKnownToFail - If we know how and can do so without pushing a 1826f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// scope, evaluate the current node. If the current predicate is known to 1827f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// fail, set Result=true and return anything. If the current predicate is 1828f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// known to pass, set Result=false and return the MatcherIndex to continue 1829f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// with. If the current predicate is unknown, set Result=false and return the 1830f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// MatcherIndex to continue with. 1831f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattnerstatic unsigned IsPredicateKnownToFail(const unsigned char *Table, 1832f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned Index, SDValue N, 1833da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner bool &Result, SelectionDAGISel &SDISel, 1834da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SmallVectorImpl<SDValue> &RecordedNodes){ 1835f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner switch (Table[Index++]) { 1836f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner default: 1837f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = false; 1838f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index-1; // Could not evaluate this predicate. 1839da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckSame: 1840da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckSame(Table, Index, N, RecordedNodes); 1841da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1842f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPatternPredicate: 1843da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckPatternPredicate(Table, Index, SDISel); 1844f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1845f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPredicate: 1846da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode()); 1847f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1848f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckOpcode: 1849f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckOpcode(Table, Index, N.getNode()); 1850f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1851f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckType: 1852f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckType(Table, Index, N, SDISel.TLI); 1853f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1854f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild0Type: 1855f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild1Type: 1856f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild2Type: 1857f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild3Type: 1858f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild4Type: 1859f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild5Type: 1860f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild6Type: 1861da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckChild7Type: 1862da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckChildType(Table, Index, N, SDISel.TLI, 1863da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type); 1864da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1865da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckCondCode: 1866da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckCondCode(Table, Index, N); 1867da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1868da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckValueType: 1869da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckValueType(Table, Index, N, SDISel.TLI); 1870f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1871f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckInteger: 1872f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckInteger(Table, Index, N); 1873f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1874da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckAndImm: 1875da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckAndImm(Table, Index, N, SDISel); 1876da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1877da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckOrImm: 1878da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckOrImm(Table, Index, N, SDISel); 1879da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1880f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 1881f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1882f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 18833ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattnerstruct MatchScope { 18852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// FailIndex - If this match fails, this is the index to continue with. 18862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FailIndex; 18872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NodeStack - The node stack when the scope was formed. 18892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 4> NodeStack; 18902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumRecordedNodes - The number of recorded nodes when the scope was formed. 18922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumRecordedNodes; 18932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumMatchedMemRefs - The number of matched memref entries. 18952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumMatchedMemRefs; 18962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// InputChain/InputFlag - The current chain/flag 18982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 18992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty. 19012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasChainNodesMatched, HasFlagResultNodesMatched; 19022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner}; 19032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSDNode *SelectionDAGISel:: 19052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable, 19062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned TableSize) { 19072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: Should these even be selected? Handle these cases in the caller? 19082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (NodeToMatch->getOpcode()) { 19092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner default: 19102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 19112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::EntryToken: // These nodes remain the same. 19122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::BasicBlock: 19132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::Register: 19143b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::VALUETYPE: 19153b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::CONDCODE: 19162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::HANDLENODE: 1917decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner case ISD::MDNODE_SDNODE: 19182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstant: 19192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantFP: 19202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantPool: 19212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetFrameIndex: 19222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetExternalSymbol: 19232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetBlockAddress: 19242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetJumpTable: 19252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalTLSAddress: 19262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalAddress: 19272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TokenFactor: 19282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyFromReg: 19292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyToReg: 19307561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner case ISD::EH_LABEL: 1931d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch->setNodeId(-1); // Mark selected. 19322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 19332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertSext: 19342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertZext: 19352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0), 19362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getOperand(0)); 19372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 19382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch); 19392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::UNDEF: return Select_UNDEF(NodeToMatch); 19402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 19412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeToMatch->isMachineOpcode() && "Node already selected!"); 19432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Set up the node stack with NodeToMatch as the only node on the stack. 19452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> NodeStack; 19462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue N = SDValue(NodeToMatch, 0); 19472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 19482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchScopes - Scopes used when matching, if a match failure happens, this 19502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // indicates where to continue checking. 19512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MatchScope, 8> MatchScopes; 19522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // RecordedNodes - This is the set of nodes that have been recorded by the 19542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // state machine. 19552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> RecordedNodes; 19562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchedMemRefs - This is the set of MemRef's we've seen in the input 19582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern. 19592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MachineMemOperand*, 2> MatchedMemRefs; 19602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // These are the current input chain and flag for use when generating nodes. 19622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Various Emit operations change these. For example, emitting a copytoreg 19632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // uses and updates these. 19642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 19652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // ChainNodesMatched - If a pattern matches nodes that have input/output 19672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains, the OPC_EmitMergeInputChains operation is emitted which indicates 19682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // which ones they are. The result is captured into this list so that we can 19692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // update the chain results when the pattern is complete. 19702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> ChainNodesMatched; 19712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> FlagResultNodesMatched; 19722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Starting pattern match on root node: "; 19742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->dump(CurDAG); 19752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner errs() << '\n'); 19762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19777390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Determine where to start the interpreter. Normally we start at opcode #0, 19787390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // but if the state machine starts with an OPC_SwitchOpcode, then we 19797390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // accelerate the first lookup (which is guaranteed to be hot) with the 19807390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // OpcodeOffset table. 19812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned MatcherIndex = 0; 19827390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19837390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (!OpcodeOffset.empty()) { 19847390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Already computed the OpcodeOffset table, just index into it. 19857390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 19867390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 19877390eebd49b786f3293d24f76fedb02fe183468cChris Lattner DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n"); 19887390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19897390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } else if (MatcherTable[0] == OPC_SwitchOpcode) { 19907390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Otherwise, the table isn't computed, but the state machine does start 19917390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // with an OPC_SwitchOpcode instruction. Populate the table now, since this 19927390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // is the first time we're selecting an instruction. 19937390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned Idx = 1; 19947390eebd49b786f3293d24f76fedb02fe183468cChris Lattner while (1) { 19957390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the size of this case. 19967390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned CaseSize = MatcherTable[Idx++]; 19977390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize & 128) 19987390eebd49b786f3293d24f76fedb02fe183468cChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, Idx); 19997390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize == 0) break; 20007390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 20017390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the opcode, add the index to the table. 2002d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[Idx++]; 2003d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[Idx++] << 8; 20047390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (Opc >= OpcodeOffset.size()) 20057390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset.resize((Opc+1)*2); 20067390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset[Opc] = Idx; 20077390eebd49b786f3293d24f76fedb02fe183468cChris Lattner Idx += CaseSize; 20087390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 20097390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 20107390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Okay, do the lookup for the first opcode. 20117390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 20127390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 20137390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 20147390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 20152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 20162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(MatcherIndex < TableSize && "Invalid index"); 201719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#ifndef NDEBUG 201819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman unsigned CurrentOpcodeIndex = MatcherIndex; 201919b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#endif 20202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++]; 20212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (Opcode) { 20222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_Scope: { 2023f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Okay, the semantics of this operation are that we should push a scope 2024f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // then evaluate the first child. However, pushing a scope only to have 2025f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // the first check fail (which then pops it) is inefficient. If we can 2026f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // determine immediately that the first check (or first several) will 2027f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // immediately fail, don't even bother pushing a scope for them. 2028f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned FailIndex; 2029f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2030f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner while (1) { 2031f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 2032f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip & 128) 2033f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 2034f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Found the end of the scope with no match. 2035f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip == 0) { 2036f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = 0; 2037f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 2038f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2039f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2040f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = MatcherIndex+NumToSkip; 2041f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2042a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner unsigned MatcherIndexOfPredicate = MatcherIndex; 2043a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner (void)MatcherIndexOfPredicate; // silence warning. 2044a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner 2045f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If we can't evaluate this predicate without pushing a scope (e.g. if 2046f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // it is a 'MoveParent') or if the predicate succeeds on this node, we 2047f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // push the scope and evaluate the full predicate chain. 2048f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner bool Result; 2049f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N, 2050da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result, *this, RecordedNodes); 2051f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!Result) 2052f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 2053f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2054a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner DEBUG(errs() << " Skipped scope entry (due to false predicate) at " 2055a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << "index " << MatcherIndexOfPredicate 2056a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << ", continuing at " << FailIndex << "\n"); 2057bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 2058f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2059f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Otherwise, we know that this case of the Scope is guaranteed to fail, 2060f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // move to the next case. 2061f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = FailIndex; 2062f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2063f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2064f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If the whole scope failed to match, bail. 2065f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (FailIndex == 0) break; 2066f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 20672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Push a MatchScope which indicates where to go if the first child fails 20682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // to match. 20692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope NewEntry; 2070f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NewEntry.FailIndex = FailIndex; 20712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); 20722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumRecordedNodes = RecordedNodes.size(); 20732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumMatchedMemRefs = MatchedMemRefs.size(); 20742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputChain = InputChain; 20752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputFlag = InputFlag; 20762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty(); 20772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasFlagResultNodesMatched = !FlagResultNodesMatched.empty(); 20782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.push_back(NewEntry); 20792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordNode: 20822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Remember this node, it may end up being an operand in the pattern. 20832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N); 20842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild0: case OPC_RecordChild1: 20872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild2: case OPC_RecordChild3: 20882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild4: case OPC_RecordChild5: 20892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild6: case OPC_RecordChild7: { 20902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = Opcode-OPC_RecordChild0; 20912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 20922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 20932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N->getOperand(ChildNo)); 20952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordMemRef: 20982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand()); 20992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CaptureFlagInput: 21022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the current node has an input flag, capture it in InputFlag. 21032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (N->getNumOperands() != 0 && 21042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag) 21052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = N->getOperand(N->getNumOperands()-1); 21062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveChild: { 21092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = MatcherTable[MatcherIndex++]; 21102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 21112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 21122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = N.getOperand(ChildNo); 21132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 21142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 21162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveParent: 21182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Pop the current node off the NodeStack. 21192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.pop_back(); 21202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeStack.empty() && "Node stack imbalance!"); 21212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 21222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2124da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckSame: 2125da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break; 21262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPatternPredicate: 2128f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break; 21292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPredicate: 2131f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this, 2132f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner N.getNode())) 2133f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 21342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 213557bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner case OPC_CheckComplexPat: { 213657bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned CPNum = MatcherTable[MatcherIndex++]; 213757bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 213857bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat"); 213957bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo], CPNum, 214057bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner RecordedNodes)) 21412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 21422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 214357bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner } 21442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckOpcode: 2145f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break; 2146f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner continue; 2147f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2148f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckType: 2149f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break; 21502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2152eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner case OPC_SwitchOpcode: { 2153eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CurNodeOpcode = N.getOpcode(); 21547d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2155eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CaseSize; 2156eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner while (1) { 2157eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Get the size of this case. 2158eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2159eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize & 128) 2160eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2161eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2162eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2163d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2164d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2165d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner 2166eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // If the opcode matches, then we will execute this case. 2167d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner if (CurNodeOpcode == Opc) 2168eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner break; 2169eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2170eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, skip over this case. 2171eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner MatcherIndex += CaseSize; 2172eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2173eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2174cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2175eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2176eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2177eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, execute the case we found. 2178eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner DEBUG(errs() << " OpcodeSwitch from " << SwitchStart 2179eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner << " to " << MatcherIndex << "\n"); 2180eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner continue; 2181eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2182eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2183cfe2eab7446dedc471592fe702fefef783383171Chris Lattner case OPC_SwitchType: { 2184cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CurNodeVT = N.getValueType().getSimpleVT().SimpleTy; 2185cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2186cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned CaseSize; 2187cfe2eab7446dedc471592fe702fefef783383171Chris Lattner while (1) { 2188cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Get the size of this case. 2189cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2190cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize & 128) 2191cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2192cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2193cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2194cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CaseVT = 2195cfe2eab7446dedc471592fe702fefef783383171Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2196cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseVT == MVT::iPTR) 2197cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseVT = TLI.getPointerTy().SimpleTy; 2198cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2199cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If the VT matches, then we will execute this case. 2200cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CurNodeVT == CaseVT) 2201cfe2eab7446dedc471592fe702fefef783383171Chris Lattner break; 2202cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2203cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, skip over this case. 2204cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MatcherIndex += CaseSize; 2205cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 2206cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2207cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2208cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2209cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2210cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, execute the case we found. 2211cfe2eab7446dedc471592fe702fefef783383171Chris Lattner DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString() 2212cfe2eab7446dedc471592fe702fefef783383171Chris Lattner << "] from " << SwitchStart << " to " << MatcherIndex<<'\n'); 2213cfe2eab7446dedc471592fe702fefef783383171Chris Lattner continue; 2214cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 22152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild0Type: case OPC_CheckChild1Type: 22162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild2Type: case OPC_CheckChild3Type: 22172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild4Type: case OPC_CheckChild5Type: 2218da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckChild6Type: case OPC_CheckChild7Type: 2219da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI, 2220da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Opcode-OPC_CheckChild0Type)) 2221f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 22222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckCondCode: 2224da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break; 22252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2226da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckValueType: 2227da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break; 22282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2229f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckInteger: 2230f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break; 22312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2232da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckAndImm: 2233da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break; 22342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2235da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckOrImm: 2236da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break; 22372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckFoldableChainNode: { 22402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeStack.size() != 1 && "No parent node"); 22412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Verify that all intermediate nodes between the root and this one have 22422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // a single use. 22432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasMultipleUses = false; 22442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) 22452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!NodeStack[i].hasOneUse()) { 22462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner HasMultipleUses = true; 22472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 22482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (HasMultipleUses) break; 22502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see that the target thinks this is profitable to fold and that 22522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we can fold it without inducing cycles in the graph. 22532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(), 22542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch) || 22552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(), 2256d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch, true/*We validate our own chains*/)) 22572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 22582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitInteger: { 22622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 22632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 22642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 22652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Val & 128) 22662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 22672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT)); 22682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitRegister: { 22712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 22722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 22732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RegNo = MatcherTable[MatcherIndex++]; 22742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT)); 22752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitConvertToTarget: { 22792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Convert from IMM/FPIMM to target version. 22802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 22812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 22822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Imm = RecordedNodes[RecNo]; 22832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Imm->getOpcode() == ISD::Constant) { 22852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue(); 22862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstant(Val, Imm.getValueType()); 22872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (Imm->getOpcode() == ISD::ConstantFP) { 22882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue(); 22892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType()); 22902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(Imm); 22932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2296aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0 2297aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1 2298aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // These are space-optimized forms of OPC_EmitMergeInputChains. 2299aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(InputChain.getNode() == 0 && 2300aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 2301aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(ChainNodesMatched.empty() && 2302aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "Should only have one EmitMergeInputChains per match"); 2303aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2304aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Read all of the chained nodes. 2305aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1; 2306aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2307aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 2308aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2309aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // FIXME: What if other value results of the node have uses not matched 2310aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // by this pattern? 2311aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2312aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 2313aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.clear(); 2314aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; 2315aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2316aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2317aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Merge the input chains if they are not intra-pattern references. 2318aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 2319aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2320aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (InputChain.getNode() == 0) 2321aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; // Failed to merge. 2322aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner continue; 2323aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2324aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 23252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitMergeInputChains: { 23262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() == 0 && 23272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 23282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // This node gets a list of nodes we matched in the input that have 23292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains. We want to token factor all of the input chains to these nodes 23302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // together. However, if any of the input chains is actually one of the 23312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // nodes matched in this pattern, then we have an intra-match reference. 23322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Ignore these because the newly token factored chain should not refer to 23332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // the old nodes. 23342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumChains = MatcherTable[MatcherIndex++]; 23352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NumChains != 0 && "Can't TF zero chains"); 23362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainNodesMatched.empty() && 23382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Should only have one EmitMergeInputChains per match"); 23392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read all of the chained nodes. 234100592ec857b4c3f31b46412e2738924238c59983Chris Lattner for (unsigned i = 0; i != NumChains; ++i) { 234200592ec857b4c3f31b46412e2738924238c59983Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 23452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: What if other value results of the node have uses not matched 23472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // by this pattern? 23482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 23492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 23502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 23512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 23522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23546b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 23556b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // If the inner loop broke out, the match fails. 23566b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (ChainNodesMatched.empty()) 23576b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; 23582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23596b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // Merge the input chains if they are not intra-pattern references. 23606b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 23616b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 23626b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChain.getNode() == 0) 23636b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; // Failed to merge. 23642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitCopyToReg: { 23692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned DestPhysReg = MatcherTable[MatcherIndex++]; 23722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputChain.getNode() == 0) 23742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getEntryNode(); 23752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(), 23772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DestPhysReg, RecordedNodes[RecNo], 23782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag); 23792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = InputChain.getValue(1); 23812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNodeXForm: { 23852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned XFormNo = MatcherTable[MatcherIndex++]; 23862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo)); 23892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNode: 23932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MorphNodeTo: { 239414df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner uint16_t TargetOpc = MatcherTable[MatcherIndex++]; 239514df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 23962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned EmitNodeInfo = MatcherTable[MatcherIndex++]; 23972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the result VT list. 23982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumVTs = MatcherTable[MatcherIndex++]; 23992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<EVT, 4> VTs; 24002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumVTs; ++i) { 24012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 24022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 24032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy; 24042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(VT); 24052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 24082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Other); 24092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) 24102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Flag); 24112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24127d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // This is hot code, so optimize the two most common cases of 1 and 2 24137d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // results. 24147d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner SDVTList VTList; 24157d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner if (VTs.size() == 1) 24167d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0]); 24177d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else if (VTs.size() == 2) 24187d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0], VTs[1]); 24197d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else 24207d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs.data(), VTs.size()); 24212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the operand list. 24232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumOps = MatcherTable[MatcherIndex++]; 24242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> Ops; 24252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumOps; ++i) { 24262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 24272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 24282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 24292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid EmitNode"); 24312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(RecordedNodes[RecNo]); 24322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If there are variadic operands to add, handle them now. 24352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_VariadicInfo) { 24362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Determine the start index to copy from. 24372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo); 24382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0; 24392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->getNumOperands() >= FirstOpToCopy && 24402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Invalid variadic node"); 24412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Copy all of the variadic operands, not including a potential flag 24422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // input. 24432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands(); 24442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner i != e; ++i) { 24452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue V = NodeToMatch->getOperand(i); 24462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (V.getValueType() == MVT::Flag) break; 24472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(V); 24482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this has chain/flag inputs, add them. 24522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 24532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputChain); 24542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if ((EmitNodeInfo & OPFL_FlagInput) && InputFlag.getNode() != 0) 24552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputFlag); 24562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Create the node. 24582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *Res = 0; 24592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode != OPC_MorphNodeTo) { 24602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this is a normal EmitNode command, just create the new node and 24612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // add the results to the RecordedNodes list. 24622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(), 24632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTList, Ops.data(), Ops.size()); 24642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Add all the non-flag/non-chain results to the RecordedNodes list. 24662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = VTs.size(); i != e; ++i) { 24672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break; 24682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(SDValue(Res, i)); 24692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else { 24723ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(), 24733ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner EmitNodeInfo); 24742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the node had chain/flag results, update our notion of the current 24772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chain and flag. 247882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) { 24792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = SDValue(Res, VTs.size()-1); 24802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 24812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-2); 24822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (EmitNodeInfo & OPFL_Chain) 24832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-1); 24842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the OPFL_MemRefs flag is set on this node, slap all of the 24862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // accumulated memrefs onto it. 24872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // 24882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: This is vastly incorrect for patterns with multiple outputs 24892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // instructions that access memory and for ComplexPatterns that match 24902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // loads. 24912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_MemRefs) { 24922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MachineSDNode::mmo_iterator MemRefs = 24932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MF->allocateMemRefsArray(MatchedMemRefs.size()); 24942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs); 24952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner cast<MachineSDNode>(Res) 24962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size()); 24972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << " " 25002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created") 25012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << " node: "; Res->dump(CurDAG); errs() << "\n"); 25022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this was a MorphNodeTo then we're completely done! 25042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode == OPC_MorphNodeTo) { 25052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 25062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 250782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, true); 250882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner return Res; 25092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MarkFlagResults: { 25152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumNodes = MatcherTable[MatcherIndex++]; 25162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read and remember all the flag-result nodes. 25182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumNodes; ++i) { 25192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 25202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 25212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 25222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 25242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 25252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CompleteMatch: { 25302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // The match has been completed, and any new nodes (if any) have been 25312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created. Patch up references to the matched dag to use the newly 25322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created nodes. 25332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumResults = MatcherTable[MatcherIndex++]; 25342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumResults; ++i) { 25362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ResSlot = MatcherTable[MatcherIndex++]; 25372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ResSlot & 128) 25382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex); 25392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame"); 25412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Res = RecordedNodes[ResSlot]; 25422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2543b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner assert(i < NodeToMatch->getNumValues() && 2544b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Other && 2545b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Flag && 2546b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner "Invalid number of results to complete!"); 25472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert((NodeToMatch->getValueType(i) == Res.getValueType() || 25482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i) == MVT::iPTR || 25492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType() == MVT::iPTR || 25502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i).getSizeInBits() == 25512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType().getSizeInBits()) && 25522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "invalid replacement"); 25532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res); 25542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the root node defines a flag, add it to the flag nodes to update 25572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // list. 25582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Flag) 25592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(NodeToMatch); 25602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 25622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 256382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, false); 25642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->use_empty() && 25662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Didn't replace all uses of the node?"); 25672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: We just return here, which interacts correctly with SelectRoot 25692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // above. We should fix this to not return an SDNode* anymore. 25702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 25712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the code reached this point, then the match failed. See if there is 25752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // another child to try in the current 'Scope', otherwise pop it until we 25762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // find a case to check. 257719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n"); 2578bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 25792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 25802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (MatchScopes.empty()) { 25812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CannotYetSelect(NodeToMatch); 25822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 25832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Restore the interpreter state back to the point where the scope was 25862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // formed. 25872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope &LastScope = MatchScopes.back(); 25882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.resize(LastScope.NumRecordedNodes); 25892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.clear(); 25902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end()); 25912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 25922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size()) 25942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.resize(LastScope.NumMatchedMemRefs); 25952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatcherIndex = LastScope.FailIndex; 25962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 259719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Continuing at " << MatcherIndex << "\n"); 259819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman 25992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = LastScope.InputChain; 26002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = LastScope.InputFlag; 26012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasChainNodesMatched) 26022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 26032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasFlagResultNodesMatched) 26042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.clear(); 26052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see what the offset is at the new MatcherIndex. If it is zero 26072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we have reached the end of this scope, otherwise we have another child 26082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // in the current scope to try. 26092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 26102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip & 128) 26112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 26122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If we have another child in this scope to match, update FailIndex and 26142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // try it. 26152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip != 0) { 26162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner LastScope.FailIndex = MatcherIndex+NumToSkip; 26172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 26182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // End of this scope, pop it and try the next child in the containing 26212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // scope. 26222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.pop_back(); 26232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 26262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2629eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelect(SDNode *N) { 2630e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::string msg; 2631e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman raw_string_ostream Msg(msg); 2632e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman Msg << "Cannot yet select: "; 26332c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner 26342c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN && 26352c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_WO_CHAIN && 26362c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_VOID) { 26372c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->printrFull(Msg, CurDAG); 26382c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } else { 26392c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other; 26402c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner unsigned iid = 26412c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue(); 26422c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (iid < Intrinsic::num_intrinsics) 26432c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid); 26442c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo()) 26452c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "target intrinsic %" << TII->getName(iid); 26462c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else 26472c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "unknown intrinsic #" << iid; 26482c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } 264975361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error(Msg.str()); 2650e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 2651e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 26521997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 2653