SelectionDAGISel.cpp revision 2ad0fcf794924f618a7240741cc14a39be99d0f2
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 167f0757b0edc1ef3d1998485d3f74cadaa3f7180a0Dan GohmanSelectionDAGISel::SelectionDAGISel(const TargetMachine &tm, CodeGenOpt::Level OL) : 168ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()), 1697c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 17050d2b1ac029d63500ea9b9347561b1454fa6ed6aDan Gohman CurDAG(new SelectionDAG(tm, *FuncInfo)), 17155e59c186303ff02c0be7429da3b1b36c347f164Dan Gohman SDB(new SelectionDAGBuilder(*CurDAG, *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 198ae541aad5c36cb3e4256514447d1f81e253079c7Dan Gohman const 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 2158a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // If the first basic block in the function has live ins that need to be 2168a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 2178a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 2182ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock *EntryMBB = MF->begin(); 2192ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII); 2202ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 2212ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Insert DBG_VALUE instructions for function arguments to the entry block. 2222ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) { 2232ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1]; 2242ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng unsigned Reg = MI->getOperand(0).getReg(); 2252ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng if (TargetRegisterInfo::isPhysicalRegister(Reg)) 2262ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng EntryMBB->insert(EntryMBB->begin(), MI); 2272ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng else { 2282ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *Def = RegInfo->getVRegDef(Reg); 2292ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock::iterator InsertPos = Def; 2302ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng EntryMBB->insert(llvm::next(InsertPos), MI); 2312ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 2322ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 2332ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 2342ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Release function-specific state. SDB and CurDAG are already cleared 2352ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // at this point. 2362ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng FuncInfo->clear(); 2378a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 241a9a3321938aac13477bdc53af0018bce88b45d78Dan GohmanMachineBasicBlock * 242a9a3321938aac13477bdc53af0018bce88b45d78Dan GohmanSelectionDAGISel::SelectBasicBlock(MachineBasicBlock *BB, 243a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman const BasicBlock *LLVMBB, 244a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BasicBlock::const_iterator Begin, 245a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BasicBlock::const_iterator End, 246a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman bool &HadTailCall) { 24798ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 248f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // as a tail call, cease emitting nodes for this block. Terminators 249f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // are handled below. 250c105a2b5b7d8969e78bd4b203e980dced8a1c689Dan Gohman for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I) 251f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman SDB->visit(*I); 252f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 253a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 2542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 255c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 256f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Final step, emit the lowered DAG as machine code. 257a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = CodeGenAndEmitDAG(BB); 2582048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman HadTailCall = SDB->HasTailCall; 2592048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 260a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman return BB; 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengnamespace { 26454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted 26554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// nodes from the worklist. 26654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengclass SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener { 26754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng SmallVector<SDNode*, 128> &Worklist; 26825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &InWorklist; 26954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengpublic: 27025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl, 27125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &inwl) 27225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner : Worklist(wl), InWorklist(inwl) {} 27325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 27425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner void RemoveFromWorklist(SDNode *N) { 27525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!InWorklist.erase(N)) return; 27625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 27725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallVector<SDNode*, 128>::iterator I = 27825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner std::find(Worklist.begin(), Worklist.end(), N); 27925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(I != Worklist.end() && "Not in worklist"); 28025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 28125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner *I = Worklist.back(); 28225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.pop_back(); 28325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 28425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 28554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeDeleted(SDNode *N, SDNode *E) { 28625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner RemoveFromWorklist(N); 28754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 28854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 28954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeUpdated(SDNode *N) { 29054e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng // Ignore updates. 29154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 29254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng}; 29354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng} 29454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 295046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng/// TrivialTruncElim - Eliminate some trivial nops that can result from 296046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng/// ShrinkDemandedOps: (trunc (ext n)) -> n. 297046632f272b22a653c204c0ef56eb4076368d4bbEvan Chengstatic bool TrivialTruncElim(SDValue Op, 298046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng TargetLowering::TargetLoweringOpt &TLO) { 299046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng SDValue N0 = Op.getOperand(0); 300046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng EVT VT = Op.getValueType(); 301046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng if ((N0.getOpcode() == ISD::ZERO_EXTEND || 302046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOpcode() == ISD::SIGN_EXTEND || 303046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOpcode() == ISD::ANY_EXTEND) && 304046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOperand(0).getValueType() == VT) { 305046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng return TLO.CombineTo(Op, N0.getOperand(0)); 306046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng } 307046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng return false; 308046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng} 309046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng 31054eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// ShrinkDemandedOps - A late transformation pass that shrink expressions 31154eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// using TargetLowering::TargetLoweringOpt::ShrinkDemandedOp. It converts 31254eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// x+y to (VT)((SmallVT)x+(SmallVT)y) if the casts are free. 313d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Chengvoid SelectionDAGISel::ShrinkDemandedOps() { 314d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng SmallVector<SDNode*, 128> Worklist; 31525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> InWorklist; 316d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 317d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Add all the dag nodes to the worklist. 318d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.reserve(CurDAG->allnodes_size()); 319d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(), 32025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner E = CurDAG->allnodes_end(); I != E; ++I) { 321d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.push_back(I); 32225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(I); 32325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 324d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 325e5b51ac7708402473f0a558f4aac74fab63d4f7eEvan Cheng TargetLowering::TargetLoweringOpt TLO(*CurDAG, true, true, true); 326d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng while (!Worklist.empty()) { 3277b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 32825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.erase(N); 329d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 330d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (N->use_empty() && N != CurDAG->getRoot().getNode()) { 331c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner // Deleting this node may make its operands dead, add them to the worklist 332c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner // if they aren't already there. 333c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 334c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner if (InWorklist.insert(N->getOperand(i).getNode())) 335c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner Worklist.push_back(N->getOperand(i).getNode()); 336c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner 33754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng CurDAG->DeleteNode(N); 338d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng continue; 339d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 340d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 341d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Run ShrinkDemandedOp on scalar binary operations. 34225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (N->getNumValues() != 1 || 34325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner !N->getValueType(0).isSimple() || !N->getValueType(0).isInteger()) 34425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner continue; 34525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 34625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner unsigned BitWidth = N->getValueType(0).getScalarType().getSizeInBits(); 34725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner APInt Demanded = APInt::getAllOnesValue(BitWidth); 34825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner APInt KnownZero, KnownOne; 34925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!TLI.SimplifyDemandedBits(SDValue(N, 0), Demanded, 35025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner KnownZero, KnownOne, TLO) && 35125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner (N->getOpcode() != ISD::TRUNCATE || 35225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner !TrivialTruncElim(SDValue(N, 0), TLO))) 35325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner continue; 35425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 35525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Revisit the node. 35625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(!InWorklist.count(N) && "Already in worklist"); 35725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(N); 35825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(N); 35925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 36025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Replace the old value with the new one. 36125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DEBUG(errs() << "\nShrinkDemandedOps replacing "; 36225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner TLO.Old.getNode()->dump(CurDAG); 36325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner errs() << "\nWith: "; 36425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner TLO.New.getNode()->dump(CurDAG); 36525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner errs() << '\n'); 36625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 36725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (InWorklist.insert(TLO.New.getNode())) 36825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(TLO.New.getNode()); 36925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 37025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover DeadNodes(Worklist, InWorklist); 37125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner CurDAG->ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, &DeadNodes); 37225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 37325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!TLO.Old.getNode()->use_empty()) continue; 37425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 37525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner for (unsigned i = 0, e = TLO.Old.getNode()->getNumOperands(); 37625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner i != e; ++i) { 37725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDNode *OpNode = TLO.Old.getNode()->getOperand(i).getNode(); 37825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (OpNode->hasOneUse()) { 37925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Add OpNode to the end of the list to revisit. 38025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DeadNodes.RemoveFromWorklist(OpNode); 38125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(OpNode); 38225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(OpNode); 383d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 384d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 38525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 38625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DeadNodes.RemoveFromWorklist(TLO.Old.getNode()); 38725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner CurDAG->DeleteNode(TLO.Old.getNode()); 388d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 389d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng} 390d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 391f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 392ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 393ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 394a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 395ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 396a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 397ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 398ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 399ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 400a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4017b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer do { 4027b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 403a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 404ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 405ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 406ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 407a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 408ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 409ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 410825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 411ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 412a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 413ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 414ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 415ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 416a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 417ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 418ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 419ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 420a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 421ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 422475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 423e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 424ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 425ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 426a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 427f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 428ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 429f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 430a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 431ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 432ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 433ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 434f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (DestReg >= FuncInfo->LiveOutRegInfo.size()) 435f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo.resize(DestReg+1); 436f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FunctionLoweringInfo::LiveOutInfo &LOI = 437f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo[DestReg]; 438ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 439a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownOne = KnownOne; 440a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownZero = KnownZero; 441ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 4427b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer } while (!Worklist.empty()); 443ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 444ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 445a9a3321938aac13477bdc53af0018bce88b45d78Dan GohmanMachineBasicBlock *SelectionDAGISel::CodeGenAndEmitDAG(MachineBasicBlock *BB) { 446462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 447462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 448462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 449462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 450462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 45125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 45225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 453f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman BlockName = MF->getFunction()->getNameStr() + ":" + 454f6ccee5a9d2b9573f679bca6266ade3eb8cd3f88Daniel Dunbar BB->getBasicBlock()->getNameStr(); 455462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 4561a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Initial selection DAG:\n"); 457f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 458462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 459f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 460417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 461af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 462ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 4635e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 464be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 465ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 466be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 467ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 468a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4691a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized lowered selection DAG:\n"); 470f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 471a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 4731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 474714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 475714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman BlockName); 476714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 477714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman bool Changed; 478714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 479714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 480714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 481714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 482714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 483714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 484714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 4851a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Type-legalized selection DAG:\n"); 486714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 487462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 488714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 489714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 490714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 491714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 492714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 493462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 494714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize types", GroupName); 495714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 496462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 497714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 498462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 499462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5001a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n"); 501f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 502714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 503462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 504714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 505714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Vector Legalization", GroupName); 506714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 507714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 508714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 509714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 5105c22c8074404797f1313b1334757254fb5c6487aEli Friedman 511714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 5125c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (TimePassesIsEnabled) { 513714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization 2", GroupName); 5149882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 5155c22c8074404797f1313b1334757254fb5c6487aEli Friedman } else { 5169882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 5175c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 5185c22c8074404797f1313b1334757254fb5c6487aEli Friedman 519714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 520714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 5215c22c8074404797f1313b1334757254fb5c6487aEli Friedman 522714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 523714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 524714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName); 525714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 526714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 527714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 5285c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 529714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 5301a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n"); 531714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 53270587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 533a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 534f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 535462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 536ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5375e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 538714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 539ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 540714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 541ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 542a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5431a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Legalized selection DAG:\n"); 544f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 545a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 546f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 547462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 548af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 549ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5505e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 551be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 552ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 553be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 554ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 555a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5561a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized legalized selection DAG:\n"); 557f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 558417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 559d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (OptLevel != CodeGenOpt::None) { 560d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng ShrinkDemandedOps(); 561f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 562d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 563552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 564552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 565552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner 566a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 567a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 568ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5695e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 5707c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 571ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5727c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 573ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 574db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5751a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Selected selection DAG:\n"); 576f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 577462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 578f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 579462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5805e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 58147ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 5825e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 5835e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 58447ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 5855e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 58647ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 5875e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 5885e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 589462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 590462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 591a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 592db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 593ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5945e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 5952048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = Scheduler->EmitSchedule(&SDB->EdgeMapping); 596ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = Scheduler->EmitSchedule(&SDB->EdgeMapping); 5985e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 5995e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 6005e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 6015e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 6025e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 6035e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 6045e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 6055e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 606ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 607db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 608a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman return BB; 609a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 610f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 6117c306da505e2d7f64e160890b274a47fa0740962Chris Lattnervoid SelectionDAGISel::DoInstructionSelection() { 6127c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection begins:\n"); 6137c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6147c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PreprocessISelDAG(); 6157c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6167c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Select target instructions for the DAG. 6177c306da505e2d7f64e160890b274a47fa0740962Chris Lattner { 6187c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Number all nodes with a topological order and set DAGSize. 6197c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DAGSize = CurDAG->AssignTopologicalOrder(); 6207c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6217c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Create a dummy node (which is not added to allnodes), that adds 6227c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // a reference to the root node, preventing it from being deleted, 6237c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // and tracking any changes of the root. 6247c306da505e2d7f64e160890b274a47fa0740962Chris Lattner HandleSDNode Dummy(CurDAG->getRoot()); 6257c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode()); 6267c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ++ISelPosition; 6277c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6287c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // The AllNodes list is now topological-sorted. Visit the 6297c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // nodes by starting at the end of the list (the root of the 6307c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // graph) and preceding back toward the beginning (the entry 6317c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // node). 6327c306da505e2d7f64e160890b274a47fa0740962Chris Lattner while (ISelPosition != CurDAG->allnodes_begin()) { 6337c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *Node = --ISelPosition; 6347c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes, 6357c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // but there are currently some corner cases that it misses. Also, this 6367c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // makes it theoretically possible to disable the DAGCombiner. 6377c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) 6387c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 6397c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6407c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *ResNode = Select(Node); 6417c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 64282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // FIXME: This is pretty gross. 'Select' should be changed to not return 64382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // anything at all and this code should be nuked with a tactical strike. 64482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 6457c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If node should not be replaced, continue with the next one. 64682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE) 6477c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 6487c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Replace node. 6497c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (ResNode) 6507c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ReplaceUses(Node, ResNode); 6517c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6527c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If after the replacement this node is not used any more, 6537c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // remove this dead node. 6547c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) { // Don't delete EntryToken, etc. 6557c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelUpdater ISU(ISelPosition); 6567c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->RemoveDeadNode(Node, &ISU); 6577c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6587c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6597c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6607c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->setRoot(Dummy.getValue()); 6617c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6627c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection ends:\n"); 6637c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6647c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PostprocessISelDAG(); 6657c306da505e2d7f64e160890b274a47fa0740962Chris Lattner} 6667c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6672520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and 6682520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// do other setup for EH landing-pad blocks. 6692520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohmanvoid SelectionDAGISel::PrepareEHLandingPad(MachineBasicBlock *BB) { 6702520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 6712520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 6722520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman MCSymbol *Label = MF->getMMI().addLandingPad(BB); 6732520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 67455e59c186303ff02c0be7429da3b1b36c347f164Dan Gohman const TargetInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL); 6752520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman BuildMI(BB, SDB->getCurDebugLoc(), II).addSym(Label); 6762520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6772520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception register as live in. 6782520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 6792520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Reg) BB->addLiveIn(Reg); 6802520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6812520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception selector register as live in. 6822520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 6832520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Reg) BB->addLiveIn(Reg); 6842520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6852520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 6862520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 6872520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // like, the basic block containing the invoke), and need to be associated 6882520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // with it in the dwarf exception handling tables. Currently however the 6892520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 6902520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 6912520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // then breaking it can result in the intrinsics being in the successor of 6922520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the landing pad, not the landing pad itself. This results 6932520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // in exceptions not being caught because no typeids are associated with 6942520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the invoke. This may not be the only way things can go wrong, but it 6952520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // is the only way we try to work around for the moment. 6962520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const BasicBlock *LLVMBB = BB->getBasicBlock(); 6972520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 6982520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6992520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 7002520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman BasicBlock::const_iterator I, E; 7012520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 7022520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (isa<EHSelectorInst>(I)) 7032520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman break; 7042520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7052520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (I == E) 7062520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // No catch info found - try to extract some from the successor. 7072520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo); 7082520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman } 7092520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman} 7107c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 71146510a73e977273ec67747eb34cbdb43f815e451Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) { 712a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 713a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 714a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISel) 7156a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman FastIS = TLI.createFastISel(*MF, FuncInfo->ValueMap, FuncInfo->MBBMap, 716f81eca0ab908fdcf98ae0efaa75acccc8ba40dc2Dan Gohman FuncInfo->StaticAllocaMap, 717f81eca0ab908fdcf98ae0efaa75acccc8ba40dc2Dan Gohman FuncInfo->PHINodesToUpdate 718dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#ifndef NDEBUG 719dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman , FuncInfo->CatchInfoLost 720dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#endif 721dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman ); 722a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 723a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 72446510a73e977273ec67747eb34cbdb43f815e451Dan Gohman for (Function::const_iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 72546510a73e977273ec67747eb34cbdb43f815e451Dan Gohman const BasicBlock *LLVMBB = &*I; 726a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman MachineBasicBlock *BB = FuncInfo->MBBMap[LLVMBB]; 727f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 728ba5be5c07bb19dcf484e3aa40cd139dd07c10407Dan Gohman BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI(); 72946510a73e977273ec67747eb34cbdb43f815e451Dan Gohman BasicBlock::const_iterator const End = LLVMBB->end(); 73046510a73e977273ec67747eb34cbdb43f815e451Dan Gohman BasicBlock::const_iterator BI = Begin; 7315edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 7325edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Lower any arguments needed in this block if this is the entry block. 73333134c4a75558288d663267c8991f6bd37a530afDan Gohman bool SuppressFastISel = false; 73433134c4a75558288d663267c8991f6bd37a530afDan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 7355edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman LowerArguments(LLVMBB); 736f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 73733134c4a75558288d663267c8991f6bd37a530afDan Gohman // If any of the arguments has the byval attribute, forgo 73833134c4a75558288d663267c8991f6bd37a530afDan Gohman // fast-isel in the entry block. 739a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (FastIS) { 74033134c4a75558288d663267c8991f6bd37a530afDan Gohman unsigned j = 1; 74146510a73e977273ec67747eb34cbdb43f815e451Dan Gohman for (Function::const_arg_iterator I = Fn.arg_begin(), E = Fn.arg_end(); 74233134c4a75558288d663267c8991f6bd37a530afDan Gohman I != E; ++I, ++j) 7430598866c052147c31b808391f58434ce3dbfb838Devang Patel if (Fn.paramHasAttr(j, Attribute::ByVal)) { 74477ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) 7451a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel skips entry block due to byval argument\n"; 74633134c4a75558288d663267c8991f6bd37a530afDan Gohman SuppressFastISel = true; 74733134c4a75558288d663267c8991f6bd37a530afDan Gohman break; 74833134c4a75558288d663267c8991f6bd37a530afDan Gohman } 74933134c4a75558288d663267c8991f6bd37a530afDan Gohman } 75033134c4a75558288d663267c8991f6bd37a530afDan Gohman } 75133134c4a75558288d663267c8991f6bd37a530afDan Gohman 7522520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Setup an EH landing-pad block. 7532520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (BB->isLandingPad()) 7542520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman PrepareEHLandingPad(BB); 7552520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 756f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 757dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (FastIS && !SuppressFastISel) { 758a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Emit code for any incoming arguments. This must happen before 759a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // beginning FastISel on the entry block. 760a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 7612048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 762a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = CodeGenAndEmitDAG(BB); 7632048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 764a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 765241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->startNewBlock(BB); 766a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 767a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman for (; BI != End; ++BI) { 76821c14e3649b3e2a70ac36ebb148f17648f10a2a9Dan Gohman // Try to select the instruction with FastISel. 7698ba3aa7f9c5048c31172788f98ad2b90ffad565aDan Gohman if (FastIS->SelectInstruction(BI)) 770a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 771f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 772a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 773a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<CallInst>(BI)) { 774c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 775a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 7761a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel missed call: "; 777a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 778f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 779f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 78033b7a291aa1bd477bc09e3ef5fccb76249502a5eDan Gohman if (!BI->getType()->isVoidTy() && !BI->use_empty()) { 781a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman unsigned &R = FuncInfo->ValueMap[BI]; 782a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 783a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman R = FuncInfo->CreateRegForValue(BI); 784f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 785a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 786b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall = false; 787a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = SelectBasicBlock(BB, LLVMBB, BI, llvm::next(BI), HadTailCall); 788b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 789b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman // If the call was emitted as a tail call, we're done with the block. 790b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman if (HadTailCall) { 791b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman BI = End; 792b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman break; 793b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman } 794b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 795241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // If the instruction was codegen'd with multiple blocks, 796241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // inform the FastISel object where to resume inserting. 797241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->setCurrentBlock(BB); 798a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 799f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 800a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 801a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Otherwise, give up on FastISel for the rest of the block. 802a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For now, be a little lenient about non-branch terminators. 803a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!isa<TerminatorInst>(BI) || isa<BranchInst>(BI)) { 804c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 805a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 8061a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 807a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 808a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 809a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 810a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 811a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 812c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 813a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 814a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 815f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 816f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 817f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 818d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // Run SelectionDAG instruction selection on the remainder of the block 819d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // not handled by FastISel. If FastISel is not run, this is the entire 8203df24e667f04a7003342b534310919abc9c87418Dan Gohman // block. 821390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel if (BI != End) { 822b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall; 823a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = SelectBasicBlock(BB, LLVMBB, BI, End, HadTailCall); 824390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel } 825381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 826a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman FinishBasicBlock(BB); 827620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman FuncInfo->PHINodesToUpdate.clear(); 82839fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 829a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 830a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 8310e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 8320e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 833fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 834a9a3321938aac13477bdc53af0018bce88b45d78Dan GohmanSelectionDAGISel::FinishBasicBlock(MachineBasicBlock *BB) { 8351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8361a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Target-post-processed machine code:\n"); 837f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(BB->dump()); 8384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8391a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Total amount of phi nodes to update: " 840620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << FuncInfo->PHINodesToUpdate.size() << "\n"); 841620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman DEBUG(for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) 8421a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Node " << i << " : (" 843620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << FuncInfo->PHINodesToUpdate[i].first 844620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n"); 845a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 846a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 8471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 8482048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (SDB->SwitchCases.empty() && 8492048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.empty() && 8502048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.empty()) { 851620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 852620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 853518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 854f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 855580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen if (!BB->isSuccessor(PHI->getParent())) 856580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen continue; 857620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 858620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 8599ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 860f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 861f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 8621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8642048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) { 8654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 8662048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->BitTestCases[i].Emitted) { 8674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 8682048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Parent; 8694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 87099be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitBitTestHeader(SDB->BitTestCases[i], BB); 8712048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 872a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = CodeGenAndEmitDAG(BB); 8732048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 874a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 8754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8762048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) { 8774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 8782048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Cases[j].ThisBB; 8794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 8804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 8812048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB, 8822048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 88399be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 88499be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman BB); 8854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 8862048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Default, 8872048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 88899be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 88999be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman BB); 890a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 891a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 8922048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 893a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = CodeGenAndEmitDAG(BB); 8942048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 8954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 8964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 898620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 899620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 900620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 9014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 902518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 9034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 9044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 9054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 9062048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->BitTestCases[i].Default) { 907f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 908620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 909620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9102048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); 911f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 912620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 913620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9142048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases. 9159ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 9164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 9182048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); 9197c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 9202048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB; 921dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (cBB->isSuccessor(PHIBB)) { 922f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 923620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 924620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9259ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 9264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9302048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.clear(); 9314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9329453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 9339453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 9349453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 9352048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) { 9363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 9372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->JTCases[i].first.Emitted) { 9383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 9392048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].first.HeaderBB; 9403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 94199be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first, 94299be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman BB); 9432048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 944a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = CodeGenAndEmitDAG(BB); 9452048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 9464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 947a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 94837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 9492048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].second.MBB; 95037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 9512048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTable(SDB->JTCases[i].second); 9522048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 953a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = CodeGenAndEmitDAG(BB); 9542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 955a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 95637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 957620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 958620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 959620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 96037efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 961518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 96237efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 9634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 9642048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->JTCases[i].second.Default) { 965ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 966620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 967620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 968ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 9692048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB)); 970f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 9714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 972dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (BB->isSuccessor(PHIBB)) { 973ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 974620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 975620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9769ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 97737efe6764568a3829fee26aba532283131d1a104Nate Begeman } 97837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 97937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 9802048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.clear(); 981a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 982b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 983b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 984620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 985620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 986518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 987b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 988b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 989620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 990620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 9919ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 992b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 993b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 994a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 995f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 996f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 9972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) { 998f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 9992048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock *ThisBB = BB = SDB->SwitchCases[i].ThisBB; 1000a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1001f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 100299be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitSwitchCase(SDB->SwitchCases[i], BB); 10032048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1004a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = CodeGenAndEmitDAG(BB); 1005a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1006d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 1007d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 1008d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1009d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 10102048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman while ((BB = SDB->SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 1011fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng // If new BB's are created during scheduling, the edges may have been 1012ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // updated. That is, the edge from ThisBB to BB may have been split and 1013ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // BB's predecessor is now another block. 1014fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*>::iterator EI = 10152048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->EdgeMapping.find(BB); 10162048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (EI != SDB->EdgeMapping.end()) 1017fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng ThisBB = EI->second; 1018dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen 1019dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // BB may have been removed from the CFG if a branch was constant folded. 1020dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (ThisBB->isSuccessor(BB)) { 1021dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (MachineBasicBlock::iterator Phi = BB->begin(); 1022518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner Phi != BB->end() && Phi->isPHI(); 1023dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen ++Phi) { 1024dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // This value for this PHI node is recorded in PHINodesToUpdate. 1025dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (unsigned pn = 0; ; ++pn) { 1026620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman assert(pn != FuncInfo->PHINodesToUpdate.size() && 1027dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen "Didn't find PHI entry!"); 1028620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman if (FuncInfo->PHINodesToUpdate[pn].first == Phi) { 1029dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand:: 1030620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pn].second, 1031dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen false)); 1032dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1033dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen break; 1034dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen } 10358be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1036d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1037f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1038a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1039d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 10402048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (BB == SDB->SwitchCases[i].FalseBB) 10412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].FalseBB = 0; 1042a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1043d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 10442048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].TrueBB = SDB->SwitchCases[i].FalseBB; 10452048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].FalseBB = 0; 1046f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 10472048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman assert(SDB->SwitchCases[i].TrueBB == 0 && SDB->SwitchCases[i].FalseBB == 0); 10482048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 1049a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 10502048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases.clear(); 10511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1052a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 105313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 10540a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 10550a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 10560a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 10575e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 105847ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1059eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1060a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 106113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1062eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 10639373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 10644ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1065a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1066be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1067a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 10680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1069fc54c552963545a81e4ea38e60460590afb2d5aeDan GohmanScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 1070fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman return new ScheduleHazardRecognizer(); 10719ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 10729ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 1073755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1074755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1075755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1076755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1077755480681c795d585c73556c028b6143c46bda86Chris Lattner 1078755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1079755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1080755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1081755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1082a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1083dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 10842e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 10852e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1086a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1087755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1088755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1089755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1090a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1091755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 10922e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1093755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1094a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1095755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1096755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 10972e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1098ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1099755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1100a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1101755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1102755480681c795d585c73556c028b6143c46bda86Chris Lattner 1103755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1104755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1105755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1106755480681c795d585c73556c028b6143c46bda86Chris Lattner 1107755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1108755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1109755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1110755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1111a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 11122e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 11132e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 11142e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1115a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1116755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1117755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1118755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1119a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1120755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 11212e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1122755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1123a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1124755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1125755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 11262e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1127a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11282e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 1129ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 1130a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1131755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1132755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1133755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1134a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1135755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1136a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1137755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1138755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1139755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1140755480681c795d585c73556c028b6143c46bda86Chris Lattner 11419ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 11420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 11430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 11440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1145f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1146475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 11470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 11480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1149decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0 1150decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1 1151decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc 11520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1153decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size(); 1154825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (InOps[e-1].getValueType() == MVT::Flag) 11550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 1156a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1158f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 1159decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (!InlineAsm::isMemKind(Flags)) { 11600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1161697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1162697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1163697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 11640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1165697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1166697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 11670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1168475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1169decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) 117075361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error("Could not match memory address. Inline asm" 117187d677c1856bfdcb91d9daeb69dc5f261c73851eChris Lattner " failure!"); 1172a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 1174decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned NewFlags = 1175decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size()); 1176decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32)); 11770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 11780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 11790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 11800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1181a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 11830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 11840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 11850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1186794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1187e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson/// findFlagUse - Return use of EVT::Flag value produced by the specified 1188c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1189c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1190c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic SDNode *findFlagUse(SDNode *N) { 1191c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1192c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1193c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1194c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1195c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1196c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1197c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1198c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1199c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1200c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1201c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1202c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1203c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1204d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, 1205d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) { 1206da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The NodeID's are given uniques ID's where a node ID is guaranteed to be 1207da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // greater than all of its (recursive) operands. If we scan to a point where 1208da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 'use' is smaller than the node we're scanning for, then we know we will 1209da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // never find it. 1210da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 1211da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The Use may be -1 (unassigned) if it is a newly allocated node. This can 1212da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // happen because we scan down to newly selected nodes in the case of flag 1213da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // uses. 1214da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1)) 1215da244a091dcde022ea4938793d81ee957903ed70Chris Lattner return false; 1216da244a091dcde022ea4938793d81ee957903ed70Chris Lattner 1217da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // Don't revisit nodes if we already scanned it and didn't fail, we know we 1218da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // won't fail if we scan it again. 1219da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if (!Visited.insert(Use)) 1220c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1221c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1222c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1223d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Ignore chain uses, they are validated by HandleMergeInputChains. 1224d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains) 1225d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1226d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1227c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1228c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1229c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1230c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1231c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1232c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1233c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1234c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1235c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1236d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains)) 1237c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1238c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1239c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1240c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1241c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1242014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsProfitableToFold - Returns true if it's profitable to fold the specific 1243014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// operand node N of U during instruction selection that starts at Root. 1244014bf215c3457bb34fee348265e8f63a70b4d503Evan Chengbool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U, 1245014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng SDNode *Root) const { 1246014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng if (OptLevel == CodeGenOpt::None) return false; 1247014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng return N.hasOneUse(); 1248014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng} 1249014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng 1250014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsLegalToFold - Returns true if the specific operand node N of 1251014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// U can be folded during instruction selection that starts at Root. 1252d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattnerbool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 1253d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman CodeGenOpt::Level OptLevel, 1254d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman bool IgnoreChains) { 1255c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1256c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1257c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1258c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1259c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1260c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1261c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1262c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1263c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1264c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1265c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1266c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1267c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1268c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1269c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1270c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1271c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1272c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1273c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root produces a flag, then it gets (even more) interesting. Since it 1274c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // will be "glued" together with its flag use in the scheduler, we need to 1275c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1276c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1277c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1278c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1279c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1280c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1281c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1282c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1283c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1284c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1285c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1286c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1287c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1288c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1289c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1290c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1291c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1292c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [FU] // 1293c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1294c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If FU (flag use) indirectly reaches N (the load), and Root folds N 1295c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // (call it Fold), then X is a predecessor of FU and a successor of 1296c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Fold. But since Fold and FU are flagged together, this will create 1297c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1298c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 12999bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // If the node has flags, walk down the graph to the "lowest" node in the 13009bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // flagged set. 1301e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1302825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (VT == MVT::Flag) { 1303c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *FU = findFlagUse(Root); 1304c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (FU == NULL) 1305c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1306c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov Root = FU; 1307c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 130818fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 130918fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // If our query node has a flag result with a use, we've walked up it. If 131018fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the user (which has already been selected) has a chain or indirectly uses 131118fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the chain, our WalkChainUsers predicate will not consider it. Because of 131218fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // this, we cannot ignore chains in this predicate. 131318fdabadca110671b436de52fe7bd492ad49e656Chris Lattner IgnoreChains = false; 1314c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 131518fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 1316c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 13179bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner SmallPtrSet<SDNode*, 16> Visited; 13189bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains); 1319c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1320c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1321eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) { 1322eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman std::vector<SDValue> Ops(N->op_begin(), N->op_end()); 1323e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SelectInlineAsmMemoryOperands(Ops); 1324e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1325e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::vector<EVT> VTs; 1326e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Other); 1327e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Flag); 1328eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(), 1329e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs, &Ops[0], Ops.size()); 1330d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner New->setNodeId(-1); 1331e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman return New.getNode(); 1332e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1333e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1334eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) { 1335518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0)); 1336e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1337e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 13382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// GetVBR - decode a vbr encoding whose top bit is set. 13392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerALWAYS_INLINE static uint64_t 13402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerGetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) { 13412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(Val >= 128 && "Not a VBR"); 13422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val &= 127; // Remove first vbr bit. 13432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned Shift = 7; 13452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner uint64_t NextBits; 13462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner do { 134714df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner NextBits = MatcherTable[Idx++]; 13482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val |= (NextBits&127) << Shift; 13492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Shift += 7; 13502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } while (NextBits & 128); 13512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return Val; 13532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 13542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// UpdateChainsAndFlags - When a match is complete, this method updates uses of 13572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// interior flag and chain results to use the new flag and chain results. 135882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattnervoid SelectionDAGISel:: 135982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris LattnerUpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain, 136082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &ChainNodesMatched, 136182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SDValue InputFlag, 136282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &FlagResultNodesMatched, 136382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner bool isMorphNodeTo) { 136482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SmallVector<SDNode*, 4> NowDeadNodes; 136582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 136682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner ISelUpdater ISU(ISelPosition); 136782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 13682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Now that all the normal results are replaced, we replace the chain and 13692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // flag results if present. 13702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!ChainNodesMatched.empty()) { 13712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() != 0 && 13722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Matched input chains but didn't produce a chain"); 13732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Loop over all of the nodes we matched that produced a chain result. 13742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Replace all the chain results with the final chain we ended up with. 13752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 13762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *ChainNode = ChainNodesMatched[i]; 13772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 137882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 137982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ChainNode->getOpcode() == ISD::DELETED_NODE) 138082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 138182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 13822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Don't replace the results of the root node if we're doing a 13832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MorphNodeTo. 13842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNode == NodeToMatch && isMorphNodeTo) 13852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 13862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); 13882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainVal.getValueType() == MVT::Flag) 13892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); 13902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainVal.getValueType() == MVT::Other && "Not a chain?"); 139182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU); 139282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 1393856fb395e46a8d485081acbf11928047d852c636Chris Lattner // If the node became dead and we haven't already seen it, delete it. 1394856fb395e46a8d485081acbf11928047d852c636Chris Lattner if (ChainNode->use_empty() && 1395856fb395e46a8d485081acbf11928047d852c636Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode)) 139682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(ChainNode); 13972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 13982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 13992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 14002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the result produces a flag, update any flag results in the matched 14012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern with the flag result. 14022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputFlag.getNode() != 0) { 14032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Handle any interior nodes explicitly marked. 14042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = FlagResultNodesMatched.size(); i != e; ++i) { 14052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *FRN = FlagResultNodesMatched[i]; 140682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 140782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 140882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (FRN->getOpcode() == ISD::DELETED_NODE) 140982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 141082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Flag && 14122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Doesn't have a flag result"); 14132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), 141482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, &ISU); 141582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 141619e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner // If the node became dead and we haven't already seen it, delete it. 141719e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner if (FRN->use_empty() && 141819e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN)) 141982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(FRN); 14202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 142382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (!NowDeadNodes.empty()) 142482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU); 142582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Match complete!\n"); 14272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 14282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1429c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerenum ChainResult { 1430c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_Simple, 1431c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_InducesCycle, 1432c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_LeadsToInteriorNode 1433c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner}; 1434c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1435c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// WalkChainUsers - Walk down the users of the specified chained node that is 1436c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// part of the pattern we're matching, looking at all of the users we find. 1437c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// This determines whether something is an interior node, whether we have a 1438c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// non-pattern node in between two pattern nodes (which prevent folding because 1439c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// it would induce a cycle) and whether we have a TokenFactor node sandwiched 1440c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// between pattern nodes (in which case the TF becomes part of the pattern). 1441c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// 1442c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// The walk we do here is guaranteed to be small because we quickly get down to 1443c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// already selected nodes "below" us. 1444c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerstatic ChainResult 1445c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerWalkChainUsers(SDNode *ChainedNode, 1446c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &ChainedNodesInPattern, 1447c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &InteriorChainedNodes) { 1448c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainResult Result = CR_Simple; 1449c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1450c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (SDNode::use_iterator UI = ChainedNode->use_begin(), 1451c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner E = ChainedNode->use_end(); UI != E; ++UI) { 1452c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Make sure the use is of the chain, not some other value we produce. 1453c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (UI.getUse().getValueType() != MVT::Other) continue; 1454c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1455c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *User = *UI; 1456c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1457c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we see an already-selected machine node, then we've gone beyond the 1458c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that we're selecting down into the already selected chunk of the 1459c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // DAG. 1460c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->isMachineOpcode() || 1461c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner User->getOpcode() == ISD::HANDLENODE) // Root of the graph. 1462c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1463d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1464d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getOpcode() == ISD::CopyToReg || 1465d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner User->getOpcode() == ISD::CopyFromReg || 14667561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::INLINEASM || 14677561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::EH_LABEL) { 1468d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // If their node ID got reset to -1 then they've already been selected. 1469d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Treat them like a MachineOpcode. 1470d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getNodeId() == -1) 1471d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1472d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner } 1473c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1474c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a TokenFactor, we handle it specially. 1475c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->getOpcode() != ISD::TokenFactor) { 1476c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the node isn't a token factor and isn't part of our pattern, then it 1477c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // must be a random chained node in between two nodes we're selecting. 1478c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This happens when we have something like: 1479c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1480c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // call 1481c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1482c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1483c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Because we structurally match the load/store as a read/modify/write, 1484c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // but the call is chained between them. We cannot fold in this case 1485c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // because it would induce a cycle in the graph. 1486c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainedNodesInPattern.begin(), 1487c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.end(), User)) 1488c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1489c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1490c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise we found a node that is part of our pattern. For example in: 1491c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1492c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1493c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1494c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This would happen when we're scanning down from the load and see the 1495c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store as a user. Record that there is a use of ChainedNode that is 1496c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // part of the pattern and keep scanning uses. 1497c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1498c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1499c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1500c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1501c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1502c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we found a TokenFactor, there are two cases to consider: first if the 1503c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // TokenFactor is just hanging "below" the pattern we're matching (i.e. no 1504c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses of the TF are in our pattern) we just want to ignore it. Second, 1505c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the TokenFactor can be sandwiched in between two chained nodes, like so: 1506c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load chain] 1507c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ 1508c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | 1509c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load] 1510c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1511c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | \ DAG's like cheese 1512c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / \ do you? 1513c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / | 1514c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [TokenFactor] [Op] 1515c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1516c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | | 1517c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1518c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1519c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Store] 1520c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1521c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // In this case, the TokenFactor becomes part of our match and we rewrite it 1522c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // as a new TokenFactor. 1523c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1524c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // To distinguish these two cases, do a recursive walk down the uses. 1525c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) { 1526c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_Simple: 1527c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor are just already-selected nodes, ignore 1528c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // it, it is "below" our pattern. 1529c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1530c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_InducesCycle: 1531c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor lead to nodes that are not part of our 1532c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that are not selected, folding would turn this into a cycle, 1533c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // bail out now. 1534c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1535c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_LeadsToInteriorNode: 1536c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner break; // Otherwise, keep processing. 1537c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1538c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1539c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we know we're in the interesting interior case. The TokenFactor 1540c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // is now going to be considered part of the pattern so that we rewrite its 1541c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses (it may have uses that are not part of the pattern) with the 1542c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ultimate chain result of the generated code. We will also add its chain 1543c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // inputs as inputs to the ultimate TokenFactor we create. 1544c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1545c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.push_back(User); 1546c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1547c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1548c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1549c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1550c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return Result; 1551c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner} 1552c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 15536b30792d2d7d142b8192241e6232aee004f745fbChris Lattner/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains 155400592ec857b4c3f31b46412e2738924238c59983Chris Lattner/// operation for when the pattern matched at least one node with a chains. The 1555c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// input vector contains a list of all of the chained nodes that we match. We 1556c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// must determine if this is a valid thing to cover (i.e. matching it won't 1557c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will 1558c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// be used as the input node chain for the generated nodes. 15596b30792d2d7d142b8192241e6232aee004f745fbChris Lattnerstatic SDValue 1560c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerHandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched, 15616b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SelectionDAG *CurDAG) { 1562c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Walk all of the chained nodes we've matched, recursively scanning down the 1563c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // users of the chain result. This adds any TokenFactor nodes that are caught 1564c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // in between chained nodes to the chained and interior nodes list. 1565c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVector<SDNode*, 3> InteriorChainedNodes; 1566c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1567c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched, 1568c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes) == CR_InducesCycle) 1569c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return SDValue(); // Would induce a cycle. 1570c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 15716b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 1572c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we have walked all the matched nodes and collected TokenFactor nodes 1573c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that we are interested in. Form our input TokenFactor node. 15746b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SmallVector<SDValue, 3> InputChains; 15756b30792d2d7d142b8192241e6232aee004f745fbChris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1576c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Add the input chain of this node to the InputChains list (which will be 1577c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the operands of the generated TokenFactor) if it's not an interior node. 1578c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *N = ChainNodesMatched[i]; 1579c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (N->getOpcode() != ISD::TokenFactor) { 1580c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N)) 1581c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1582c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1583c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise, add the input chain. 1584c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDValue InChain = ChainNodesMatched[i]->getOperand(0); 1585c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner assert(InChain.getValueType() == MVT::Other && "Not a chain"); 15866b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChains.push_back(InChain); 1587c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1588c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1589c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1590c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a token factor, we want to add all inputs of the token factor 1591c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that are not part of the pattern we're matching. 1592c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) { 1593c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(), 15946183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner N->getOperand(op).getNode())) 15956183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner InputChains.push_back(N->getOperand(op)); 1596c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 15976b30792d2d7d142b8192241e6232aee004f745fbChris Lattner } 15986b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 15996b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SDValue Res; 16006b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChains.size() == 1) 16016b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return InputChains[0]; 16026b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(), 16036b30792d2d7d142b8192241e6232aee004f745fbChris Lattner MVT::Other, &InputChains[0], InputChains.size()); 16046b30792d2d7d142b8192241e6232aee004f745fbChris Lattner} 16052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 16063ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner/// MorphNode - Handle morphing a node in place for the selector. 16073ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerSDNode *SelectionDAGISel:: 16083ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerMorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList, 16093ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) { 16103ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // It is possible we're using MorphNodeTo to replace a node with no 16113ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // normal results with one that has a normal result (or we could be 16123ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // adding a chain) and the input could have flags and chains as well. 1613caa8870fe09f5526e611434b6bb9f7040c7dfa60Chris Lattner // In this case we need to shift the operands down. 16143ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // FIXME: This is a horrible hack and broken in obscure cases, no worse 1615a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner // than the old isel though. 16163ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner int OldFlagResultNo = -1, OldChainResultNo = -1; 16173ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16183ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned NTMNumResults = Node->getNumValues(); 16193ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Node->getValueType(NTMNumResults-1) == MVT::Flag) { 16203ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldFlagResultNo = NTMNumResults-1; 16213ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (NTMNumResults != 1 && 16223ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Node->getValueType(NTMNumResults-2) == MVT::Other) 16233ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-2; 16243ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } else if (Node->getValueType(NTMNumResults-1) == MVT::Other) 16253ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-1; 16263ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 162761c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // Call the underlying SelectionDAG routine to do the transmogrification. Note 162861c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // that this deletes operands of the old node that become dead. 16293ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps); 16303ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16313ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // MorphNodeTo can operate in two ways: if an existing node with the 16323ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // specified operands exists, it can just return it. Otherwise, it 16333ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // updates the node in place to have the requested operands. 16343ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res == Node) { 16353ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // If we updated the node in place, reset the node ID. To the isel, 16363ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // this should be just like a newly allocated machine node. 16373ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res->setNodeId(-1); 16383ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } 16393ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16403ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned ResNumResults = Res->getNumValues(); 16413ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the flag if needed. 16423ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) && OldFlagResultNo != -1 && 16433ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldFlagResultNo != ResNumResults-1) 16443ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldFlagResultNo), 16453ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 16463ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16473ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) != 0) 16483ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner --ResNumResults; 16493ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16503ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the chain reference if needed. 16513ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 && 16523ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldChainResultNo != ResNumResults-1) 16533ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo), 16543ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 16553ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16563ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Otherwise, no replacement happened because the node already exists. Replace 16573ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Uses of the old node with the new one. 16583ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res != Node) 16593ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesWith(Node, Res); 16603ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16613ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner return Res; 16623ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner} 16633ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 1664f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1665f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1666da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1667da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const SmallVectorImpl<SDValue> &RecordedNodes) { 1668da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Accept if it is exactly the same as a previously recorded node. 1669da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 1670da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 1671da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return N == RecordedNodes[RecNo]; 1672da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1673da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1674da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1675da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1676f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1677f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel) { 1678f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]); 1679f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1680f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1681f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckNodePredicate - Implements OP_CheckNodePredicate. 1682f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1683f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1684f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel, SDNode *N) { 1685f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]); 1686f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1687f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1688f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1689f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1690f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDNode *N) { 1691d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 1692d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 1693d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner return N->getOpcode() == Opc; 1694f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1695f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1696f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1697f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1698f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N, const TargetLowering &TLI) { 1699f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1700f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (N.getValueType() == VT) return true; 1701f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1702f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Handle the case when VT is iPTR. 1703f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy(); 1704f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1705f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1706f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1707da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1708da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI, 1709da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned ChildNo) { 1710da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (ChildNo >= N.getNumOperands()) 1711da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return false; // Match fails if out of range child #. 1712da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI); 1713da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1714da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1715da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1716da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1717da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1718da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N) { 1719da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return cast<CondCodeSDNode>(N)->get() == 1720da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner (ISD::CondCode)MatcherTable[MatcherIndex++]; 1721da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1722da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1723da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1724da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1725da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI) { 1726da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1727da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (cast<VTSDNode>(N)->getVT() == VT) 1728da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return true; 1729da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1730da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Handle the case when VT is iPTR. 1731da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy(); 1732da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1733da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1734da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1735f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1736f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N) { 1737f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1738f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (Val & 128) 1739f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1740f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1741f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N); 1742f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return C != 0 && C->getSExtValue() == Val; 1743f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1744f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1745da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1746da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1747da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1748da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1749da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1750da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1751da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1752da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::AND) return false; 1753da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1754da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1755da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val); 1756da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1757da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1758da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1759da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1760da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1761da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1762da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1763da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1764da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1765da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::OR) return false; 1766da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1767da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1768da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val); 1769da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1770da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1771f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// IsPredicateKnownToFail - If we know how and can do so without pushing a 1772f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// scope, evaluate the current node. If the current predicate is known to 1773f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// fail, set Result=true and return anything. If the current predicate is 1774f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// known to pass, set Result=false and return the MatcherIndex to continue 1775f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// with. If the current predicate is unknown, set Result=false and return the 1776f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// MatcherIndex to continue with. 1777f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattnerstatic unsigned IsPredicateKnownToFail(const unsigned char *Table, 1778f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned Index, SDValue N, 1779da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner bool &Result, SelectionDAGISel &SDISel, 1780da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SmallVectorImpl<SDValue> &RecordedNodes){ 1781f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner switch (Table[Index++]) { 1782f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner default: 1783f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = false; 1784f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index-1; // Could not evaluate this predicate. 1785da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckSame: 1786da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckSame(Table, Index, N, RecordedNodes); 1787da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1788f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPatternPredicate: 1789da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckPatternPredicate(Table, Index, SDISel); 1790f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1791f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPredicate: 1792da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode()); 1793f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1794f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckOpcode: 1795f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckOpcode(Table, Index, N.getNode()); 1796f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1797f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckType: 1798f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckType(Table, Index, N, SDISel.TLI); 1799f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1800f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild0Type: 1801f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild1Type: 1802f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild2Type: 1803f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild3Type: 1804f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild4Type: 1805f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild5Type: 1806f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild6Type: 1807da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckChild7Type: 1808da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckChildType(Table, Index, N, SDISel.TLI, 1809da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type); 1810da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1811da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckCondCode: 1812da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckCondCode(Table, Index, N); 1813da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1814da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckValueType: 1815da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckValueType(Table, Index, N, SDISel.TLI); 1816f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1817f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckInteger: 1818f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckInteger(Table, Index, N); 1819f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1820da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckAndImm: 1821da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckAndImm(Table, Index, N, SDISel); 1822da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1823da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckOrImm: 1824da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckOrImm(Table, Index, N, SDISel); 1825da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1826f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 1827f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1828f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1829b35798347ea87b8b6d36155b211016a7769f01abDan Gohmannamespace { 18303ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattnerstruct MatchScope { 18322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// FailIndex - If this match fails, this is the index to continue with. 18332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FailIndex; 18342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NodeStack - The node stack when the scope was formed. 18362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 4> NodeStack; 18372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumRecordedNodes - The number of recorded nodes when the scope was formed. 18392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumRecordedNodes; 18402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumMatchedMemRefs - The number of matched memref entries. 18422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumMatchedMemRefs; 18432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// InputChain/InputFlag - The current chain/flag 18452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 18462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty. 18482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasChainNodesMatched, HasFlagResultNodesMatched; 18492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner}; 18502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1851b35798347ea87b8b6d36155b211016a7769f01abDan Gohman} 1852b35798347ea87b8b6d36155b211016a7769f01abDan Gohman 18532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSDNode *SelectionDAGISel:: 18542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable, 18552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned TableSize) { 18562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: Should these even be selected? Handle these cases in the caller? 18572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (NodeToMatch->getOpcode()) { 18582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner default: 18592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 18602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::EntryToken: // These nodes remain the same. 18612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::BasicBlock: 18622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::Register: 18633b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::VALUETYPE: 18643b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::CONDCODE: 18652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::HANDLENODE: 1866decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner case ISD::MDNODE_SDNODE: 18672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstant: 18682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantFP: 18692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantPool: 18702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetFrameIndex: 18712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetExternalSymbol: 18722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetBlockAddress: 18732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetJumpTable: 18742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalTLSAddress: 18752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalAddress: 18762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TokenFactor: 18772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyFromReg: 18782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyToReg: 18797561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner case ISD::EH_LABEL: 1880d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch->setNodeId(-1); // Mark selected. 18812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 18822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertSext: 18832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertZext: 18842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0), 18852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getOperand(0)); 18862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 18872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch); 18882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::UNDEF: return Select_UNDEF(NodeToMatch); 18892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 18902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeToMatch->isMachineOpcode() && "Node already selected!"); 18922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Set up the node stack with NodeToMatch as the only node on the stack. 18942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> NodeStack; 18952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue N = SDValue(NodeToMatch, 0); 18962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 18972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchScopes - Scopes used when matching, if a match failure happens, this 18992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // indicates where to continue checking. 19002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MatchScope, 8> MatchScopes; 19012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // RecordedNodes - This is the set of nodes that have been recorded by the 19032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // state machine. 19042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> RecordedNodes; 19052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchedMemRefs - This is the set of MemRef's we've seen in the input 19072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern. 19082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MachineMemOperand*, 2> MatchedMemRefs; 19092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // These are the current input chain and flag for use when generating nodes. 19112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Various Emit operations change these. For example, emitting a copytoreg 19122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // uses and updates these. 19132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 19142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // ChainNodesMatched - If a pattern matches nodes that have input/output 19162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains, the OPC_EmitMergeInputChains operation is emitted which indicates 19172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // which ones they are. The result is captured into this list so that we can 19182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // update the chain results when the pattern is complete. 19192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> ChainNodesMatched; 19202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> FlagResultNodesMatched; 19212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Starting pattern match on root node: "; 19232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->dump(CurDAG); 19242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner errs() << '\n'); 19252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19267390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Determine where to start the interpreter. Normally we start at opcode #0, 19277390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // but if the state machine starts with an OPC_SwitchOpcode, then we 19287390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // accelerate the first lookup (which is guaranteed to be hot) with the 19297390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // OpcodeOffset table. 19302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned MatcherIndex = 0; 19317390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19327390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (!OpcodeOffset.empty()) { 19337390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Already computed the OpcodeOffset table, just index into it. 19347390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 19357390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 19367390eebd49b786f3293d24f76fedb02fe183468cChris Lattner DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n"); 19377390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19387390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } else if (MatcherTable[0] == OPC_SwitchOpcode) { 19397390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Otherwise, the table isn't computed, but the state machine does start 19407390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // with an OPC_SwitchOpcode instruction. Populate the table now, since this 19417390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // is the first time we're selecting an instruction. 19427390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned Idx = 1; 19437390eebd49b786f3293d24f76fedb02fe183468cChris Lattner while (1) { 19447390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the size of this case. 19457390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned CaseSize = MatcherTable[Idx++]; 19467390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize & 128) 19477390eebd49b786f3293d24f76fedb02fe183468cChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, Idx); 19487390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize == 0) break; 19497390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19507390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the opcode, add the index to the table. 1951d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[Idx++]; 1952d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[Idx++] << 8; 19537390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (Opc >= OpcodeOffset.size()) 19547390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset.resize((Opc+1)*2); 19557390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset[Opc] = Idx; 19567390eebd49b786f3293d24f76fedb02fe183468cChris Lattner Idx += CaseSize; 19577390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 19587390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19597390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Okay, do the lookup for the first opcode. 19607390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 19617390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 19627390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 19637390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 19652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(MatcherIndex < TableSize && "Invalid index"); 196619b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#ifndef NDEBUG 196719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman unsigned CurrentOpcodeIndex = MatcherIndex; 196819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#endif 19692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++]; 19702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (Opcode) { 19712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_Scope: { 1972f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Okay, the semantics of this operation are that we should push a scope 1973f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // then evaluate the first child. However, pushing a scope only to have 1974f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // the first check fail (which then pops it) is inefficient. If we can 1975f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // determine immediately that the first check (or first several) will 1976f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // immediately fail, don't even bother pushing a scope for them. 1977f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned FailIndex; 1978f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1979f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner while (1) { 1980f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 1981f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip & 128) 1982f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 1983f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Found the end of the scope with no match. 1984f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip == 0) { 1985f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = 0; 1986f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 1987f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 1988f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1989f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = MatcherIndex+NumToSkip; 1990f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1991a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner unsigned MatcherIndexOfPredicate = MatcherIndex; 1992a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner (void)MatcherIndexOfPredicate; // silence warning. 1993a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner 1994f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If we can't evaluate this predicate without pushing a scope (e.g. if 1995f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // it is a 'MoveParent') or if the predicate succeeds on this node, we 1996f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // push the scope and evaluate the full predicate chain. 1997f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner bool Result; 1998f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N, 1999da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result, *this, RecordedNodes); 2000f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!Result) 2001f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 2002f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2003a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner DEBUG(errs() << " Skipped scope entry (due to false predicate) at " 2004a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << "index " << MatcherIndexOfPredicate 2005a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << ", continuing at " << FailIndex << "\n"); 2006bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 2007f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2008f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Otherwise, we know that this case of the Scope is guaranteed to fail, 2009f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // move to the next case. 2010f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = FailIndex; 2011f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2012f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2013f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If the whole scope failed to match, bail. 2014f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (FailIndex == 0) break; 2015f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 20162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Push a MatchScope which indicates where to go if the first child fails 20172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // to match. 20182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope NewEntry; 2019f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NewEntry.FailIndex = FailIndex; 20202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); 20212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumRecordedNodes = RecordedNodes.size(); 20222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumMatchedMemRefs = MatchedMemRefs.size(); 20232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputChain = InputChain; 20242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputFlag = InputFlag; 20252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty(); 20262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasFlagResultNodesMatched = !FlagResultNodesMatched.empty(); 20272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.push_back(NewEntry); 20282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordNode: 20312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Remember this node, it may end up being an operand in the pattern. 20322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N); 20332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild0: case OPC_RecordChild1: 20362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild2: case OPC_RecordChild3: 20372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild4: case OPC_RecordChild5: 20382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild6: case OPC_RecordChild7: { 20392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = Opcode-OPC_RecordChild0; 20402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 20412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 20422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N->getOperand(ChildNo)); 20442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordMemRef: 20472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand()); 20482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CaptureFlagInput: 20512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the current node has an input flag, capture it in InputFlag. 20522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (N->getNumOperands() != 0 && 20532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag) 20542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = N->getOperand(N->getNumOperands()-1); 20552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveChild: { 20582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = MatcherTable[MatcherIndex++]; 20592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 20602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 20612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = N.getOperand(ChildNo); 20622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 20632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveParent: 20672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Pop the current node off the NodeStack. 20682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.pop_back(); 20692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeStack.empty() && "Node stack imbalance!"); 20702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 20712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2073da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckSame: 2074da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break; 20752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPatternPredicate: 2077f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break; 20782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPredicate: 2080f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this, 2081f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner N.getNode())) 2082f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 20832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 208457bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner case OPC_CheckComplexPat: { 208557bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned CPNum = MatcherTable[MatcherIndex++]; 208657bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 208757bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat"); 208857bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo], CPNum, 208957bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner RecordedNodes)) 20902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 20912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 209257bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner } 20932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckOpcode: 2094f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break; 2095f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner continue; 2096f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2097f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckType: 2098f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break; 20992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2101eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner case OPC_SwitchOpcode: { 2102eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CurNodeOpcode = N.getOpcode(); 21037d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2104eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CaseSize; 2105eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner while (1) { 2106eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Get the size of this case. 2107eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2108eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize & 128) 2109eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2110eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2111eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2112d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2113d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2114d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner 2115eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // If the opcode matches, then we will execute this case. 2116d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner if (CurNodeOpcode == Opc) 2117eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner break; 2118eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2119eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, skip over this case. 2120eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner MatcherIndex += CaseSize; 2121eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2122eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2123cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2124eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2125eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2126eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, execute the case we found. 2127eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner DEBUG(errs() << " OpcodeSwitch from " << SwitchStart 2128eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner << " to " << MatcherIndex << "\n"); 2129eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner continue; 2130eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2131eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2132cfe2eab7446dedc471592fe702fefef783383171Chris Lattner case OPC_SwitchType: { 2133cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CurNodeVT = N.getValueType().getSimpleVT().SimpleTy; 2134cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2135cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned CaseSize; 2136cfe2eab7446dedc471592fe702fefef783383171Chris Lattner while (1) { 2137cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Get the size of this case. 2138cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2139cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize & 128) 2140cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2141cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2142cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2143cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CaseVT = 2144cfe2eab7446dedc471592fe702fefef783383171Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2145cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseVT == MVT::iPTR) 2146cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseVT = TLI.getPointerTy().SimpleTy; 2147cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2148cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If the VT matches, then we will execute this case. 2149cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CurNodeVT == CaseVT) 2150cfe2eab7446dedc471592fe702fefef783383171Chris Lattner break; 2151cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2152cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, skip over this case. 2153cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MatcherIndex += CaseSize; 2154cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 2155cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2156cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2157cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2158cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2159cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, execute the case we found. 2160cfe2eab7446dedc471592fe702fefef783383171Chris Lattner DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString() 2161cfe2eab7446dedc471592fe702fefef783383171Chris Lattner << "] from " << SwitchStart << " to " << MatcherIndex<<'\n'); 2162cfe2eab7446dedc471592fe702fefef783383171Chris Lattner continue; 2163cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 21642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild0Type: case OPC_CheckChild1Type: 21652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild2Type: case OPC_CheckChild3Type: 21662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild4Type: case OPC_CheckChild5Type: 2167da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckChild6Type: case OPC_CheckChild7Type: 2168da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI, 2169da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Opcode-OPC_CheckChild0Type)) 2170f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 21712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckCondCode: 2173da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break; 21742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2175da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckValueType: 2176da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break; 21772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2178f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckInteger: 2179f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break; 21802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2181da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckAndImm: 2182da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break; 21832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2184da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckOrImm: 2185da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break; 21862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckFoldableChainNode: { 21892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeStack.size() != 1 && "No parent node"); 21902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Verify that all intermediate nodes between the root and this one have 21912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // a single use. 21922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasMultipleUses = false; 21932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) 21942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!NodeStack[i].hasOneUse()) { 21952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner HasMultipleUses = true; 21962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 21972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 21982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (HasMultipleUses) break; 21992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see that the target thinks this is profitable to fold and that 22012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we can fold it without inducing cycles in the graph. 22022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(), 22032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch) || 22042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(), 2205d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman NodeToMatch, OptLevel, 2206d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman true/*We validate our own chains*/)) 22072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 22082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitInteger: { 22122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 22132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 22142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 22152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Val & 128) 22162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 22172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT)); 22182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitRegister: { 22212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 22222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 22232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RegNo = MatcherTable[MatcherIndex++]; 22242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT)); 22252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitConvertToTarget: { 22292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Convert from IMM/FPIMM to target version. 22302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 22312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 22322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Imm = RecordedNodes[RecNo]; 22332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Imm->getOpcode() == ISD::Constant) { 22352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue(); 22362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstant(Val, Imm.getValueType()); 22372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (Imm->getOpcode() == ISD::ConstantFP) { 22382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue(); 22392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType()); 22402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(Imm); 22432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2246aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0 2247aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1 2248aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // These are space-optimized forms of OPC_EmitMergeInputChains. 2249aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(InputChain.getNode() == 0 && 2250aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 2251aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(ChainNodesMatched.empty() && 2252aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "Should only have one EmitMergeInputChains per match"); 2253aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2254aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Read all of the chained nodes. 2255aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1; 2256aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2257aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 2258aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2259aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // FIXME: What if other value results of the node have uses not matched 2260aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // by this pattern? 2261aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2262aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 2263aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.clear(); 2264aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; 2265aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2266aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2267aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Merge the input chains if they are not intra-pattern references. 2268aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 2269aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2270aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (InputChain.getNode() == 0) 2271aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; // Failed to merge. 2272aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner continue; 2273aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2274aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 22752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitMergeInputChains: { 22762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() == 0 && 22772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 22782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // This node gets a list of nodes we matched in the input that have 22792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains. We want to token factor all of the input chains to these nodes 22802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // together. However, if any of the input chains is actually one of the 22812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // nodes matched in this pattern, then we have an intra-match reference. 22822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Ignore these because the newly token factored chain should not refer to 22832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // the old nodes. 22842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumChains = MatcherTable[MatcherIndex++]; 22852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NumChains != 0 && "Can't TF zero chains"); 22862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainNodesMatched.empty() && 22882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Should only have one EmitMergeInputChains per match"); 22892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read all of the chained nodes. 229100592ec857b4c3f31b46412e2738924238c59983Chris Lattner for (unsigned i = 0; i != NumChains; ++i) { 229200592ec857b4c3f31b46412e2738924238c59983Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 22932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 22942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 22952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: What if other value results of the node have uses not matched 22972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // by this pattern? 22982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 22992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 23002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 23012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 23022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23046b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 23056b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // If the inner loop broke out, the match fails. 23066b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (ChainNodesMatched.empty()) 23076b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; 23082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23096b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // Merge the input chains if they are not intra-pattern references. 23106b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 23116b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 23126b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChain.getNode() == 0) 23136b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; // Failed to merge. 23142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitCopyToReg: { 23192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned DestPhysReg = MatcherTable[MatcherIndex++]; 23222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputChain.getNode() == 0) 23242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getEntryNode(); 23252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(), 23272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DestPhysReg, RecordedNodes[RecNo], 23282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag); 23292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = InputChain.getValue(1); 23312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNodeXForm: { 23352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned XFormNo = MatcherTable[MatcherIndex++]; 23362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo)); 23392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNode: 23432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MorphNodeTo: { 234414df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner uint16_t TargetOpc = MatcherTable[MatcherIndex++]; 234514df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 23462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned EmitNodeInfo = MatcherTable[MatcherIndex++]; 23472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the result VT list. 23482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumVTs = MatcherTable[MatcherIndex++]; 23492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<EVT, 4> VTs; 23502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumVTs; ++i) { 23512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 23522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 23532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy; 23542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(VT); 23552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 23582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Other); 23592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) 23602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Flag); 23612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23627d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // This is hot code, so optimize the two most common cases of 1 and 2 23637d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // results. 23647d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner SDVTList VTList; 23657d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner if (VTs.size() == 1) 23667d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0]); 23677d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else if (VTs.size() == 2) 23687d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0], VTs[1]); 23697d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else 23707d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs.data(), VTs.size()); 23712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the operand list. 23732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumOps = MatcherTable[MatcherIndex++]; 23742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> Ops; 23752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumOps; ++i) { 23762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 23782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 23792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid EmitNode"); 23812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(RecordedNodes[RecNo]); 23822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If there are variadic operands to add, handle them now. 23852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_VariadicInfo) { 23862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Determine the start index to copy from. 23872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo); 23882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0; 23892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->getNumOperands() >= FirstOpToCopy && 23902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Invalid variadic node"); 23912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Copy all of the variadic operands, not including a potential flag 23922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // input. 23932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands(); 23942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner i != e; ++i) { 23952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue V = NodeToMatch->getOperand(i); 23962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (V.getValueType() == MVT::Flag) break; 23972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(V); 23982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this has chain/flag inputs, add them. 24022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 24032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputChain); 24042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if ((EmitNodeInfo & OPFL_FlagInput) && InputFlag.getNode() != 0) 24052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputFlag); 24062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Create the node. 24082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *Res = 0; 24092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode != OPC_MorphNodeTo) { 24102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this is a normal EmitNode command, just create the new node and 24112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // add the results to the RecordedNodes list. 24122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(), 24132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTList, Ops.data(), Ops.size()); 24142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Add all the non-flag/non-chain results to the RecordedNodes list. 24162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = VTs.size(); i != e; ++i) { 24172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break; 24182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(SDValue(Res, i)); 24192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else { 24223ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(), 24233ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner EmitNodeInfo); 24242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the node had chain/flag results, update our notion of the current 24272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chain and flag. 242882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) { 24292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = SDValue(Res, VTs.size()-1); 24302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 24312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-2); 24322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (EmitNodeInfo & OPFL_Chain) 24332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-1); 24342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the OPFL_MemRefs flag is set on this node, slap all of the 24362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // accumulated memrefs onto it. 24372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // 24382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: This is vastly incorrect for patterns with multiple outputs 24392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // instructions that access memory and for ComplexPatterns that match 24402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // loads. 24412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_MemRefs) { 24422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MachineSDNode::mmo_iterator MemRefs = 24432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MF->allocateMemRefsArray(MatchedMemRefs.size()); 24442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs); 24452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner cast<MachineSDNode>(Res) 24462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size()); 24472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << " " 24502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created") 24512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << " node: "; Res->dump(CurDAG); errs() << "\n"); 24522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this was a MorphNodeTo then we're completely done! 24542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode == OPC_MorphNodeTo) { 24552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 24562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 245782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, true); 245882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner return Res; 24592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MarkFlagResults: { 24652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumNodes = MatcherTable[MatcherIndex++]; 24662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read and remember all the flag-result nodes. 24682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumNodes; ++i) { 24692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 24702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 24712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 24722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 24742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 24752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CompleteMatch: { 24802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // The match has been completed, and any new nodes (if any) have been 24812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created. Patch up references to the matched dag to use the newly 24822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created nodes. 24832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumResults = MatcherTable[MatcherIndex++]; 24842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumResults; ++i) { 24862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ResSlot = MatcherTable[MatcherIndex++]; 24872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ResSlot & 128) 24882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex); 24892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame"); 24912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Res = RecordedNodes[ResSlot]; 24922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2493b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner assert(i < NodeToMatch->getNumValues() && 2494b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Other && 2495b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Flag && 2496b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner "Invalid number of results to complete!"); 24972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert((NodeToMatch->getValueType(i) == Res.getValueType() || 24982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i) == MVT::iPTR || 24992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType() == MVT::iPTR || 25002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i).getSizeInBits() == 25012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType().getSizeInBits()) && 25022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "invalid replacement"); 25032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res); 25042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the root node defines a flag, add it to the flag nodes to update 25072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // list. 25082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Flag) 25092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(NodeToMatch); 25102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 25122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 251382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, false); 25142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->use_empty() && 25162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Didn't replace all uses of the node?"); 25172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: We just return here, which interacts correctly with SelectRoot 25192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // above. We should fix this to not return an SDNode* anymore. 25202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 25212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the code reached this point, then the match failed. See if there is 25252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // another child to try in the current 'Scope', otherwise pop it until we 25262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // find a case to check. 252719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n"); 2528bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 25292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 25302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (MatchScopes.empty()) { 25312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CannotYetSelect(NodeToMatch); 25322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 25332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Restore the interpreter state back to the point where the scope was 25362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // formed. 25372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope &LastScope = MatchScopes.back(); 25382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.resize(LastScope.NumRecordedNodes); 25392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.clear(); 25402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end()); 25412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 25422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size()) 25442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.resize(LastScope.NumMatchedMemRefs); 25452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatcherIndex = LastScope.FailIndex; 25462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 254719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Continuing at " << MatcherIndex << "\n"); 254819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman 25492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = LastScope.InputChain; 25502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = LastScope.InputFlag; 25512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasChainNodesMatched) 25522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 25532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasFlagResultNodesMatched) 25542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.clear(); 25552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see what the offset is at the new MatcherIndex. If it is zero 25572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we have reached the end of this scope, otherwise we have another child 25582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // in the current scope to try. 25592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 25602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip & 128) 25612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 25622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If we have another child in this scope to match, update FailIndex and 25642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // try it. 25652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip != 0) { 25662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner LastScope.FailIndex = MatcherIndex+NumToSkip; 25672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 25682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // End of this scope, pop it and try the next child in the containing 25712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // scope. 25722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.pop_back(); 25732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 25762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2579eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelect(SDNode *N) { 2580e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::string msg; 2581e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman raw_string_ostream Msg(msg); 2582e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman Msg << "Cannot yet select: "; 25832c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner 25842c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN && 25852c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_WO_CHAIN && 25862c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_VOID) { 25872c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->printrFull(Msg, CurDAG); 25882c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } else { 25892c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other; 25902c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner unsigned iid = 25912c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue(); 25922c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (iid < Intrinsic::num_intrinsics) 25932c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid); 25942c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo()) 25952c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "target intrinsic %" << TII->getName(iid); 25962c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else 25972c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "unknown intrinsic #" << iid; 25982c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } 259975361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error(Msg.str()); 2600e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 2601e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 26021997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 2603