SelectionDAGISel.cpp revision 211ffa13519cadfb7f9baf4c8447fa055bf38fe8
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" 31b92187a4103dca24c3767c380f63593d1f6161a7Bill Wendling#include "llvm/CodeGen/MachineFrameInfo.h" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 36fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman#include "llvm/CodeGen/ScheduleHazardRecognizer.h" 37eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 396f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 40e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman#include "llvm/Target/TargetIntrinsicInfo.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 44124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 45a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 46db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 477d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin#include "llvm/Support/ErrorHandling.h" 48db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 49ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar#include "llvm/Support/raw_ostream.h" 50c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner#include "llvm/ADT/Statistic.h" 517e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 54c19ae9d91d30bc008e0be5f5d4727f333199f64cChris LattnerSTATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on"); 55bed993d8a4ede75a24a142437057b42498ce5b9fChris LattnerSTATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path"); 56c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner 57ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 58293d5f8bc02a9148238b2c79484637f56de65b9cDan GohmanEnableFastISelVerbose("fast-isel-verbose", cl::Hidden, 59d659d50482e2f9edf8f436e4a1aa30c68c6d020bDan Gohman cl::desc("Enable verbose messages in the \"fast\" " 60293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohman "instruction selector")); 61293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohmanstatic cl::opt<bool> 624344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan GohmanEnableFastISelAbort("fast-isel-abort", cl::Hidden, 634344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman cl::desc("Enable abort calls when \"fast\" instruction fails")); 64ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 65da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 667944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 67462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 68462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 69462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 70462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 71462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 72462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 73462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 74462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 75462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 76462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 77462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 78462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 79462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 80462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 8125cf2275ff7de3de3bc0e508abaf457413d74725Duncan SandsViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden, 8225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands cl::desc("Pop up a window to show dags before the post legalize types" 8325cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands " dag combine pass")); 8425cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sandsstatic cl::opt<bool> 85a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 86a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 87a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 88a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 89a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 903e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 913e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 925bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 937944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 94462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 95462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 96462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 9725cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombineLT = false, 98462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 99462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 1007944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 1017944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 102eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 103eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 104eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 105eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 106eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 107eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 108eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 109eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 110eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 111eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 112eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 113eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 114844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 115844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 116844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 117844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 118844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 119844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 12013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 121844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 122b8cab9227a0f6ffbdaae33e3c64268e265008a6aDan GohmandefaultListDAGScheduler("default", "Best scheduler for the target", 123844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1244ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 125f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohmannamespace llvm { 126f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman //===--------------------------------------------------------------------===// 127f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// createDefaultScheduler - This creates an instruction scheduler appropriate 128f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// for the target. 12947ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS, 13098a366d547772010e94609e4584489b3e5ce0043Bill Wendling CodeGenOpt::Level OptLevel) { 131e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman const TargetLowering &TLI = IS->getTargetLowering(); 132e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman 13398a366d547772010e94609e4584489b3e5ce0043Bill Wendling if (OptLevel == CodeGenOpt::None) 134be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createFastDAGScheduler(IS, OptLevel); 135211ffa13519cadfb7f9baf4c8447fa055bf38fe8Evan Cheng if (TLI.getSchedulingPreference() == Sched::Latency) 136be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createTDListDAGScheduler(IS, OptLevel); 137211ffa13519cadfb7f9baf4c8447fa055bf38fe8Evan Cheng assert(TLI.getSchedulingPreference() == Sched::RegPressure && 138211ffa13519cadfb7f9baf4c8447fa055bf38fe8Evan Cheng "Unknown sched type!"); 139be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createBURRListDAGScheduler(IS, OptLevel); 1403a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 1411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 143ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 144533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// that mark instructions with the 'usesCustomInserter' flag. These 145025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 146025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 147533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// basic blocks, and this method is called to expand it into a sequence of 148533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// instructions, potentially also creating new basic blocks and control flow. 149533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// When new basic blocks are inserted and the edges from MBB to its successors 150533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// are modified, the method should insert pairs of <OldSucc, NewSucc> into the 151533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// DenseMap. 152af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanMachineBasicBlock * 153af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanTargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 154af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman MachineBasicBlock *MBB) const { 155f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#ifndef NDEBUG 1561a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "If a target marks an instruction with " 157533297b58da8c74bec65551e1aface9801fc2259Dan Gohman "'usesCustomInserter', it must implement " 158f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "TargetLowering::EmitInstrWithCustomInserter!"; 159f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#endif 160c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable(0); 161a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar return 0; 162025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 163025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 1647041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 1657041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 1667041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 1671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 168f0757b0edc1ef3d1998485d3f74cadaa3f7180a0Dan GohmanSelectionDAGISel::SelectionDAGISel(const TargetMachine &tm, CodeGenOpt::Level OL) : 169ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()), 1707c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 17150d2b1ac029d63500ea9b9347561b1454fa6ed6aDan Gohman CurDAG(new SelectionDAG(tm, *FuncInfo)), 17255e59c186303ff02c0be7429da3b1b36c347f164Dan Gohman SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)), 1737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 174be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling OptLevel(OL), 1757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DAGSize(0) 1767c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman{} 1777c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 1787c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 1792048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman delete SDB; 1807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 1817c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 1827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 1837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 184495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 185c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 186a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<AliasAnalysis>(); 1875eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 188a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<GCModuleInfo>(); 189ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass::getAnalysisUsage(AU); 190495a0b51915eb763576874f29192820b731edc22Chris Lattner} 1911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 192ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohmanbool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) { 1934344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman // Do some sanity-checking on the command-line options. 1944344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelVerbose || EnableFastISel) && 1954344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-verbose requires -fast-isel"); 1964344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelAbort || EnableFastISel) && 1974344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-abort requires -fast-isel"); 1984344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman 199ae541aad5c36cb3e4256514447d1f81e253079c7Dan Gohman const Function &Fn = *mf.getFunction(); 2008a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII = *TM.getInstrInfo(); 2018a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI = *TM.getRegisterInfo(); 2028a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 203c0fb65da040668df543db514f05e4be571edf700Dan Gohman MF = &mf; 20479ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman RegInfo = &MF->getRegInfo(); 205c0fb65da040668df543db514f05e4be571edf700Dan Gohman AA = &getAnalysis<AliasAnalysis>(); 206c0fb65da040668df543db514f05e4be571edf700Dan Gohman GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0; 207c0fb65da040668df543db514f05e4be571edf700Dan Gohman 2081a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n"); 2091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 210de6e783b2490447866b592cd39855e6f4d25efffChris Lattner CurDAG->init(*MF); 2116277eb2bb997a5da0808a8a5a57f18fd9faaf336Dan Gohman FuncInfo->set(Fn, *MF, EnableFastISel); 2122048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->init(GFI, *AA); 2131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2146a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman SelectAllBasicBlocks(Fn); 215edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2161b79a2ff547a5ead0eef933bb02f51b3a2f4cc1cDan Gohman // If the first basic block in the function has live ins that need to be 2178a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 2188a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 2192ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock *EntryMBB = MF->begin(); 2202ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII); 2212ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 2222ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Insert DBG_VALUE instructions for function arguments to the entry block. 2232ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) { 2242ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1]; 2252ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng unsigned Reg = MI->getOperand(0).getReg(); 2262ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng if (TargetRegisterInfo::isPhysicalRegister(Reg)) 2272ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng EntryMBB->insert(EntryMBB->begin(), MI); 2282ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng else { 2292ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *Def = RegInfo->getVRegDef(Reg); 2302ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock::iterator InsertPos = Def; 231f1ced259b5617e9c15fcafd47e090c22e2702062Evan Cheng // FIXME: VR def may not be in entry block. 232f1ced259b5617e9c15fcafd47e090c22e2702062Evan Cheng Def->getParent()->insert(llvm::next(InsertPos), MI); 2332ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 2342ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 2352ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 23653f7602b61157ed56ccbf91379c188c55235f619Bill Wendling // Determine if there are any calls in this machine function. 23753f7602b61157ed56ccbf91379c188c55235f619Bill Wendling MachineFrameInfo *MFI = MF->getFrameInfo(); 23853f7602b61157ed56ccbf91379c188c55235f619Bill Wendling if (!MFI->hasCalls()) { 23953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling for (MachineFunction::const_iterator 24053f7602b61157ed56ccbf91379c188c55235f619Bill Wendling I = MF->begin(), E = MF->end(); I != E; ++I) { 24153f7602b61157ed56ccbf91379c188c55235f619Bill Wendling const MachineBasicBlock *MBB = I; 24253f7602b61157ed56ccbf91379c188c55235f619Bill Wendling for (MachineBasicBlock::const_iterator 24353f7602b61157ed56ccbf91379c188c55235f619Bill Wendling II = MBB->begin(), IE = MBB->end(); II != IE; ++II) { 24453f7602b61157ed56ccbf91379c188c55235f619Bill Wendling const TargetInstrDesc &TID = TM.getInstrInfo()->get(II->getOpcode()); 24553f7602b61157ed56ccbf91379c188c55235f619Bill Wendling if (II->isInlineAsm() || (TID.isCall() && !TID.isReturn())) { 24653f7602b61157ed56ccbf91379c188c55235f619Bill Wendling MFI->setHasCalls(true); 24753f7602b61157ed56ccbf91379c188c55235f619Bill Wendling goto done; 24853f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 24953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 25053f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 25153f7602b61157ed56ccbf91379c188c55235f619Bill Wendling done:; 25253f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 25353f7602b61157ed56ccbf91379c188c55235f619Bill Wendling 2542ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Release function-specific state. SDB and CurDAG are already cleared 2552ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // at this point. 2562ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng FuncInfo->clear(); 2578a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 261a9a3321938aac13477bdc53af0018bce88b45d78Dan GohmanMachineBasicBlock * 262a9a3321938aac13477bdc53af0018bce88b45d78Dan GohmanSelectionDAGISel::SelectBasicBlock(MachineBasicBlock *BB, 263a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman const BasicBlock *LLVMBB, 264a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BasicBlock::const_iterator Begin, 265a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BasicBlock::const_iterator End, 266a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman bool &HadTailCall) { 26798ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 268f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // as a tail call, cease emitting nodes for this block. Terminators 269f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // are handled below. 270c105a2b5b7d8969e78bd4b203e980dced8a1c689Dan Gohman for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I) 271f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman SDB->visit(*I); 272f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 273a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 2742048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 2752048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman HadTailCall = SDB->HasTailCall; 2762048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 27795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 27895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Final step, emit the lowered DAG as machine code. 27995140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman return CodeGenAndEmitDAG(BB); 2801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengnamespace { 28354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted 28454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// nodes from the worklist. 28554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengclass SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener { 28654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng SmallVector<SDNode*, 128> &Worklist; 28725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &InWorklist; 28854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengpublic: 28925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl, 29025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &inwl) 29125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner : Worklist(wl), InWorklist(inwl) {} 29225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 29325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner void RemoveFromWorklist(SDNode *N) { 29425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!InWorklist.erase(N)) return; 29525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 29625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallVector<SDNode*, 128>::iterator I = 29725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner std::find(Worklist.begin(), Worklist.end(), N); 29825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(I != Worklist.end() && "Not in worklist"); 29925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 30025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner *I = Worklist.back(); 30125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.pop_back(); 30225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 30325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 30454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeDeleted(SDNode *N, SDNode *E) { 30525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner RemoveFromWorklist(N); 30654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 30754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 30854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeUpdated(SDNode *N) { 30954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng // Ignore updates. 31054e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 31154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng}; 31254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng} 31354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 314046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng/// TrivialTruncElim - Eliminate some trivial nops that can result from 315046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng/// ShrinkDemandedOps: (trunc (ext n)) -> n. 316046632f272b22a653c204c0ef56eb4076368d4bbEvan Chengstatic bool TrivialTruncElim(SDValue Op, 317046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng TargetLowering::TargetLoweringOpt &TLO) { 318046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng SDValue N0 = Op.getOperand(0); 319046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng EVT VT = Op.getValueType(); 320046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng if ((N0.getOpcode() == ISD::ZERO_EXTEND || 321046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOpcode() == ISD::SIGN_EXTEND || 322046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOpcode() == ISD::ANY_EXTEND) && 323046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOperand(0).getValueType() == VT) { 324046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng return TLO.CombineTo(Op, N0.getOperand(0)); 325046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng } 326046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng return false; 327046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng} 328046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng 32954eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// ShrinkDemandedOps - A late transformation pass that shrink expressions 33054eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// using TargetLowering::TargetLoweringOpt::ShrinkDemandedOp. It converts 33154eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// x+y to (VT)((SmallVT)x+(SmallVT)y) if the casts are free. 332d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Chengvoid SelectionDAGISel::ShrinkDemandedOps() { 333d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng SmallVector<SDNode*, 128> Worklist; 33425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> InWorklist; 335d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 336d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Add all the dag nodes to the worklist. 337d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.reserve(CurDAG->allnodes_size()); 338d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(), 33925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner E = CurDAG->allnodes_end(); I != E; ++I) { 340d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.push_back(I); 34125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(I); 34225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 343d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 344e5b51ac7708402473f0a558f4aac74fab63d4f7eEvan Cheng TargetLowering::TargetLoweringOpt TLO(*CurDAG, true, true, true); 345d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng while (!Worklist.empty()) { 3467b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 34725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.erase(N); 348d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 349d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (N->use_empty() && N != CurDAG->getRoot().getNode()) { 350c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner // Deleting this node may make its operands dead, add them to the worklist 351c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner // if they aren't already there. 352c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 353c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner if (InWorklist.insert(N->getOperand(i).getNode())) 354c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner Worklist.push_back(N->getOperand(i).getNode()); 355c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner 35654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng CurDAG->DeleteNode(N); 357d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng continue; 358d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 359d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 360d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Run ShrinkDemandedOp on scalar binary operations. 36125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (N->getNumValues() != 1 || 36225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner !N->getValueType(0).isSimple() || !N->getValueType(0).isInteger()) 36325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner continue; 36425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 36525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner unsigned BitWidth = N->getValueType(0).getScalarType().getSizeInBits(); 36625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner APInt Demanded = APInt::getAllOnesValue(BitWidth); 36725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner APInt KnownZero, KnownOne; 36825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!TLI.SimplifyDemandedBits(SDValue(N, 0), Demanded, 36925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner KnownZero, KnownOne, TLO) && 37025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner (N->getOpcode() != ISD::TRUNCATE || 37125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner !TrivialTruncElim(SDValue(N, 0), TLO))) 37225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner continue; 37325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 37425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Revisit the node. 37525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(!InWorklist.count(N) && "Already in worklist"); 37625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(N); 37725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(N); 37825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 37925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Replace the old value with the new one. 38025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DEBUG(errs() << "\nShrinkDemandedOps replacing "; 38125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner TLO.Old.getNode()->dump(CurDAG); 38225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner errs() << "\nWith: "; 38325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner TLO.New.getNode()->dump(CurDAG); 38425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner errs() << '\n'); 38525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 38625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (InWorklist.insert(TLO.New.getNode())) 38725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(TLO.New.getNode()); 38825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 38925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover DeadNodes(Worklist, InWorklist); 39025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner CurDAG->ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, &DeadNodes); 39125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 39225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!TLO.Old.getNode()->use_empty()) continue; 39325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 39425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner for (unsigned i = 0, e = TLO.Old.getNode()->getNumOperands(); 39525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner i != e; ++i) { 39625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDNode *OpNode = TLO.Old.getNode()->getOperand(i).getNode(); 39725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (OpNode->hasOneUse()) { 39825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Add OpNode to the end of the list to revisit. 39925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DeadNodes.RemoveFromWorklist(OpNode); 40025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(OpNode); 40125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(OpNode); 402d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 403d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 40425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 40525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DeadNodes.RemoveFromWorklist(TLO.Old.getNode()); 40625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner CurDAG->DeleteNode(TLO.Old.getNode()); 407d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 408d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng} 409d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 410f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 411ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 412ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 413a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 414ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 415a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 416ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 417ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 418ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 419a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4207b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer do { 4217b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 422a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 423ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 424ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 425ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 426a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 427ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 428ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 429825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 430ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 431a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 432ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 433ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 434ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 435a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 436ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 437ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 438ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 439a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 440ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 441475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 442e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 443ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 444ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 445a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 446f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 447ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 448f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 449a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 450ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 451ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 452ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 453f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (DestReg >= FuncInfo->LiveOutRegInfo.size()) 454f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo.resize(DestReg+1); 455f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FunctionLoweringInfo::LiveOutInfo &LOI = 456f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo[DestReg]; 457ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 458a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownOne = KnownOne; 459a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownZero = KnownZero; 460ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 4617b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer } while (!Worklist.empty()); 462ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 463ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 464a9a3321938aac13477bdc53af0018bce88b45d78Dan GohmanMachineBasicBlock *SelectionDAGISel::CodeGenAndEmitDAG(MachineBasicBlock *BB) { 465462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 466462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 467462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 468462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 469462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 47025cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 47125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 472f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman BlockName = MF->getFunction()->getNameStr() + ":" + 473f6ccee5a9d2b9573f679bca6266ade3eb8cd3f88Daniel Dunbar BB->getBasicBlock()->getNameStr(); 474462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 4751a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Initial selection DAG:\n"); 476f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 477462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 478f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 479417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 480af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 481ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 4825e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 483be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 484ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 485be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 486ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 487a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4881a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized lowered selection DAG:\n"); 489f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 490a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 4921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 493714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 494714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman BlockName); 495714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 496714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman bool Changed; 497714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 498714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 499714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 500714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 501714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 502714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 503714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 5041a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Type-legalized selection DAG:\n"); 505714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 506462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 507714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 508714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 509714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 510714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 511714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 512462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 513714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize types", GroupName); 514714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 515462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 516714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 517462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 518462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5191a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n"); 520f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 521714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 522462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 523714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 524714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Vector Legalization", GroupName); 525714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 526714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 527714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 528714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 5295c22c8074404797f1313b1334757254fb5c6487aEli Friedman 530714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 5315c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (TimePassesIsEnabled) { 532714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization 2", GroupName); 5339882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 5345c22c8074404797f1313b1334757254fb5c6487aEli Friedman } else { 5359882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 5365c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 5375c22c8074404797f1313b1334757254fb5c6487aEli Friedman 538714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 539714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 5405c22c8074404797f1313b1334757254fb5c6487aEli Friedman 541714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 542714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 543714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName); 544714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 545714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 546714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 5475c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 548714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 5491a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n"); 550714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 55170587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 552a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 553f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 554462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 555ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5565e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 557714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 558ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 559714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 560ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 561a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5621a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Legalized selection DAG:\n"); 563f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 564a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 565f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 566462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 567af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 568ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5695e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 570be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 571ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 572be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 573ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 574a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5751a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized legalized selection DAG:\n"); 576f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 577417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 578d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (OptLevel != CodeGenOpt::None) { 579d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng ShrinkDemandedOps(); 580f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 581d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 582552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 583552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 584552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner 585a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 586a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 587ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5885e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 5897c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 590ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5917c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 592ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 593db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5941a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Selected selection DAG:\n"); 595f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 596462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 597f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 598462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5995e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 60047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 6015e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 6025e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 60347ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 6045e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 60547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 6065e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6075e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 608462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 609462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 610a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 611db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 612ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 6135e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 614af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman BB = Scheduler->EmitSchedule(); 615ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 616af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman BB = Scheduler->EmitSchedule(); 6175e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6185e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 6195e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 6205e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 6215e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 6225e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 6235e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 6245e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 625ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 626db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 62795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Free the SelectionDAG state, now that we're finished with it. 62895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman CurDAG->clear(); 62995140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 630a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman return BB; 631a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 632f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 6337c306da505e2d7f64e160890b274a47fa0740962Chris Lattnervoid SelectionDAGISel::DoInstructionSelection() { 6347c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection begins:\n"); 6357c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6367c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PreprocessISelDAG(); 6377c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6387c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Select target instructions for the DAG. 6397c306da505e2d7f64e160890b274a47fa0740962Chris Lattner { 6407c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Number all nodes with a topological order and set DAGSize. 6417c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DAGSize = CurDAG->AssignTopologicalOrder(); 6427c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6437c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Create a dummy node (which is not added to allnodes), that adds 6447c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // a reference to the root node, preventing it from being deleted, 6457c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // and tracking any changes of the root. 6467c306da505e2d7f64e160890b274a47fa0740962Chris Lattner HandleSDNode Dummy(CurDAG->getRoot()); 6477c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode()); 6487c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ++ISelPosition; 6497c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6507c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // The AllNodes list is now topological-sorted. Visit the 6517c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // nodes by starting at the end of the list (the root of the 6527c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // graph) and preceding back toward the beginning (the entry 6537c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // node). 6547c306da505e2d7f64e160890b274a47fa0740962Chris Lattner while (ISelPosition != CurDAG->allnodes_begin()) { 6557c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *Node = --ISelPosition; 6567c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes, 6577c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // but there are currently some corner cases that it misses. Also, this 6587c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // makes it theoretically possible to disable the DAGCombiner. 6597c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) 6607c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 6617c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6627c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *ResNode = Select(Node); 6637c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 66482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // FIXME: This is pretty gross. 'Select' should be changed to not return 66582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // anything at all and this code should be nuked with a tactical strike. 66682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 6677c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If node should not be replaced, continue with the next one. 66882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE) 6697c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 6707c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Replace node. 6717c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (ResNode) 6727c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ReplaceUses(Node, ResNode); 6737c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6747c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If after the replacement this node is not used any more, 6757c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // remove this dead node. 6767c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) { // Don't delete EntryToken, etc. 6777c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelUpdater ISU(ISelPosition); 6787c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->RemoveDeadNode(Node, &ISU); 6797c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6807c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6817c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6827c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->setRoot(Dummy.getValue()); 6837c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 68453f7602b61157ed56ccbf91379c188c55235f619Bill Wendling 6857c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection ends:\n"); 6867c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6877c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PostprocessISelDAG(); 6887c306da505e2d7f64e160890b274a47fa0740962Chris Lattner} 6897c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6902520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and 6912520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// do other setup for EH landing-pad blocks. 6922520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohmanvoid SelectionDAGISel::PrepareEHLandingPad(MachineBasicBlock *BB) { 6932520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 6942520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 6952520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman MCSymbol *Label = MF->getMMI().addLandingPad(BB); 6962520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 69755e59c186303ff02c0be7429da3b1b36c347f164Dan Gohman const TargetInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL); 6982520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman BuildMI(BB, SDB->getCurDebugLoc(), II).addSym(Label); 6992520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7002520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception register as live in. 7012520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 7022520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Reg) BB->addLiveIn(Reg); 7032520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7042520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception selector register as live in. 7052520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 7062520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Reg) BB->addLiveIn(Reg); 7072520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7082520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 7092520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 7102520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // like, the basic block containing the invoke), and need to be associated 7112520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // with it in the dwarf exception handling tables. Currently however the 7122520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 7132520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 7142520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // then breaking it can result in the intrinsics being in the successor of 7152520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the landing pad, not the landing pad itself. This results 7162520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // in exceptions not being caught because no typeids are associated with 7172520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the invoke. This may not be the only way things can go wrong, but it 7182520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // is the only way we try to work around for the moment. 7192520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const BasicBlock *LLVMBB = BB->getBasicBlock(); 7202520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 7212520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7222520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 7232520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman BasicBlock::const_iterator I, E; 7242520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 7252520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (isa<EHSelectorInst>(I)) 7262520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman break; 7272520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7282520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (I == E) 7292520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // No catch info found - try to extract some from the successor. 7302520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo); 7312520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman } 7322520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman} 7337c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 73446510a73e977273ec67747eb34cbdb43f815e451Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) { 735a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 736a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 737a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISel) 7386a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman FastIS = TLI.createFastISel(*MF, FuncInfo->ValueMap, FuncInfo->MBBMap, 739f81eca0ab908fdcf98ae0efaa75acccc8ba40dc2Dan Gohman FuncInfo->StaticAllocaMap, 740f81eca0ab908fdcf98ae0efaa75acccc8ba40dc2Dan Gohman FuncInfo->PHINodesToUpdate 741dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#ifndef NDEBUG 742dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman , FuncInfo->CatchInfoLost 743dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#endif 744dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman ); 745a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 746a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 74746510a73e977273ec67747eb34cbdb43f815e451Dan Gohman for (Function::const_iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 74846510a73e977273ec67747eb34cbdb43f815e451Dan Gohman const BasicBlock *LLVMBB = &*I; 749a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman MachineBasicBlock *BB = FuncInfo->MBBMap[LLVMBB]; 750f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 751ba5be5c07bb19dcf484e3aa40cd139dd07c10407Dan Gohman BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI(); 75246510a73e977273ec67747eb34cbdb43f815e451Dan Gohman BasicBlock::const_iterator const End = LLVMBB->end(); 75346510a73e977273ec67747eb34cbdb43f815e451Dan Gohman BasicBlock::const_iterator BI = Begin; 7545edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 7555edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Lower any arguments needed in this block if this is the entry block. 756d725f04ff81db0e61baa153bf21ca2dd08838244Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) 7575edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman LowerArguments(LLVMBB); 758f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 7592520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Setup an EH landing-pad block. 7602520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (BB->isLandingPad()) 7612520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman PrepareEHLandingPad(BB); 7622520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 763f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 764d725f04ff81db0e61baa153bf21ca2dd08838244Dan Gohman if (FastIS) { 765a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Emit code for any incoming arguments. This must happen before 766a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // beginning FastISel on the entry block. 767a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 7682048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 7692048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 77095140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman BB = CodeGenAndEmitDAG(BB); 771a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 772241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->startNewBlock(BB); 773a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 774a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman for (; BI != End; ++BI) { 77521c14e3649b3e2a70ac36ebb148f17648f10a2a9Dan Gohman // Try to select the instruction with FastISel. 7768ba3aa7f9c5048c31172788f98ad2b90ffad565aDan Gohman if (FastIS->SelectInstruction(BI)) 777a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 778f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 779a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 780a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<CallInst>(BI)) { 781c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 782a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 7831a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel missed call: "; 784a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 785f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 786f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 78733b7a291aa1bd477bc09e3ef5fccb76249502a5eDan Gohman if (!BI->getType()->isVoidTy() && !BI->use_empty()) { 788a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman unsigned &R = FuncInfo->ValueMap[BI]; 789a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 790a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman R = FuncInfo->CreateRegForValue(BI); 791f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 792a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 793b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall = false; 794a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = SelectBasicBlock(BB, LLVMBB, BI, llvm::next(BI), HadTailCall); 795b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 796b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman // If the call was emitted as a tail call, we're done with the block. 797b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman if (HadTailCall) { 798b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman BI = End; 799b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman break; 800b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman } 801b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 802241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // If the instruction was codegen'd with multiple blocks, 803241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // inform the FastISel object where to resume inserting. 804241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->setCurrentBlock(BB); 805a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 806f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 807a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 808a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Otherwise, give up on FastISel for the rest of the block. 809a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For now, be a little lenient about non-branch terminators. 810a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!isa<TerminatorInst>(BI) || isa<BranchInst>(BI)) { 811c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 812a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 8131a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 814a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 815a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 816a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 817a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 818a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 819c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 820a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 821a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 822f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 823f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 824f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 825d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // Run SelectionDAG instruction selection on the remainder of the block 826d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // not handled by FastISel. If FastISel is not run, this is the entire 8273df24e667f04a7003342b534310919abc9c87418Dan Gohman // block. 828390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel if (BI != End) { 829b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall; 830a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BB = SelectBasicBlock(BB, LLVMBB, BI, End, HadTailCall); 831390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel } 832381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 833a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman FinishBasicBlock(BB); 834620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman FuncInfo->PHINodesToUpdate.clear(); 83539fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 836a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 837a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 8380e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 8390e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 840fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 841a9a3321938aac13477bdc53af0018bce88b45d78Dan GohmanSelectionDAGISel::FinishBasicBlock(MachineBasicBlock *BB) { 8421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8431a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Total amount of phi nodes to update: " 844620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << FuncInfo->PHINodesToUpdate.size() << "\n"); 845620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman DEBUG(for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) 8461a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Node " << i << " : (" 847620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << FuncInfo->PHINodesToUpdate[i].first 848620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n"); 849a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 850a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 8511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 8522048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (SDB->SwitchCases.empty() && 8532048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.empty() && 8542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.empty()) { 855620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 856620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 857518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 858f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 859580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen if (!BB->isSuccessor(PHI->getParent())) 860580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen continue; 861620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 862620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 8639ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 864f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 865f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 8661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8682048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) { 8694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 8702048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->BitTestCases[i].Emitted) { 8714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 8722048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Parent; 8734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 87499be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitBitTestHeader(SDB->BitTestCases[i], BB); 8752048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 8762048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 87795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman BB = CodeGenAndEmitDAG(BB); 878a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 8794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8802048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) { 8814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 8822048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Cases[j].ThisBB; 8834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 8844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 8852048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB, 8862048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 88799be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 88899be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman BB); 8894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 8902048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Default, 8912048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 89299be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 89399be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman BB); 894a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 895a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 8962048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 8972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 89895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman BB = CodeGenAndEmitDAG(BB); 8994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 902620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 903620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 904620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 9054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 906518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 9074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 9084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 9094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 9102048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->BitTestCases[i].Default) { 911f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 912620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 913620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9142048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); 915f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 916620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 917620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9182048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases. 9199ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 9204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 9222048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); 9237c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 9242048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB; 925dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (cBB->isSuccessor(PHIBB)) { 926f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 927620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 928620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9299ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 9304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9342048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.clear(); 9354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9369453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 9379453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 9389453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 9392048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) { 9403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 9412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->JTCases[i].first.Emitted) { 9423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 9432048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].first.HeaderBB; 9443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 94599be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first, 94699be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman BB); 9472048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 9482048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 94995140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman BB = CodeGenAndEmitDAG(BB); 9504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 951a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 95237efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 9532048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].second.MBB; 95437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 9552048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTable(SDB->JTCases[i].second); 9562048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 9572048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 95895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman BB = CodeGenAndEmitDAG(BB); 959a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 96037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 961620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 962620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 963620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 96437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 965518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 96637efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 9674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 9682048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->JTCases[i].second.Default) { 969ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 970620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 971620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 972ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 9732048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB)); 974f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 9754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 976dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (BB->isSuccessor(PHIBB)) { 977ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 978620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 979620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9809ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 98137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 98237efe6764568a3829fee26aba532283131d1a104Nate Begeman } 98337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 9842048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.clear(); 985a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 986b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 987b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 988620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 989620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 990518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 991b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 992b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 993620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 994620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 9959ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 996b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 997b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 998a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 999f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 1000f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 10012048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) { 1002f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 10032048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock *ThisBB = BB = SDB->SwitchCases[i].ThisBB; 1004a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 100595140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Determine the unique successors. 100695140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman SmallVector<MachineBasicBlock *, 2> Succs; 100795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman Succs.push_back(SDB->SwitchCases[i].TrueBB); 100895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB) 100995140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman Succs.push_back(SDB->SwitchCases[i].FalseBB); 101095140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 101195140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Emit the code. Note that this could result in ThisBB being split, so 101295140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // we need to check for updates. 101399be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitSwitchCase(SDB->SwitchCases[i], BB); 10142048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 101595140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman SDB->clear(); 1016af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman ThisBB = CodeGenAndEmitDAG(BB); 1017a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1018d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 1019d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 1020d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1021d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 102295140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman for (unsigned i = 0, e = Succs.size(); i != e; ++i) { 102395140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman BB = Succs[i]; 1024dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // BB may have been removed from the CFG if a branch was constant folded. 1025dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (ThisBB->isSuccessor(BB)) { 1026dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (MachineBasicBlock::iterator Phi = BB->begin(); 1027518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner Phi != BB->end() && Phi->isPHI(); 1028dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen ++Phi) { 1029dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // This value for this PHI node is recorded in PHINodesToUpdate. 1030dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (unsigned pn = 0; ; ++pn) { 1031620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman assert(pn != FuncInfo->PHINodesToUpdate.size() && 1032dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen "Didn't find PHI entry!"); 1033620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman if (FuncInfo->PHINodesToUpdate[pn].first == Phi) { 1034dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand:: 1035620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pn].second, 1036dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen false)); 1037dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1038dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen break; 1039dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen } 10408be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1041d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1042f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1043f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1044a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 10452048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases.clear(); 10461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1047a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 104813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 10490a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 10500a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 10510a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 10525e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 105347ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1054eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1055a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 105613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1057eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 10589373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 10594ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1060a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1061be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1062a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 10630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1064fc54c552963545a81e4ea38e60460590afb2d5aeDan GohmanScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 1065fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman return new ScheduleHazardRecognizer(); 10669ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 10679ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 1068755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1069755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1070755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1071755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1072755480681c795d585c73556c028b6143c46bda86Chris Lattner 1073755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1074755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1075755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1076755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1077a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1078dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 10792e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 10802e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1081a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1082755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1083755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1084755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1085a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1086755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 10872e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1088755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1089a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1090755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1091755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 10922e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1093ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1094755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1095a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1096755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1097755480681c795d585c73556c028b6143c46bda86Chris Lattner 1098755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1099755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1100755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1101755480681c795d585c73556c028b6143c46bda86Chris Lattner 1102755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1103755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1104755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1105755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1106a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 11072e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 11082e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 11092e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1110a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1111755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1112755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1113755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1114a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1115755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 11162e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1117755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1118a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1119755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1120755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 11212e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1122a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11232e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 1124ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 1125a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1126755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1127755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1128755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1129a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1130755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1131a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1132755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1133755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1134755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1135755480681c795d585c73556c028b6143c46bda86Chris Lattner 11369ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 11370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 11380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 11390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1140f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1141475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 11420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 11430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1144decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0 1145decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1 1146decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc 11470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1148decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size(); 1149825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (InOps[e-1].getValueType() == MVT::Flag) 11500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 1151a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1153f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 1154decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (!InlineAsm::isMemKind(Flags)) { 11550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1156697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1157697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1158697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 11590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1160697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1161697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 11620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1163475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1164decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) 116575361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error("Could not match memory address. Inline asm" 116687d677c1856bfdcb91d9daeb69dc5f261c73851eChris Lattner " failure!"); 1167a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 1169decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned NewFlags = 1170decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size()); 1171decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32)); 11720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 11730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 11740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 11750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1176a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 11780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 11790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 11800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1181794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1182e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson/// findFlagUse - Return use of EVT::Flag value produced by the specified 1183c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1184c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1185c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic SDNode *findFlagUse(SDNode *N) { 1186c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1187c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1188c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1189c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1190c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1191c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1192c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1193c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1194c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1195c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1196c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1197c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1198c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1199d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, 1200d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) { 1201da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The NodeID's are given uniques ID's where a node ID is guaranteed to be 1202da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // greater than all of its (recursive) operands. If we scan to a point where 1203da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 'use' is smaller than the node we're scanning for, then we know we will 1204da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // never find it. 1205da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 1206da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The Use may be -1 (unassigned) if it is a newly allocated node. This can 1207da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // happen because we scan down to newly selected nodes in the case of flag 1208da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // uses. 1209da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1)) 1210da244a091dcde022ea4938793d81ee957903ed70Chris Lattner return false; 1211da244a091dcde022ea4938793d81ee957903ed70Chris Lattner 1212da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // Don't revisit nodes if we already scanned it and didn't fail, we know we 1213da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // won't fail if we scan it again. 1214da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if (!Visited.insert(Use)) 1215c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1216c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1217c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1218d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Ignore chain uses, they are validated by HandleMergeInputChains. 1219d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains) 1220d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1221d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1222c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1223c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1224c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1225c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1226c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1227c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1228c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1229c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1230c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1231d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains)) 1232c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1233c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1234c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1235c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1236c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1237014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsProfitableToFold - Returns true if it's profitable to fold the specific 1238014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// operand node N of U during instruction selection that starts at Root. 1239014bf215c3457bb34fee348265e8f63a70b4d503Evan Chengbool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U, 1240014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng SDNode *Root) const { 1241014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng if (OptLevel == CodeGenOpt::None) return false; 1242014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng return N.hasOneUse(); 1243014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng} 1244014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng 1245014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsLegalToFold - Returns true if the specific operand node N of 1246014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// U can be folded during instruction selection that starts at Root. 1247d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattnerbool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 1248d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman CodeGenOpt::Level OptLevel, 1249d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman bool IgnoreChains) { 1250c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1251c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1252c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1253c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1254c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1255c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1256c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1257c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1258c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1259c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1260c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1261c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1262c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1263c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1264c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1265c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1266c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1267c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1268c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root produces a flag, then it gets (even more) interesting. Since it 1269c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // will be "glued" together with its flag use in the scheduler, we need to 1270c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1271c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1272c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1273c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1274c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1275c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1276c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1277c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1278c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1279c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1280c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1281c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1282c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1283c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1284c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1285c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1286c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1287c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [FU] // 1288c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1289c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If FU (flag use) indirectly reaches N (the load), and Root folds N 1290c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // (call it Fold), then X is a predecessor of FU and a successor of 1291c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Fold. But since Fold and FU are flagged together, this will create 1292c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1293c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 12949bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // If the node has flags, walk down the graph to the "lowest" node in the 12959bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // flagged set. 1296e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1297825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (VT == MVT::Flag) { 1298c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *FU = findFlagUse(Root); 1299c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (FU == NULL) 1300c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1301c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov Root = FU; 1302c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 130318fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 130418fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // If our query node has a flag result with a use, we've walked up it. If 130518fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the user (which has already been selected) has a chain or indirectly uses 130618fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the chain, our WalkChainUsers predicate will not consider it. Because of 130718fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // this, we cannot ignore chains in this predicate. 130818fdabadca110671b436de52fe7bd492ad49e656Chris Lattner IgnoreChains = false; 1309c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 131018fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 1311c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 13129bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner SmallPtrSet<SDNode*, 16> Visited; 13139bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains); 1314c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1315c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1316eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) { 1317eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman std::vector<SDValue> Ops(N->op_begin(), N->op_end()); 1318e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SelectInlineAsmMemoryOperands(Ops); 1319e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1320e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::vector<EVT> VTs; 1321e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Other); 1322e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Flag); 1323eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(), 1324e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs, &Ops[0], Ops.size()); 1325d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner New->setNodeId(-1); 1326e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman return New.getNode(); 1327e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1328e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1329eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) { 1330518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0)); 1331e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1332e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 13332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// GetVBR - decode a vbr encoding whose top bit is set. 13342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerALWAYS_INLINE static uint64_t 13352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerGetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) { 13362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(Val >= 128 && "Not a VBR"); 13372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val &= 127; // Remove first vbr bit. 13382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned Shift = 7; 13402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner uint64_t NextBits; 13412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner do { 134214df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner NextBits = MatcherTable[Idx++]; 13432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val |= (NextBits&127) << Shift; 13442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Shift += 7; 13452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } while (NextBits & 128); 13462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return Val; 13482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 13492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// UpdateChainsAndFlags - When a match is complete, this method updates uses of 13522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// interior flag and chain results to use the new flag and chain results. 135382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattnervoid SelectionDAGISel:: 135482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris LattnerUpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain, 135582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &ChainNodesMatched, 135682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SDValue InputFlag, 135782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &FlagResultNodesMatched, 135882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner bool isMorphNodeTo) { 135982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SmallVector<SDNode*, 4> NowDeadNodes; 136082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 136182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner ISelUpdater ISU(ISelPosition); 136282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 13632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Now that all the normal results are replaced, we replace the chain and 13642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // flag results if present. 13652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!ChainNodesMatched.empty()) { 13662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() != 0 && 13672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Matched input chains but didn't produce a chain"); 13682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Loop over all of the nodes we matched that produced a chain result. 13692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Replace all the chain results with the final chain we ended up with. 13702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 13712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *ChainNode = ChainNodesMatched[i]; 13722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 137382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 137482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ChainNode->getOpcode() == ISD::DELETED_NODE) 137582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 137682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 13772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Don't replace the results of the root node if we're doing a 13782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MorphNodeTo. 13792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNode == NodeToMatch && isMorphNodeTo) 13802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 13812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); 13832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainVal.getValueType() == MVT::Flag) 13842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); 13852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainVal.getValueType() == MVT::Other && "Not a chain?"); 138682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU); 138782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 1388856fb395e46a8d485081acbf11928047d852c636Chris Lattner // If the node became dead and we haven't already seen it, delete it. 1389856fb395e46a8d485081acbf11928047d852c636Chris Lattner if (ChainNode->use_empty() && 1390856fb395e46a8d485081acbf11928047d852c636Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode)) 139182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(ChainNode); 13922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 13932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 13942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the result produces a flag, update any flag results in the matched 13962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern with the flag result. 13972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputFlag.getNode() != 0) { 13982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Handle any interior nodes explicitly marked. 13992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = FlagResultNodesMatched.size(); i != e; ++i) { 14002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *FRN = FlagResultNodesMatched[i]; 140182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 140282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 140382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (FRN->getOpcode() == ISD::DELETED_NODE) 140482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 140582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Flag && 14072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Doesn't have a flag result"); 14082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), 140982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, &ISU); 141082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 141119e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner // If the node became dead and we haven't already seen it, delete it. 141219e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner if (FRN->use_empty() && 141319e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN)) 141482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(FRN); 14152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 141882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (!NowDeadNodes.empty()) 141982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU); 142082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Match complete!\n"); 14222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 14232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1424c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerenum ChainResult { 1425c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_Simple, 1426c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_InducesCycle, 1427c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_LeadsToInteriorNode 1428c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner}; 1429c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1430c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// WalkChainUsers - Walk down the users of the specified chained node that is 1431c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// part of the pattern we're matching, looking at all of the users we find. 1432c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// This determines whether something is an interior node, whether we have a 1433c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// non-pattern node in between two pattern nodes (which prevent folding because 1434c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// it would induce a cycle) and whether we have a TokenFactor node sandwiched 1435c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// between pattern nodes (in which case the TF becomes part of the pattern). 1436c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// 1437c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// The walk we do here is guaranteed to be small because we quickly get down to 1438c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// already selected nodes "below" us. 1439c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerstatic ChainResult 1440c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerWalkChainUsers(SDNode *ChainedNode, 1441c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &ChainedNodesInPattern, 1442c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &InteriorChainedNodes) { 1443c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainResult Result = CR_Simple; 1444c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1445c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (SDNode::use_iterator UI = ChainedNode->use_begin(), 1446c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner E = ChainedNode->use_end(); UI != E; ++UI) { 1447c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Make sure the use is of the chain, not some other value we produce. 1448c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (UI.getUse().getValueType() != MVT::Other) continue; 1449c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1450c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *User = *UI; 1451c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1452c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we see an already-selected machine node, then we've gone beyond the 1453c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that we're selecting down into the already selected chunk of the 1454c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // DAG. 1455c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->isMachineOpcode() || 1456c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner User->getOpcode() == ISD::HANDLENODE) // Root of the graph. 1457c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1458d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1459d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getOpcode() == ISD::CopyToReg || 1460d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner User->getOpcode() == ISD::CopyFromReg || 14617561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::INLINEASM || 14627561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::EH_LABEL) { 1463d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // If their node ID got reset to -1 then they've already been selected. 1464d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Treat them like a MachineOpcode. 1465d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getNodeId() == -1) 1466d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1467d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner } 1468c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1469c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a TokenFactor, we handle it specially. 1470c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->getOpcode() != ISD::TokenFactor) { 1471c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the node isn't a token factor and isn't part of our pattern, then it 1472c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // must be a random chained node in between two nodes we're selecting. 1473c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This happens when we have something like: 1474c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1475c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // call 1476c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1477c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1478c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Because we structurally match the load/store as a read/modify/write, 1479c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // but the call is chained between them. We cannot fold in this case 1480c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // because it would induce a cycle in the graph. 1481c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainedNodesInPattern.begin(), 1482c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.end(), User)) 1483c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1484c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1485c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise we found a node that is part of our pattern. For example in: 1486c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1487c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1488c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1489c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This would happen when we're scanning down from the load and see the 1490c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store as a user. Record that there is a use of ChainedNode that is 1491c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // part of the pattern and keep scanning uses. 1492c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1493c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1494c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1495c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1496c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1497c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we found a TokenFactor, there are two cases to consider: first if the 1498c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // TokenFactor is just hanging "below" the pattern we're matching (i.e. no 1499c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses of the TF are in our pattern) we just want to ignore it. Second, 1500c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the TokenFactor can be sandwiched in between two chained nodes, like so: 1501c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load chain] 1502c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ 1503c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | 1504c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load] 1505c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1506c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | \ DAG's like cheese 1507c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / \ do you? 1508c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / | 1509c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [TokenFactor] [Op] 1510c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1511c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | | 1512c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1513c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1514c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Store] 1515c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1516c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // In this case, the TokenFactor becomes part of our match and we rewrite it 1517c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // as a new TokenFactor. 1518c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1519c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // To distinguish these two cases, do a recursive walk down the uses. 1520c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) { 1521c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_Simple: 1522c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor are just already-selected nodes, ignore 1523c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // it, it is "below" our pattern. 1524c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1525c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_InducesCycle: 1526c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor lead to nodes that are not part of our 1527c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that are not selected, folding would turn this into a cycle, 1528c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // bail out now. 1529c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1530c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_LeadsToInteriorNode: 1531c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner break; // Otherwise, keep processing. 1532c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1533c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1534c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we know we're in the interesting interior case. The TokenFactor 1535c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // is now going to be considered part of the pattern so that we rewrite its 1536c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses (it may have uses that are not part of the pattern) with the 1537c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ultimate chain result of the generated code. We will also add its chain 1538c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // inputs as inputs to the ultimate TokenFactor we create. 1539c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1540c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.push_back(User); 1541c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1542c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1543c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1544c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1545c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return Result; 1546c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner} 1547c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 15486b30792d2d7d142b8192241e6232aee004f745fbChris Lattner/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains 154900592ec857b4c3f31b46412e2738924238c59983Chris Lattner/// operation for when the pattern matched at least one node with a chains. The 1550c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// input vector contains a list of all of the chained nodes that we match. We 1551c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// must determine if this is a valid thing to cover (i.e. matching it won't 1552c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will 1553c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// be used as the input node chain for the generated nodes. 15546b30792d2d7d142b8192241e6232aee004f745fbChris Lattnerstatic SDValue 1555c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerHandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched, 15566b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SelectionDAG *CurDAG) { 1557c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Walk all of the chained nodes we've matched, recursively scanning down the 1558c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // users of the chain result. This adds any TokenFactor nodes that are caught 1559c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // in between chained nodes to the chained and interior nodes list. 1560c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVector<SDNode*, 3> InteriorChainedNodes; 1561c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1562c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched, 1563c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes) == CR_InducesCycle) 1564c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return SDValue(); // Would induce a cycle. 1565c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 15666b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 1567c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we have walked all the matched nodes and collected TokenFactor nodes 1568c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that we are interested in. Form our input TokenFactor node. 15696b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SmallVector<SDValue, 3> InputChains; 15706b30792d2d7d142b8192241e6232aee004f745fbChris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1571c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Add the input chain of this node to the InputChains list (which will be 1572c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the operands of the generated TokenFactor) if it's not an interior node. 1573c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *N = ChainNodesMatched[i]; 1574c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (N->getOpcode() != ISD::TokenFactor) { 1575c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N)) 1576c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1577c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1578c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise, add the input chain. 1579c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDValue InChain = ChainNodesMatched[i]->getOperand(0); 1580c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner assert(InChain.getValueType() == MVT::Other && "Not a chain"); 15816b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChains.push_back(InChain); 1582c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1583c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1584c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1585c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a token factor, we want to add all inputs of the token factor 1586c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that are not part of the pattern we're matching. 1587c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) { 1588c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(), 15896183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner N->getOperand(op).getNode())) 15906183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner InputChains.push_back(N->getOperand(op)); 1591c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 15926b30792d2d7d142b8192241e6232aee004f745fbChris Lattner } 15936b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 15946b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SDValue Res; 15956b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChains.size() == 1) 15966b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return InputChains[0]; 15976b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(), 15986b30792d2d7d142b8192241e6232aee004f745fbChris Lattner MVT::Other, &InputChains[0], InputChains.size()); 15996b30792d2d7d142b8192241e6232aee004f745fbChris Lattner} 16002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 16013ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner/// MorphNode - Handle morphing a node in place for the selector. 16023ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerSDNode *SelectionDAGISel:: 16033ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerMorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList, 16043ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) { 16053ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // It is possible we're using MorphNodeTo to replace a node with no 16063ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // normal results with one that has a normal result (or we could be 16073ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // adding a chain) and the input could have flags and chains as well. 1608caa8870fe09f5526e611434b6bb9f7040c7dfa60Chris Lattner // In this case we need to shift the operands down. 16093ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // FIXME: This is a horrible hack and broken in obscure cases, no worse 1610a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner // than the old isel though. 16113ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner int OldFlagResultNo = -1, OldChainResultNo = -1; 16123ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16133ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned NTMNumResults = Node->getNumValues(); 16143ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Node->getValueType(NTMNumResults-1) == MVT::Flag) { 16153ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldFlagResultNo = NTMNumResults-1; 16163ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (NTMNumResults != 1 && 16173ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Node->getValueType(NTMNumResults-2) == MVT::Other) 16183ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-2; 16193ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } else if (Node->getValueType(NTMNumResults-1) == MVT::Other) 16203ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-1; 16213ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 162261c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // Call the underlying SelectionDAG routine to do the transmogrification. Note 162361c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // that this deletes operands of the old node that become dead. 16243ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps); 16253ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16263ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // MorphNodeTo can operate in two ways: if an existing node with the 16273ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // specified operands exists, it can just return it. Otherwise, it 16283ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // updates the node in place to have the requested operands. 16293ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res == Node) { 16303ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // If we updated the node in place, reset the node ID. To the isel, 16313ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // this should be just like a newly allocated machine node. 16323ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res->setNodeId(-1); 16333ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } 16343ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16353ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned ResNumResults = Res->getNumValues(); 16363ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the flag if needed. 16373ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) && OldFlagResultNo != -1 && 16383ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldFlagResultNo != ResNumResults-1) 16393ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldFlagResultNo), 16403ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 16413ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16423ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) != 0) 16433ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner --ResNumResults; 16443ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16453ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the chain reference if needed. 16463ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 && 16473ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldChainResultNo != ResNumResults-1) 16483ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo), 16493ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 16503ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16513ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Otherwise, no replacement happened because the node already exists. Replace 16523ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Uses of the old node with the new one. 16533ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res != Node) 16543ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesWith(Node, Res); 16553ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16563ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner return Res; 16573ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner} 16583ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 1659f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1660f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1661da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1662da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const SmallVectorImpl<SDValue> &RecordedNodes) { 1663da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Accept if it is exactly the same as a previously recorded node. 1664da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 1665da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 1666da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return N == RecordedNodes[RecNo]; 1667da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1668da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1669da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1670da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1671f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1672f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel) { 1673f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]); 1674f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1675f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1676f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckNodePredicate - Implements OP_CheckNodePredicate. 1677f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1678f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1679f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel, SDNode *N) { 1680f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]); 1681f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1682f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1683f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1684f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1685f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDNode *N) { 1686d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 1687d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 1688d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner return N->getOpcode() == Opc; 1689f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1690f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1691f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1692f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1693f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N, const TargetLowering &TLI) { 1694f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1695f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (N.getValueType() == VT) return true; 1696f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1697f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Handle the case when VT is iPTR. 1698f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy(); 1699f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1700f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1701f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1702da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1703da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI, 1704da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned ChildNo) { 1705da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (ChildNo >= N.getNumOperands()) 1706da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return false; // Match fails if out of range child #. 1707da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI); 1708da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1709da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1710da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1711da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1712da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1713da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N) { 1714da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return cast<CondCodeSDNode>(N)->get() == 1715da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner (ISD::CondCode)MatcherTable[MatcherIndex++]; 1716da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1717da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1718da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1719da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1720da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI) { 1721da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1722da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (cast<VTSDNode>(N)->getVT() == VT) 1723da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return true; 1724da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1725da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Handle the case when VT is iPTR. 1726da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy(); 1727da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1728da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1729da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1730f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1731f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N) { 1732f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1733f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (Val & 128) 1734f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1735f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1736f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N); 1737f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return C != 0 && C->getSExtValue() == Val; 1738f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1739f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1740da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1741da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1742da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1743da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1744da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1745da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1746da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1747da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::AND) return false; 1748da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1749da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1750da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val); 1751da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1752da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1753da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1754da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1755da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1756da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1757da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1758da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1759da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1760da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::OR) return false; 1761da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1762da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1763da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val); 1764da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1765da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1766f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// IsPredicateKnownToFail - If we know how and can do so without pushing a 1767f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// scope, evaluate the current node. If the current predicate is known to 1768f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// fail, set Result=true and return anything. If the current predicate is 1769f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// known to pass, set Result=false and return the MatcherIndex to continue 1770f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// with. If the current predicate is unknown, set Result=false and return the 1771f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// MatcherIndex to continue with. 1772f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattnerstatic unsigned IsPredicateKnownToFail(const unsigned char *Table, 1773f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned Index, SDValue N, 1774da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner bool &Result, SelectionDAGISel &SDISel, 1775da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SmallVectorImpl<SDValue> &RecordedNodes){ 1776f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner switch (Table[Index++]) { 1777f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner default: 1778f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = false; 1779f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index-1; // Could not evaluate this predicate. 1780da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckSame: 1781da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckSame(Table, Index, N, RecordedNodes); 1782da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1783f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPatternPredicate: 1784da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckPatternPredicate(Table, Index, SDISel); 1785f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1786f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPredicate: 1787da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode()); 1788f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1789f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckOpcode: 1790f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckOpcode(Table, Index, N.getNode()); 1791f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1792f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckType: 1793f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckType(Table, Index, N, SDISel.TLI); 1794f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1795f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild0Type: 1796f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild1Type: 1797f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild2Type: 1798f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild3Type: 1799f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild4Type: 1800f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild5Type: 1801f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild6Type: 1802da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckChild7Type: 1803da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckChildType(Table, Index, N, SDISel.TLI, 1804da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type); 1805da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1806da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckCondCode: 1807da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckCondCode(Table, Index, N); 1808da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1809da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckValueType: 1810da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckValueType(Table, Index, N, SDISel.TLI); 1811f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1812f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckInteger: 1813f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckInteger(Table, Index, N); 1814f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1815da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckAndImm: 1816da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckAndImm(Table, Index, N, SDISel); 1817da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1818da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckOrImm: 1819da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckOrImm(Table, Index, N, SDISel); 1820da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1821f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 1822f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1823f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1824b35798347ea87b8b6d36155b211016a7769f01abDan Gohmannamespace { 18253ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattnerstruct MatchScope { 18272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// FailIndex - If this match fails, this is the index to continue with. 18282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FailIndex; 18292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NodeStack - The node stack when the scope was formed. 18312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 4> NodeStack; 18322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumRecordedNodes - The number of recorded nodes when the scope was formed. 18342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumRecordedNodes; 18352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumMatchedMemRefs - The number of matched memref entries. 18372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumMatchedMemRefs; 18382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// InputChain/InputFlag - The current chain/flag 18402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 18412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty. 18432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasChainNodesMatched, HasFlagResultNodesMatched; 18442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner}; 18452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1846b35798347ea87b8b6d36155b211016a7769f01abDan Gohman} 1847b35798347ea87b8b6d36155b211016a7769f01abDan Gohman 18482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSDNode *SelectionDAGISel:: 18492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable, 18502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned TableSize) { 18512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: Should these even be selected? Handle these cases in the caller? 18522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (NodeToMatch->getOpcode()) { 18532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner default: 18542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 18552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::EntryToken: // These nodes remain the same. 18562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::BasicBlock: 18572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::Register: 18583b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::VALUETYPE: 18593b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::CONDCODE: 18602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::HANDLENODE: 1861decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner case ISD::MDNODE_SDNODE: 18622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstant: 18632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantFP: 18642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantPool: 18652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetFrameIndex: 18662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetExternalSymbol: 18672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetBlockAddress: 18682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetJumpTable: 18692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalTLSAddress: 18702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalAddress: 18712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TokenFactor: 18722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyFromReg: 18732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyToReg: 18747561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner case ISD::EH_LABEL: 1875d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch->setNodeId(-1); // Mark selected. 18762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 18772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertSext: 18782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertZext: 18792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0), 18802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getOperand(0)); 18812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 18822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch); 18832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::UNDEF: return Select_UNDEF(NodeToMatch); 18842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 18852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeToMatch->isMachineOpcode() && "Node already selected!"); 18872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Set up the node stack with NodeToMatch as the only node on the stack. 18892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> NodeStack; 18902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue N = SDValue(NodeToMatch, 0); 18912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 18922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchScopes - Scopes used when matching, if a match failure happens, this 18942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // indicates where to continue checking. 18952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MatchScope, 8> MatchScopes; 18962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // RecordedNodes - This is the set of nodes that have been recorded by the 18982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // state machine. 18992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> RecordedNodes; 19002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchedMemRefs - This is the set of MemRef's we've seen in the input 19022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern. 19032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MachineMemOperand*, 2> MatchedMemRefs; 19042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // These are the current input chain and flag for use when generating nodes. 19062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Various Emit operations change these. For example, emitting a copytoreg 19072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // uses and updates these. 19082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 19092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // ChainNodesMatched - If a pattern matches nodes that have input/output 19112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains, the OPC_EmitMergeInputChains operation is emitted which indicates 19122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // which ones they are. The result is captured into this list so that we can 19132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // update the chain results when the pattern is complete. 19142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> ChainNodesMatched; 19152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> FlagResultNodesMatched; 19162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Starting pattern match on root node: "; 19182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->dump(CurDAG); 19192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner errs() << '\n'); 19202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19217390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Determine where to start the interpreter. Normally we start at opcode #0, 19227390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // but if the state machine starts with an OPC_SwitchOpcode, then we 19237390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // accelerate the first lookup (which is guaranteed to be hot) with the 19247390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // OpcodeOffset table. 19252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned MatcherIndex = 0; 19267390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19277390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (!OpcodeOffset.empty()) { 19287390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Already computed the OpcodeOffset table, just index into it. 19297390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 19307390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 19317390eebd49b786f3293d24f76fedb02fe183468cChris Lattner DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n"); 19327390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19337390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } else if (MatcherTable[0] == OPC_SwitchOpcode) { 19347390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Otherwise, the table isn't computed, but the state machine does start 19357390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // with an OPC_SwitchOpcode instruction. Populate the table now, since this 19367390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // is the first time we're selecting an instruction. 19377390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned Idx = 1; 19387390eebd49b786f3293d24f76fedb02fe183468cChris Lattner while (1) { 19397390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the size of this case. 19407390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned CaseSize = MatcherTable[Idx++]; 19417390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize & 128) 19427390eebd49b786f3293d24f76fedb02fe183468cChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, Idx); 19437390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize == 0) break; 19447390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19457390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the opcode, add the index to the table. 1946d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[Idx++]; 1947d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[Idx++] << 8; 19487390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (Opc >= OpcodeOffset.size()) 19497390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset.resize((Opc+1)*2); 19507390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset[Opc] = Idx; 19517390eebd49b786f3293d24f76fedb02fe183468cChris Lattner Idx += CaseSize; 19527390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 19537390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19547390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Okay, do the lookup for the first opcode. 19557390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 19567390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 19577390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 19587390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 19602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(MatcherIndex < TableSize && "Invalid index"); 196119b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#ifndef NDEBUG 196219b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman unsigned CurrentOpcodeIndex = MatcherIndex; 196319b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#endif 19642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++]; 19652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (Opcode) { 19662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_Scope: { 1967f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Okay, the semantics of this operation are that we should push a scope 1968f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // then evaluate the first child. However, pushing a scope only to have 1969f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // the first check fail (which then pops it) is inefficient. If we can 1970f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // determine immediately that the first check (or first several) will 1971f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // immediately fail, don't even bother pushing a scope for them. 1972f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned FailIndex; 1973f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1974f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner while (1) { 1975f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 1976f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip & 128) 1977f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 1978f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Found the end of the scope with no match. 1979f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip == 0) { 1980f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = 0; 1981f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 1982f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 1983f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1984f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = MatcherIndex+NumToSkip; 1985f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1986a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner unsigned MatcherIndexOfPredicate = MatcherIndex; 1987a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner (void)MatcherIndexOfPredicate; // silence warning. 1988a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner 1989f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If we can't evaluate this predicate without pushing a scope (e.g. if 1990f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // it is a 'MoveParent') or if the predicate succeeds on this node, we 1991f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // push the scope and evaluate the full predicate chain. 1992f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner bool Result; 1993f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N, 1994da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result, *this, RecordedNodes); 1995f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!Result) 1996f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 1997f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1998a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner DEBUG(errs() << " Skipped scope entry (due to false predicate) at " 1999a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << "index " << MatcherIndexOfPredicate 2000a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << ", continuing at " << FailIndex << "\n"); 2001bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 2002f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2003f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Otherwise, we know that this case of the Scope is guaranteed to fail, 2004f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // move to the next case. 2005f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = FailIndex; 2006f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2007f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2008f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If the whole scope failed to match, bail. 2009f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (FailIndex == 0) break; 2010f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 20112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Push a MatchScope which indicates where to go if the first child fails 20122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // to match. 20132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope NewEntry; 2014f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NewEntry.FailIndex = FailIndex; 20152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); 20162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumRecordedNodes = RecordedNodes.size(); 20172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumMatchedMemRefs = MatchedMemRefs.size(); 20182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputChain = InputChain; 20192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputFlag = InputFlag; 20202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty(); 20212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasFlagResultNodesMatched = !FlagResultNodesMatched.empty(); 20222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.push_back(NewEntry); 20232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordNode: 20262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Remember this node, it may end up being an operand in the pattern. 20272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N); 20282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild0: case OPC_RecordChild1: 20312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild2: case OPC_RecordChild3: 20322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild4: case OPC_RecordChild5: 20332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild6: case OPC_RecordChild7: { 20342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = Opcode-OPC_RecordChild0; 20352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 20362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 20372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N->getOperand(ChildNo)); 20392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordMemRef: 20422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand()); 20432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CaptureFlagInput: 20462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the current node has an input flag, capture it in InputFlag. 20472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (N->getNumOperands() != 0 && 20482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag) 20492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = N->getOperand(N->getNumOperands()-1); 20502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveChild: { 20532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = MatcherTable[MatcherIndex++]; 20542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 20552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 20562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = N.getOperand(ChildNo); 20572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 20582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveParent: 20622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Pop the current node off the NodeStack. 20632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.pop_back(); 20642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeStack.empty() && "Node stack imbalance!"); 20652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 20662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2068da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckSame: 2069da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break; 20702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPatternPredicate: 2072f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break; 20732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPredicate: 2075f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this, 2076f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner N.getNode())) 2077f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 20782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 207957bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner case OPC_CheckComplexPat: { 208057bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned CPNum = MatcherTable[MatcherIndex++]; 208157bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 208257bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat"); 208357bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo], CPNum, 208457bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner RecordedNodes)) 20852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 20862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 208757bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner } 20882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckOpcode: 2089f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break; 2090f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner continue; 2091f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2092f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckType: 2093f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break; 20942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2096eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner case OPC_SwitchOpcode: { 2097eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CurNodeOpcode = N.getOpcode(); 20987d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2099eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CaseSize; 2100eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner while (1) { 2101eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Get the size of this case. 2102eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2103eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize & 128) 2104eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2105eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2106eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2107d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2108d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2109d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner 2110eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // If the opcode matches, then we will execute this case. 2111d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner if (CurNodeOpcode == Opc) 2112eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner break; 2113eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2114eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, skip over this case. 2115eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner MatcherIndex += CaseSize; 2116eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2117eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2118cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2119eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2120eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2121eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, execute the case we found. 2122eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner DEBUG(errs() << " OpcodeSwitch from " << SwitchStart 2123eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner << " to " << MatcherIndex << "\n"); 2124eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner continue; 2125eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2126eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2127cfe2eab7446dedc471592fe702fefef783383171Chris Lattner case OPC_SwitchType: { 2128cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CurNodeVT = N.getValueType().getSimpleVT().SimpleTy; 2129cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2130cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned CaseSize; 2131cfe2eab7446dedc471592fe702fefef783383171Chris Lattner while (1) { 2132cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Get the size of this case. 2133cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2134cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize & 128) 2135cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2136cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2137cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2138cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CaseVT = 2139cfe2eab7446dedc471592fe702fefef783383171Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2140cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseVT == MVT::iPTR) 2141cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseVT = TLI.getPointerTy().SimpleTy; 2142cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2143cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If the VT matches, then we will execute this case. 2144cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CurNodeVT == CaseVT) 2145cfe2eab7446dedc471592fe702fefef783383171Chris Lattner break; 2146cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2147cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, skip over this case. 2148cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MatcherIndex += CaseSize; 2149cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 2150cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2151cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2152cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2153cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2154cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, execute the case we found. 2155cfe2eab7446dedc471592fe702fefef783383171Chris Lattner DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString() 2156cfe2eab7446dedc471592fe702fefef783383171Chris Lattner << "] from " << SwitchStart << " to " << MatcherIndex<<'\n'); 2157cfe2eab7446dedc471592fe702fefef783383171Chris Lattner continue; 2158cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 21592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild0Type: case OPC_CheckChild1Type: 21602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild2Type: case OPC_CheckChild3Type: 21612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild4Type: case OPC_CheckChild5Type: 2162da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckChild6Type: case OPC_CheckChild7Type: 2163da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI, 2164da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Opcode-OPC_CheckChild0Type)) 2165f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 21662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckCondCode: 2168da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break; 21692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2170da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckValueType: 2171da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break; 21722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2173f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckInteger: 2174f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break; 21752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2176da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckAndImm: 2177da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break; 21782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2179da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckOrImm: 2180da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break; 21812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckFoldableChainNode: { 21842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeStack.size() != 1 && "No parent node"); 21852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Verify that all intermediate nodes between the root and this one have 21862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // a single use. 21872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasMultipleUses = false; 21882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) 21892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!NodeStack[i].hasOneUse()) { 21902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner HasMultipleUses = true; 21912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 21922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 21932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (HasMultipleUses) break; 21942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see that the target thinks this is profitable to fold and that 21962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we can fold it without inducing cycles in the graph. 21972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(), 21982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch) || 21992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(), 2200d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman NodeToMatch, OptLevel, 2201d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman true/*We validate our own chains*/)) 22022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 22032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitInteger: { 22072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 22082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 22092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 22102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Val & 128) 22112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 22122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT)); 22132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitRegister: { 22162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 22172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 22182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RegNo = MatcherTable[MatcherIndex++]; 22192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT)); 22202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitConvertToTarget: { 22242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Convert from IMM/FPIMM to target version. 22252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 22262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 22272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Imm = RecordedNodes[RecNo]; 22282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Imm->getOpcode() == ISD::Constant) { 22302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue(); 22312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstant(Val, Imm.getValueType()); 22322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (Imm->getOpcode() == ISD::ConstantFP) { 22332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue(); 22342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType()); 22352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(Imm); 22382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2241aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0 2242aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1 2243aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // These are space-optimized forms of OPC_EmitMergeInputChains. 2244aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(InputChain.getNode() == 0 && 2245aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 2246aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(ChainNodesMatched.empty() && 2247aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "Should only have one EmitMergeInputChains per match"); 2248aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2249aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Read all of the chained nodes. 2250aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1; 2251aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2252aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 2253aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2254aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // FIXME: What if other value results of the node have uses not matched 2255aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // by this pattern? 2256aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2257aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 2258aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.clear(); 2259aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; 2260aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2261aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2262aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Merge the input chains if they are not intra-pattern references. 2263aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 2264aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2265aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (InputChain.getNode() == 0) 2266aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; // Failed to merge. 2267aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner continue; 2268aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2269aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 22702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitMergeInputChains: { 22712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() == 0 && 22722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 22732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // This node gets a list of nodes we matched in the input that have 22742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains. We want to token factor all of the input chains to these nodes 22752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // together. However, if any of the input chains is actually one of the 22762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // nodes matched in this pattern, then we have an intra-match reference. 22772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Ignore these because the newly token factored chain should not refer to 22782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // the old nodes. 22792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumChains = MatcherTable[MatcherIndex++]; 22802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NumChains != 0 && "Can't TF zero chains"); 22812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainNodesMatched.empty() && 22832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Should only have one EmitMergeInputChains per match"); 22842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read all of the chained nodes. 228600592ec857b4c3f31b46412e2738924238c59983Chris Lattner for (unsigned i = 0; i != NumChains; ++i) { 228700592ec857b4c3f31b46412e2738924238c59983Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 22882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 22892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 22902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: What if other value results of the node have uses not matched 22922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // by this pattern? 22932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 22942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 22952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 22962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 22972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22996b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 23006b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // If the inner loop broke out, the match fails. 23016b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (ChainNodesMatched.empty()) 23026b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; 23032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23046b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // Merge the input chains if they are not intra-pattern references. 23056b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 23066b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 23076b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChain.getNode() == 0) 23086b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; // Failed to merge. 23092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitCopyToReg: { 23142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned DestPhysReg = MatcherTable[MatcherIndex++]; 23172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputChain.getNode() == 0) 23192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getEntryNode(); 23202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(), 23222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DestPhysReg, RecordedNodes[RecNo], 23232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag); 23242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = InputChain.getValue(1); 23262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNodeXForm: { 23302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned XFormNo = MatcherTable[MatcherIndex++]; 23312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo)); 23342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNode: 23382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MorphNodeTo: { 233914df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner uint16_t TargetOpc = MatcherTable[MatcherIndex++]; 234014df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 23412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned EmitNodeInfo = MatcherTable[MatcherIndex++]; 23422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the result VT list. 23432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumVTs = MatcherTable[MatcherIndex++]; 23442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<EVT, 4> VTs; 23452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumVTs; ++i) { 23462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 23472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 23482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy; 23492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(VT); 23502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 23532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Other); 23542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) 23552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Flag); 23562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23577d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // This is hot code, so optimize the two most common cases of 1 and 2 23587d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // results. 23597d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner SDVTList VTList; 23607d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner if (VTs.size() == 1) 23617d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0]); 23627d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else if (VTs.size() == 2) 23637d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0], VTs[1]); 23647d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else 23657d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs.data(), VTs.size()); 23662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the operand list. 23682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumOps = MatcherTable[MatcherIndex++]; 23692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> Ops; 23702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumOps; ++i) { 23712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 23732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 23742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid EmitNode"); 23762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(RecordedNodes[RecNo]); 23772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If there are variadic operands to add, handle them now. 23802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_VariadicInfo) { 23812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Determine the start index to copy from. 23822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo); 23832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0; 23842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->getNumOperands() >= FirstOpToCopy && 23852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Invalid variadic node"); 23862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Copy all of the variadic operands, not including a potential flag 23872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // input. 23882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands(); 23892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner i != e; ++i) { 23902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue V = NodeToMatch->getOperand(i); 23912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (V.getValueType() == MVT::Flag) break; 23922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(V); 23932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this has chain/flag inputs, add them. 23972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 23982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputChain); 23992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if ((EmitNodeInfo & OPFL_FlagInput) && InputFlag.getNode() != 0) 24002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputFlag); 24012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Create the node. 24032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *Res = 0; 24042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode != OPC_MorphNodeTo) { 24052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this is a normal EmitNode command, just create the new node and 24062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // add the results to the RecordedNodes list. 24072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(), 24082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTList, Ops.data(), Ops.size()); 24092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Add all the non-flag/non-chain results to the RecordedNodes list. 24112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = VTs.size(); i != e; ++i) { 24122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break; 24132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(SDValue(Res, i)); 24142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else { 24173ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(), 24183ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner EmitNodeInfo); 24192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the node had chain/flag results, update our notion of the current 24222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chain and flag. 242382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) { 24242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = SDValue(Res, VTs.size()-1); 24252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 24262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-2); 24272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (EmitNodeInfo & OPFL_Chain) 24282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-1); 24292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the OPFL_MemRefs flag is set on this node, slap all of the 24312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // accumulated memrefs onto it. 24322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // 24332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: This is vastly incorrect for patterns with multiple outputs 24342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // instructions that access memory and for ComplexPatterns that match 24352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // loads. 24362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_MemRefs) { 24372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MachineSDNode::mmo_iterator MemRefs = 24382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MF->allocateMemRefsArray(MatchedMemRefs.size()); 24392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs); 24402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner cast<MachineSDNode>(Res) 24412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size()); 24422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << " " 24452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created") 24462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << " node: "; Res->dump(CurDAG); errs() << "\n"); 24472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this was a MorphNodeTo then we're completely done! 24492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode == OPC_MorphNodeTo) { 24502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 24512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 245282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, true); 245382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner return Res; 24542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MarkFlagResults: { 24602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumNodes = MatcherTable[MatcherIndex++]; 24612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read and remember all the flag-result nodes. 24632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumNodes; ++i) { 24642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 24652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 24662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 24672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 24692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 24702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CompleteMatch: { 24752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // The match has been completed, and any new nodes (if any) have been 24762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created. Patch up references to the matched dag to use the newly 24772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created nodes. 24782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumResults = MatcherTable[MatcherIndex++]; 24792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumResults; ++i) { 24812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ResSlot = MatcherTable[MatcherIndex++]; 24822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ResSlot & 128) 24832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex); 24842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame"); 24862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Res = RecordedNodes[ResSlot]; 24872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2488b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner assert(i < NodeToMatch->getNumValues() && 2489b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Other && 2490b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Flag && 2491b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner "Invalid number of results to complete!"); 24922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert((NodeToMatch->getValueType(i) == Res.getValueType() || 24932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i) == MVT::iPTR || 24942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType() == MVT::iPTR || 24952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i).getSizeInBits() == 24962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType().getSizeInBits()) && 24972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "invalid replacement"); 24982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res); 24992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the root node defines a flag, add it to the flag nodes to update 25022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // list. 25032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Flag) 25042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(NodeToMatch); 25052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 25072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 250882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, false); 25092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->use_empty() && 25112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Didn't replace all uses of the node?"); 25122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: We just return here, which interacts correctly with SelectRoot 25142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // above. We should fix this to not return an SDNode* anymore. 25152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 25162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the code reached this point, then the match failed. See if there is 25202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // another child to try in the current 'Scope', otherwise pop it until we 25212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // find a case to check. 252219b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n"); 2523bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 25242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 25252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (MatchScopes.empty()) { 25262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CannotYetSelect(NodeToMatch); 25272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 25282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Restore the interpreter state back to the point where the scope was 25312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // formed. 25322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope &LastScope = MatchScopes.back(); 25332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.resize(LastScope.NumRecordedNodes); 25342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.clear(); 25352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end()); 25362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 25372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size()) 25392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.resize(LastScope.NumMatchedMemRefs); 25402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatcherIndex = LastScope.FailIndex; 25412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 254219b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Continuing at " << MatcherIndex << "\n"); 254319b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman 25442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = LastScope.InputChain; 25452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = LastScope.InputFlag; 25462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasChainNodesMatched) 25472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 25482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasFlagResultNodesMatched) 25492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.clear(); 25502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see what the offset is at the new MatcherIndex. If it is zero 25522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we have reached the end of this scope, otherwise we have another child 25532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // in the current scope to try. 25542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 25552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip & 128) 25562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 25572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If we have another child in this scope to match, update FailIndex and 25592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // try it. 25602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip != 0) { 25612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner LastScope.FailIndex = MatcherIndex+NumToSkip; 25622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 25632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // End of this scope, pop it and try the next child in the containing 25662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // scope. 25672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.pop_back(); 25682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 25712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2574eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelect(SDNode *N) { 2575e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::string msg; 2576e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman raw_string_ostream Msg(msg); 2577e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman Msg << "Cannot yet select: "; 25782c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner 25792c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN && 25802c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_WO_CHAIN && 25812c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_VOID) { 25822c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->printrFull(Msg, CurDAG); 25832c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } else { 25842c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other; 25852c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner unsigned iid = 25862c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue(); 25872c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (iid < Intrinsic::num_intrinsics) 25882c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid); 25892c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo()) 25902c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "target intrinsic %" << TII->getName(iid); 25912c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else 25922c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "unknown intrinsic #" << iid; 25932c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } 259475361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error(Msg.str()); 2595e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 2596e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 25971997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 2598