SelectionDAGISel.cpp revision 84023e0fbefc406a4c611d3d64a10df5d3a97dd7
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" 174c3fd9f92f89810d659973d2666ab729758de64aDan Gohman#include "llvm/CodeGen/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" 289af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling#include "llvm/Module.h" 2978eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman#include "llvm/CodeGen/FastISel.h" 305a29c9eed157af51a8d338b5a225b146881819e8Gordon Henriksen#include "llvm/CodeGen/GCStrategy.h" 315eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen#include "llvm/CodeGen/GCMetadata.h" 32b92187a4103dca24c3767c380f63593d1f6161a7Bill Wendling#include "llvm/CodeGen/MachineFrameInfo.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 37fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman#include "llvm/CodeGen/ScheduleHazardRecognizer.h" 38eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 406f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 41e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman#include "llvm/Target/TargetIntrinsicInfo.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 45124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 46a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 47db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 487d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin#include "llvm/Support/ErrorHandling.h" 49db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 50ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar#include "llvm/Support/raw_ostream.h" 51c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner#include "llvm/ADT/Statistic.h" 527e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 55c19ae9d91d30bc008e0be5f5d4727f333199f64cChris LattnerSTATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on"); 56bed993d8a4ede75a24a142437057b42498ce5b9fChris LattnerSTATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path"); 57c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner 58ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 59293d5f8bc02a9148238b2c79484637f56de65b9cDan GohmanEnableFastISelVerbose("fast-isel-verbose", cl::Hidden, 60d659d50482e2f9edf8f436e4a1aa30c68c6d020bDan Gohman cl::desc("Enable verbose messages in the \"fast\" " 61293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohman "instruction selector")); 62293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohmanstatic cl::opt<bool> 634344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan GohmanEnableFastISelAbort("fast-isel-abort", cl::Hidden, 644344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman cl::desc("Enable abort calls when \"fast\" instruction fails")); 65ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 66da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 677944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 68462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 69462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 70462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 71462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 72462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 73462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 74462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 75462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 76462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 77462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 78462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 79462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 80462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 81462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 8225cf2275ff7de3de3bc0e508abaf457413d74725Duncan SandsViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden, 8325cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands cl::desc("Pop up a window to show dags before the post legalize types" 8425cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands " dag combine pass")); 8525cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sandsstatic cl::opt<bool> 86a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 87a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 88a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 89a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 90a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 913e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 923e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 935bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 947944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 95462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 96462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 97462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 9825cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombineLT = false, 99462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 100462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 1017944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 1027944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 103eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 104eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 105eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 106eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 107eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 108eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 109eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 110eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 111eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 112eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 113eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 114eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 115844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 116844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 117844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 118844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 119844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 120844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 12113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 122844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 123b8cab9227a0f6ffbdaae33e3c64268e265008a6aDan GohmandefaultListDAGScheduler("default", "Best scheduler for the target", 124844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1254ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 126f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohmannamespace llvm { 127f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman //===--------------------------------------------------------------------===// 128f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// createDefaultScheduler - This creates an instruction scheduler appropriate 129f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// for the target. 13047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS, 13198a366d547772010e94609e4584489b3e5ce0043Bill Wendling CodeGenOpt::Level OptLevel) { 132e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman const TargetLowering &TLI = IS->getTargetLowering(); 133e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman 13498a366d547772010e94609e4584489b3e5ce0043Bill Wendling if (OptLevel == CodeGenOpt::None) 135be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createFastDAGScheduler(IS, OptLevel); 136211ffa13519cadfb7f9baf4c8447fa055bf38fe8Evan Cheng if (TLI.getSchedulingPreference() == Sched::Latency) 137be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createTDListDAGScheduler(IS, OptLevel); 13815a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (TLI.getSchedulingPreference() == Sched::RegPressure) 13915a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return createBURRListDAGScheduler(IS, OptLevel); 14015a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng assert(TLI.getSchedulingPreference() == Sched::Hybrid && 141211ffa13519cadfb7f9baf4c8447fa055bf38fe8Evan Cheng "Unknown sched type!"); 14215a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return createHybridListDAGScheduler(IS, OptLevel); 1433a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 1441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 146ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 147533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// that mark instructions with the 'usesCustomInserter' flag. These 148025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 149025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 150533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// basic blocks, and this method is called to expand it into a sequence of 151533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// instructions, potentially also creating new basic blocks and control flow. 152533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// When new basic blocks are inserted and the edges from MBB to its successors 153533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// are modified, the method should insert pairs of <OldSucc, NewSucc> into the 154533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// DenseMap. 155af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanMachineBasicBlock * 156af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanTargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 157af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman MachineBasicBlock *MBB) const { 158f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#ifndef NDEBUG 1591a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "If a target marks an instruction with " 160533297b58da8c74bec65551e1aface9801fc2259Dan Gohman "'usesCustomInserter', it must implement " 161f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "TargetLowering::EmitInstrWithCustomInserter!"; 162f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#endif 163c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable(0); 164a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar return 0; 165025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 166025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 1677041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 1687041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 1697041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 1701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 171f0757b0edc1ef3d1998485d3f74cadaa3f7180a0Dan GohmanSelectionDAGISel::SelectionDAGISel(const TargetMachine &tm, CodeGenOpt::Level OL) : 172ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()), 1737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 1747451d3e09d26115195280ba36f686a0a90815089Dan Gohman CurDAG(new SelectionDAG(tm)), 17555e59c186303ff02c0be7429da3b1b36c347f164Dan Gohman SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)), 1767c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 177be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling OptLevel(OL), 1787c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DAGSize(0) 1797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman{} 1807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 1817c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 1822048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman delete SDB; 1837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 1847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 1857c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 1867c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 187495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 188c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 189a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<AliasAnalysis>(); 1905eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 191a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<GCModuleInfo>(); 192ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass::getAnalysisUsage(AU); 193495a0b51915eb763576874f29192820b731edc22Chris Lattner} 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1959af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling/// FunctionCallsSetJmp - Return true if the function has a call to setjmp or 1968d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling/// other function that gcc recognizes as "returning twice". This is used to 1978d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling/// limit code-gen optimizations on the machine function. 198804a231dd5b064006a252f67fe27abced0827ac8Bill Wendling/// 199804a231dd5b064006a252f67fe27abced0827ac8Bill Wendling/// FIXME: Remove after <rdar://problem/8031714> is fixed. 2009af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendlingstatic bool FunctionCallsSetJmp(const Function *F) { 2019af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling const Module *M = F->getParent(); 2028d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling static const char *ReturnsTwiceFns[] = { 2038d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling "setjmp", 2048d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling "sigsetjmp", 2058d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling "setjmp_syscall", 2068d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling "savectx", 2078d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling "qsetjmp", 2088d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling "vfork", 2098d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling "getcontext" 2108d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling }; 2118d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling#define NUM_RETURNS_TWICE_FNS sizeof(ReturnsTwiceFns) / sizeof(const char *) 2128d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling 2138d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling for (unsigned I = 0; I < NUM_RETURNS_TWICE_FNS; ++I) 2148d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling if (const Function *Callee = M->getFunction(ReturnsTwiceFns[I])) { 2158d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling if (!Callee->use_empty()) 2168d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling for (Value::const_use_iterator 2178d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling I = Callee->use_begin(), E = Callee->use_end(); 2188d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling I != E; ++I) 2198d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling if (const CallInst *CI = dyn_cast<CallInst>(I)) 2208d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling if (CI->getParent()->getParent() == F) 2218d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling return true; 2228d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling } 2239af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling 2249af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling return false; 2258d717c7d999231c8c54601720b08cd3eecf6d518Bill Wendling#undef NUM_RETURNS_TWICE_FNS 2269af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling} 2279af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling 228ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohmanbool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) { 2294344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman // Do some sanity-checking on the command-line options. 2304344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelVerbose || EnableFastISel) && 2314344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-verbose requires -fast-isel"); 2324344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelAbort || EnableFastISel) && 2334344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-abort requires -fast-isel"); 2344344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman 235ae541aad5c36cb3e4256514447d1f81e253079c7Dan Gohman const Function &Fn = *mf.getFunction(); 2368a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII = *TM.getInstrInfo(); 2378a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI = *TM.getRegisterInfo(); 2388a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 239c0fb65da040668df543db514f05e4be571edf700Dan Gohman MF = &mf; 24079ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman RegInfo = &MF->getRegInfo(); 241c0fb65da040668df543db514f05e4be571edf700Dan Gohman AA = &getAnalysis<AliasAnalysis>(); 242c0fb65da040668df543db514f05e4be571edf700Dan Gohman GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0; 243c0fb65da040668df543db514f05e4be571edf700Dan Gohman 2441a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n"); 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 246de6e783b2490447866b592cd39855e6f4d25efffChris Lattner CurDAG->init(*MF); 2477451d3e09d26115195280ba36f686a0a90815089Dan Gohman FuncInfo->set(Fn, *MF); 2482048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->init(GFI, *AA); 2491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2506a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman SelectAllBasicBlocks(Fn); 251edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2521b79a2ff547a5ead0eef933bb02f51b3a2f4cc1cDan Gohman // If the first basic block in the function has live ins that need to be 2538a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 2548a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 2552ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock *EntryMBB = MF->begin(); 2562ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII); 2572ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 258394427b014a7126e56f3ee411993f08677d93c83Devang Patel DenseMap<unsigned, unsigned> LiveInMap; 259394427b014a7126e56f3ee411993f08677d93c83Devang Patel if (!FuncInfo->ArgDbgValues.empty()) 260394427b014a7126e56f3ee411993f08677d93c83Devang Patel for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(), 261394427b014a7126e56f3ee411993f08677d93c83Devang Patel E = RegInfo->livein_end(); LI != E; ++LI) 262394427b014a7126e56f3ee411993f08677d93c83Devang Patel if (LI->second) 263394427b014a7126e56f3ee411993f08677d93c83Devang Patel LiveInMap.insert(std::make_pair(LI->first, LI->second)); 264394427b014a7126e56f3ee411993f08677d93c83Devang Patel 2652ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Insert DBG_VALUE instructions for function arguments to the entry block. 2662ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) { 2672ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1]; 2682ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng unsigned Reg = MI->getOperand(0).getReg(); 2692ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng if (TargetRegisterInfo::isPhysicalRegister(Reg)) 2702ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng EntryMBB->insert(EntryMBB->begin(), MI); 2712ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng else { 2722ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *Def = RegInfo->getVRegDef(Reg); 2732ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock::iterator InsertPos = Def; 274f1ced259b5617e9c15fcafd47e090c22e2702062Evan Cheng // FIXME: VR def may not be in entry block. 275f1ced259b5617e9c15fcafd47e090c22e2702062Evan Cheng Def->getParent()->insert(llvm::next(InsertPos), MI); 2762ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 277394427b014a7126e56f3ee411993f08677d93c83Devang Patel 278394427b014a7126e56f3ee411993f08677d93c83Devang Patel // If Reg is live-in then update debug info to track its copy in a vreg. 279394427b014a7126e56f3ee411993f08677d93c83Devang Patel DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg); 280394427b014a7126e56f3ee411993f08677d93c83Devang Patel if (LDI != LiveInMap.end()) { 281394427b014a7126e56f3ee411993f08677d93c83Devang Patel MachineInstr *Def = RegInfo->getVRegDef(LDI->second); 282394427b014a7126e56f3ee411993f08677d93c83Devang Patel MachineBasicBlock::iterator InsertPos = Def; 283394427b014a7126e56f3ee411993f08677d93c83Devang Patel const MDNode *Variable = 284394427b014a7126e56f3ee411993f08677d93c83Devang Patel MI->getOperand(MI->getNumOperands()-1).getMetadata(); 285394427b014a7126e56f3ee411993f08677d93c83Devang Patel unsigned Offset = MI->getOperand(1).getImm(); 286394427b014a7126e56f3ee411993f08677d93c83Devang Patel // Def is never a terminator here, so it is ok to increment InsertPos. 287394427b014a7126e56f3ee411993f08677d93c83Devang Patel BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(), 288394427b014a7126e56f3ee411993f08677d93c83Devang Patel TII.get(TargetOpcode::DBG_VALUE)) 289394427b014a7126e56f3ee411993f08677d93c83Devang Patel .addReg(LDI->second, RegState::Debug) 290394427b014a7126e56f3ee411993f08677d93c83Devang Patel .addImm(Offset).addMetadata(Variable); 291394427b014a7126e56f3ee411993f08677d93c83Devang Patel } 2922ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 2932ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 29453f7602b61157ed56ccbf91379c188c55235f619Bill Wendling // Determine if there are any calls in this machine function. 29553f7602b61157ed56ccbf91379c188c55235f619Bill Wendling MachineFrameInfo *MFI = MF->getFrameInfo(); 29653f7602b61157ed56ccbf91379c188c55235f619Bill Wendling if (!MFI->hasCalls()) { 29753f7602b61157ed56ccbf91379c188c55235f619Bill Wendling for (MachineFunction::const_iterator 29853f7602b61157ed56ccbf91379c188c55235f619Bill Wendling I = MF->begin(), E = MF->end(); I != E; ++I) { 29953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling const MachineBasicBlock *MBB = I; 30053f7602b61157ed56ccbf91379c188c55235f619Bill Wendling for (MachineBasicBlock::const_iterator 30153f7602b61157ed56ccbf91379c188c55235f619Bill Wendling II = MBB->begin(), IE = MBB->end(); II != IE; ++II) { 30253f7602b61157ed56ccbf91379c188c55235f619Bill Wendling const TargetInstrDesc &TID = TM.getInstrInfo()->get(II->getOpcode()); 3038886c495a33703d8bd8319d16b62645cee4dd546Bill Wendling 3048886c495a33703d8bd8319d16b62645cee4dd546Bill Wendling // Operand 1 of an inline asm instruction indicates whether the asm 3058886c495a33703d8bd8319d16b62645cee4dd546Bill Wendling // needs stack or not. 306c930cbcada7c62bb474019f4ce21bd6387d1c3f5Bill Wendling if ((II->isInlineAsm() && II->getOperand(1).getImm()) || 307c930cbcada7c62bb474019f4ce21bd6387d1c3f5Bill Wendling (TID.isCall() && !TID.isReturn())) { 30853f7602b61157ed56ccbf91379c188c55235f619Bill Wendling MFI->setHasCalls(true); 30953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling goto done; 31053f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 31153f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 31253f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 31353f7602b61157ed56ccbf91379c188c55235f619Bill Wendling done:; 31453f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 31553f7602b61157ed56ccbf91379c188c55235f619Bill Wendling 3169af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling // Determine if there is a call to setjmp in the machine function. 3179af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling MF->setCallsSetJmp(FunctionCallsSetJmp(&Fn)); 3189af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling 31984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Replace forward-declared registers with the registers containing 32084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // the desired value. 32184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MachineRegisterInfo &MRI = MF->getRegInfo(); 32284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (DenseMap<unsigned, unsigned>::iterator 32384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end(); 32484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman I != E; ++I) { 32584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned From = I->first; 32684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned To = I->second; 32784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If To is also scheduled to be replaced, find what its ultimate 32884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // replacement is. 32984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (;;) { 33084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman DenseMap<unsigned, unsigned>::iterator J = 33184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->RegFixups.find(To); 33284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (J == E) break; 33384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman To = J->second; 33484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman } 33584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Replace it. 33684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MRI.replaceRegWith(From, To); 33784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman } 33884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 3392ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Release function-specific state. SDB and CurDAG are already cleared 3402ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // at this point. 3412ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng FuncInfo->clear(); 3428a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 3431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 3441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 34684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohmanvoid 34784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan GohmanSelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin, 348a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman BasicBlock::const_iterator End, 349a9a3321938aac13477bdc53af0018bce88b45d78Dan Gohman bool &HadTailCall) { 35098ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 351f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // as a tail call, cease emitting nodes for this block. Terminators 352f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // are handled below. 353c105a2b5b7d8969e78bd4b203e980dced8a1c689Dan Gohman for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I) 354f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman SDB->visit(*I); 355f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 356a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 3572048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 3582048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman HadTailCall = SDB->HasTailCall; 3592048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 36095140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 36195140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Final step, emit the lowered DAG as machine code. 36284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 3631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengnamespace { 36654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted 36754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// nodes from the worklist. 36854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengclass SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener { 36954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng SmallVector<SDNode*, 128> &Worklist; 37025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &InWorklist; 37154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengpublic: 37225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl, 37325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &inwl) 37425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner : Worklist(wl), InWorklist(inwl) {} 37525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 37625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner void RemoveFromWorklist(SDNode *N) { 37725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!InWorklist.erase(N)) return; 37825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 37925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallVector<SDNode*, 128>::iterator I = 38025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner std::find(Worklist.begin(), Worklist.end(), N); 38125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(I != Worklist.end() && "Not in worklist"); 38225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 38325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner *I = Worklist.back(); 38425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.pop_back(); 38525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 38625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 38754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeDeleted(SDNode *N, SDNode *E) { 38825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner RemoveFromWorklist(N); 38954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 39054e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 39154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeUpdated(SDNode *N) { 39254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng // Ignore updates. 39354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 39454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng}; 39554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng} 39654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 397f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 398ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 399ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 400a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 401ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 402a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 403ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 404ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 405ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 406a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4077b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer do { 4087b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 409a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 410ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 411ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 412ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 413a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 414ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 415ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 416825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 417ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 418a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 419ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 420ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 421ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 422a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 423ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 424ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 425ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 426a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 427ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 428475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 429e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 430ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 431ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 432a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 433f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 434ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 435f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 436a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 437ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 438ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 439ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 440f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (DestReg >= FuncInfo->LiveOutRegInfo.size()) 441f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo.resize(DestReg+1); 442f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FunctionLoweringInfo::LiveOutInfo &LOI = 443f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo[DestReg]; 444ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 445a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownOne = KnownOne; 446a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownZero = KnownZero; 447ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 4487b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer } while (!Worklist.empty()); 449ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 450ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 45184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 452462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 453462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 454462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 455462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 456462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 45725cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 45825cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 459f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman BlockName = MF->getFunction()->getNameStr() + ":" + 46084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB->getBasicBlock()->getNameStr(); 461462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 462927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman DEBUG(dbgs() << "Initial selection DAG:\n"; CurDAG->dump()); 463462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 464f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 465417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 466af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 46703c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 46803c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled); 469be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 470ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 471a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 472927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman DEBUG(dbgs() << "Optimized lowered selection DAG:\n"; CurDAG->dump()); 473a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 476714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 477714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman BlockName); 478714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 479714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman bool Changed; 48003c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 48103c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled); 482714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 483714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 484714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 485927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman DEBUG(dbgs() << "Type-legalized selection DAG:\n"; CurDAG->dump()); 486462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 487714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 488714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 489714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 490714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 491714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 49203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 49303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining after legalize types", GroupName, 49403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 495714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 496462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 497462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 498927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n"; 499927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman CurDAG->dump()); 500714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 501462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 50203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 50303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled); 504714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 505714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 5065c22c8074404797f1313b1334757254fb5c6487aEli Friedman 507714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 50803c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 50903c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled); 5109882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 5115c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 5125c22c8074404797f1313b1334757254fb5c6487aEli Friedman 513714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 514714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 5155c22c8074404797f1313b1334757254fb5c6487aEli Friedman 516714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 51703c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 51803c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName, 51903c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 520714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 5215c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 522714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 523927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n"; 524927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman CurDAG->dump()); 52570587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 526a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 527f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 528462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 52903c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 53003c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled); 531714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 532ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 533a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 534927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman DEBUG(dbgs() << "Legalized selection DAG:\n"; CurDAG->dump()); 535a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 536f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 537462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 538af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 53903c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 54003c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled); 541be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 542ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 543a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 544927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman DEBUG(dbgs() << "Optimized legalized selection DAG:\n"; CurDAG->dump()); 545417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5464e39e9da0f3a435445261d0f796bb0913f3c2bf0Dan Gohman if (OptLevel != CodeGenOpt::None) 547f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 548552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 549552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 550552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner 551a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 552a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 55303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 55403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled); 5557c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 556ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 557db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 558927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman DEBUG(dbgs() << "Selected selection DAG:\n"; CurDAG->dump()); 559462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 560f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 561462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5625e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 56347ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 56403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 56503c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName, 56603c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 56784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Scheduler->Run(CurDAG, FuncInfo->MBB, FuncInfo->InsertPt); 5685e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 5695e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 570462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 571462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 572a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 573db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 57403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 57503c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled); 57684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 57784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = Scheduler->EmitSchedule(); 57884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = Scheduler->InsertPos; 5795e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 5805e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 5815e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 58203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 58303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName, 58403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 5855e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 586ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 587db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 58895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Free the SelectionDAG state, now that we're finished with it. 58995140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman CurDAG->clear(); 590a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 591f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5927c306da505e2d7f64e160890b274a47fa0740962Chris Lattnervoid SelectionDAGISel::DoInstructionSelection() { 5937c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection begins:\n"); 5947c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 5957c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PreprocessISelDAG(); 5967c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 5977c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Select target instructions for the DAG. 5987c306da505e2d7f64e160890b274a47fa0740962Chris Lattner { 5997c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Number all nodes with a topological order and set DAGSize. 6007c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DAGSize = CurDAG->AssignTopologicalOrder(); 6017c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6027c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Create a dummy node (which is not added to allnodes), that adds 6037c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // a reference to the root node, preventing it from being deleted, 6047c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // and tracking any changes of the root. 6057c306da505e2d7f64e160890b274a47fa0740962Chris Lattner HandleSDNode Dummy(CurDAG->getRoot()); 6067c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode()); 6077c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ++ISelPosition; 6087c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6097c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // The AllNodes list is now topological-sorted. Visit the 6107c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // nodes by starting at the end of the list (the root of the 6117c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // graph) and preceding back toward the beginning (the entry 6127c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // node). 6137c306da505e2d7f64e160890b274a47fa0740962Chris Lattner while (ISelPosition != CurDAG->allnodes_begin()) { 6147c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *Node = --ISelPosition; 6157c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes, 6167c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // but there are currently some corner cases that it misses. Also, this 6177c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // makes it theoretically possible to disable the DAGCombiner. 6187c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) 6197c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 6207c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6217c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *ResNode = Select(Node); 6227c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 62382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // FIXME: This is pretty gross. 'Select' should be changed to not return 62482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // anything at all and this code should be nuked with a tactical strike. 62582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 6267c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If node should not be replaced, continue with the next one. 62782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE) 6287c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 6297c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Replace node. 6307c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (ResNode) 6317c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ReplaceUses(Node, ResNode); 6327c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6337c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If after the replacement this node is not used any more, 6347c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // remove this dead node. 6357c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) { // Don't delete EntryToken, etc. 6367c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelUpdater ISU(ISelPosition); 6377c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->RemoveDeadNode(Node, &ISU); 6387c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6397c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 6407c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6417c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->setRoot(Dummy.getValue()); 6427c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 64353f7602b61157ed56ccbf91379c188c55235f619Bill Wendling 6447c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection ends:\n"); 6457c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6467c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PostprocessISelDAG(); 6477c306da505e2d7f64e160890b274a47fa0740962Chris Lattner} 6487c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 6492520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and 6502520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// do other setup for EH landing-pad blocks. 65184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohmanvoid SelectionDAGISel::PrepareEHLandingPad() { 6522520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 6532520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 65484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MCSymbol *Label = MF->getMMI().addLandingPad(FuncInfo->MBB); 6552520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 65655e59c186303ff02c0be7429da3b1b36c347f164Dan Gohman const TargetInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL); 65784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman BuildMI(*FuncInfo->MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II) 65884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman .addSym(Label); 6592520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6602520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception register as live in. 6612520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 66284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (Reg) FuncInfo->MBB->addLiveIn(Reg); 6632520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6642520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception selector register as live in. 6652520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 66684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (Reg) FuncInfo->MBB->addLiveIn(Reg); 6672520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6682520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 6692520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 6702520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // like, the basic block containing the invoke), and need to be associated 6712520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // with it in the dwarf exception handling tables. Currently however the 6722520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 6732520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 6742520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // then breaking it can result in the intrinsics being in the successor of 6752520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the landing pad, not the landing pad itself. This results 6762520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // in exceptions not being caught because no typeids are associated with 6772520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the invoke. This may not be the only way things can go wrong, but it 6782520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // is the only way we try to work around for the moment. 67984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman const BasicBlock *LLVMBB = FuncInfo->MBB->getBasicBlock(); 6802520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 6812520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6822520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 6832520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman BasicBlock::const_iterator I, E; 6842520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 6852520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (isa<EHSelectorInst>(I)) 6862520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman break; 6872520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 6882520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (I == E) 6892520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // No catch info found - try to extract some from the successor. 6902520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo); 6912520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman } 6922520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman} 6937c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 69446510a73e977273ec67747eb34cbdb43f815e451Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) { 695a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 696a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 697a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISel) 698a4160c3434b08288d1f79f1acbe453d1b9610b22Dan Gohman FastIS = TLI.createFastISel(*FuncInfo); 699a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 700a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 70146510a73e977273ec67747eb34cbdb43f815e451Dan Gohman for (Function::const_iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 70246510a73e977273ec67747eb34cbdb43f815e451Dan Gohman const BasicBlock *LLVMBB = &*I; 70384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB]; 70484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI(); 705f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 706ba5be5c07bb19dcf484e3aa40cd139dd07c10407Dan Gohman BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI(); 70746510a73e977273ec67747eb34cbdb43f815e451Dan Gohman BasicBlock::const_iterator const End = LLVMBB->end(); 70884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman BasicBlock::const_iterator BI = End; 7095edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 71084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI(); 71184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 71284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Setup an EH landing-pad block. 71384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isLandingPad()) 71484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PrepareEHLandingPad(); 71584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 716f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // Lower any arguments needed in this block if this is the entry block. 717f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) 718f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman LowerArguments(LLVMBB); 719f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman 720f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 721d725f04ff81db0e61baa153bf21ca2dd08838244Dan Gohman if (FastIS) { 72284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->startNewBlock(); 72384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 724f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // Emit code for any incoming arguments. This must happen before 725f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // beginning FastISel on the entry block. 726f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 727f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman CurDAG->setRoot(SDB->getControlRoot()); 728f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman SDB->clear(); 72984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 73084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 73184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If we inserted any instructions at the beginning, make a note of 73284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // where they are, so we can be sure to emit subsequent instructions 73384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // after them. 73484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->InsertPt != FuncInfo->MBB->begin()) 73584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->setLastLocalValue(llvm::prior(FuncInfo->InsertPt)); 73684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman else 73784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->setLastLocalValue(0); 738f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman } 73984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 740a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 74184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (; BI != Begin; --BI) { 74284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman const Instruction *Inst = llvm::prior(BI); 74384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 74484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If we no longer require this instruction, skip it. 74584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (!Inst->mayWriteToMemory() && 74684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman !isa<TerminatorInst>(Inst) && 74784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman !isa<DbgInfoIntrinsic>(Inst) && 74884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman !FuncInfo->isExportedInst(Inst)) 74920d4be151b54feb18aa1e5cc04033a4aa64137aeDan Gohman continue; 75084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 75184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Bottom-up: reset the insert pos at the top, after any local-value 75284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // instructions. 75384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->recomputeInsertPt(); 75420d4be151b54feb18aa1e5cc04033a4aa64137aeDan Gohman 75521c14e3649b3e2a70ac36ebb148f17648f10a2a9Dan Gohman // Try to select the instruction with FastISel. 75684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FastIS->SelectInstruction(Inst)) 757a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 758f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 759a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 76084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (isa<CallInst>(Inst)) { 761c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 762a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 7631a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel missed call: "; 76484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Inst->dump(); 765f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 766f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 76784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) { 76884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned &R = FuncInfo->ValueMap[Inst]; 769a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 77084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman R = FuncInfo->CreateRegs(Inst->getType()); 771f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 772a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 773b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall = false; 77484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman SelectBasicBlock(Inst, BI, HadTailCall); 775b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 776b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman // If the call was emitted as a tail call, we're done with the block. 777b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman if (HadTailCall) { 77884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman --BI; 779b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman break; 780b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman } 781b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 782a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 783f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 784a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 785a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Otherwise, give up on FastISel for the rest of the block. 786a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For now, be a little lenient about non-branch terminators. 78784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (!isa<TerminatorInst>(Inst) || isa<BranchInst>(Inst)) { 788c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 789a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 7901a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 79184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Inst->dump(); 792a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 793a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 794a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 795a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 796c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 797a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 798a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 799f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 80084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 80184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->recomputeInsertPt(); 802f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 803f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 804d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // Run SelectionDAG instruction selection on the remainder of the block 805d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // not handled by FastISel. If FastISel is not run, this is the entire 8063df24e667f04a7003342b534310919abc9c87418Dan Gohman // block. 80784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman bool HadTailCall; 80884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman SelectBasicBlock(Begin, BI, HadTailCall); 809381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 81084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FinishBasicBlock(); 811620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman FuncInfo->PHINodesToUpdate.clear(); 81239fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 813a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 814a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 8150e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 8160e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 817fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 81884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan GohmanSelectionDAGISel::FinishBasicBlock() { 8191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8201a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Total amount of phi nodes to update: " 821927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman << FuncInfo->PHINodesToUpdate.size() << "\n"; 822927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) 8231a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Node " << i << " : (" 824620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << FuncInfo->PHINodesToUpdate[i].first 825620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n"); 826a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 827a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 8281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 8292048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (SDB->SwitchCases.empty() && 8302048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.empty() && 8312048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.empty()) { 832620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 833620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 834518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 835f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 83684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (!FuncInfo->MBB->isSuccessor(PHI->getParent())) 837580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen continue; 838620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 839620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 84084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 841f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 842f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 8431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8452048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) { 8464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 8472048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->BitTestCases[i].Emitted) { 8484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 84984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->BitTestCases[i].Parent; 85084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 8514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 85284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB); 8532048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 8542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 85584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 856a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 8574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8582048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) { 8594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 86084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB; 86184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 8624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 8634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 8642048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB, 8652048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 86699be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 86784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 8684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 8692048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Default, 8702048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 87199be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 87284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 873a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 874a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 8752048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 8762048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 87784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 8784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 8794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 881620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 882620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 883620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 8844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 885518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 8864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 8874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 8884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 8892048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->BitTestCases[i].Default) { 890f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 891620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 892620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 8932048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); 894f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 895620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 896620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 8972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases. 8989ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 8994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 9012048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); 9027c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 9032048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB; 904dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (cBB->isSuccessor(PHIBB)) { 905f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 906620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 907620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 9089ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 9094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9132048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.clear(); 9144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9159453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 9169453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 9179453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 9182048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) { 9193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 9202048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->JTCases[i].first.Emitted) { 9213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 92284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB; 92384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 9243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 92599be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first, 92684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 9272048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 9282048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 92984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 9304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 931a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 93237efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 93384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->JTCases[i].second.MBB; 93484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 93537efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 9362048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTable(SDB->JTCases[i].second); 9372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 9382048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 93984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 940a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 94137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 942620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 943620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 944620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 94537efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 946518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 94737efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 9484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 9492048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->JTCases[i].second.Default) { 950ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 951620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 952620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 953ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 9542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB)); 955f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 9564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 95784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isSuccessor(PHIBB)) { 958ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 959620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 960620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 96184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 96237efe6764568a3829fee26aba532283131d1a104Nate Begeman } 96337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 96437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 9652048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.clear(); 966a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 967b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 968b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 969620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 970620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 971518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 972b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 97384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isSuccessor(PHI->getParent())) { 974620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 975620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 97684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 977b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 978b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 979a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 980f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 981f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 9822048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) { 983f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 98484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MachineBasicBlock *ThisBB = FuncInfo->MBB = SDB->SwitchCases[i].ThisBB; 98584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 986a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 98795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Determine the unique successors. 98895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman SmallVector<MachineBasicBlock *, 2> Succs; 98995140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman Succs.push_back(SDB->SwitchCases[i].TrueBB); 99095140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB) 99195140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman Succs.push_back(SDB->SwitchCases[i].FalseBB); 99295140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 99395140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Emit the code. Note that this could result in ThisBB being split, so 99495140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // we need to check for updates. 99584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB); 9962048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 99795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman SDB->clear(); 99884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 99984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman ThisBB = FuncInfo->MBB; 1000a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1001d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 1002d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 1003d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1004d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 100595140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman for (unsigned i = 0, e = Succs.size(); i != e; ++i) { 100684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = Succs[i]; 100784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 100884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // FuncInfo->MBB may have been removed from the CFG if a branch was 100984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // constant folded. 101084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (ThisBB->isSuccessor(FuncInfo->MBB)) { 101184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (MachineBasicBlock::iterator Phi = FuncInfo->MBB->begin(); 101284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Phi != FuncInfo->MBB->end() && Phi->isPHI(); 1013dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen ++Phi) { 1014dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // This value for this PHI node is recorded in PHINodesToUpdate. 1015dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (unsigned pn = 0; ; ++pn) { 1016620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman assert(pn != FuncInfo->PHINodesToUpdate.size() && 1017dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen "Didn't find PHI entry!"); 1018620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman if (FuncInfo->PHINodesToUpdate[pn].first == Phi) { 1019dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand:: 1020620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pn].second, 1021dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen false)); 1022dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1023dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen break; 1024dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen } 10258be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1026d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1027f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1028f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1029a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 10302048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases.clear(); 10311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1032a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 103313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 10340a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 10350a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 10360a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 10375e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 103847ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1039eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1040a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 104113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1042eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 10439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 10444ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1045a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1046be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1047a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 10480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1049fc54c552963545a81e4ea38e60460590afb2d5aeDan GohmanScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 1050fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman return new ScheduleHazardRecognizer(); 10519ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 10529ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 1053755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1054755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1055755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1056755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1057755480681c795d585c73556c028b6143c46bda86Chris Lattner 1058755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1059755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1060755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1061755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1062a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1063dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 10642e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 10652e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1066a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1067755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1068755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1069755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1070a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1071755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 10722e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1073755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1074a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1075755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1076755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 10772e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1078ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1079755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1080a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1081755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1082755480681c795d585c73556c028b6143c46bda86Chris Lattner 1083755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1084755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1085755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1086755480681c795d585c73556c028b6143c46bda86Chris Lattner 1087755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1088755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1089755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1090755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1091a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 10922e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 10932e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 10942e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1095a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1096755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1097755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1098755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1099a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1100755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 11012e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1102755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1103a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1104755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1105755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 11062e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1107a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11082e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 1109ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 1110a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1111755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1112755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1113755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1114a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1115755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1116a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1117755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1118755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1119755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1120755480681c795d585c73556c028b6143c46bda86Chris Lattner 11219ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 11220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 11230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 11240e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1125f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1126475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 11270e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 11280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1129decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0 1130decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1 1131decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc 1132f1e309eb4862459a76445942ba4dafc433b6f317Dale Johannesen Ops.push_back(InOps[InlineAsm::Op_IsAlignStack]); // 3 11330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1134decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size(); 1135825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (InOps[e-1].getValueType() == MVT::Flag) 11360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 1137a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1139f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 1140decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (!InlineAsm::isMemKind(Flags)) { 11410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1142697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1143697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1144697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 11450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1146697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1147697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 11480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1149475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1150decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) 115175361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error("Could not match memory address. Inline asm" 115287d677c1856bfdcb91d9daeb69dc5f261c73851eChris Lattner " failure!"); 1153a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 1155decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned NewFlags = 1156decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size()); 1157decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32)); 11580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 11590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 11600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 11610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1162a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 11640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 11650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 11660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1167794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1168e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson/// findFlagUse - Return use of EVT::Flag value produced by the specified 1169c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1170c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1171c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic SDNode *findFlagUse(SDNode *N) { 1172c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1173c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1174c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1175c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1176c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1177c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1178c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1179c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1180c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1181c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1182c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1183c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1184c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1185d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, 1186d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) { 1187da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The NodeID's are given uniques ID's where a node ID is guaranteed to be 1188da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // greater than all of its (recursive) operands. If we scan to a point where 1189da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 'use' is smaller than the node we're scanning for, then we know we will 1190da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // never find it. 1191da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 1192da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The Use may be -1 (unassigned) if it is a newly allocated node. This can 1193da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // happen because we scan down to newly selected nodes in the case of flag 1194da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // uses. 1195da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1)) 1196da244a091dcde022ea4938793d81ee957903ed70Chris Lattner return false; 1197da244a091dcde022ea4938793d81ee957903ed70Chris Lattner 1198da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // Don't revisit nodes if we already scanned it and didn't fail, we know we 1199da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // won't fail if we scan it again. 1200da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if (!Visited.insert(Use)) 1201c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1202c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1203c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1204d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Ignore chain uses, they are validated by HandleMergeInputChains. 1205d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains) 1206d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1207d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1208c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1209c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1210c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1211c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1212c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1213c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1214c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1215c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1216c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1217d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains)) 1218c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1219c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1220c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1221c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1222c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1223014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsProfitableToFold - Returns true if it's profitable to fold the specific 1224014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// operand node N of U during instruction selection that starts at Root. 1225014bf215c3457bb34fee348265e8f63a70b4d503Evan Chengbool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U, 1226014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng SDNode *Root) const { 1227014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng if (OptLevel == CodeGenOpt::None) return false; 1228014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng return N.hasOneUse(); 1229014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng} 1230014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng 1231014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsLegalToFold - Returns true if the specific operand node N of 1232014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// U can be folded during instruction selection that starts at Root. 1233d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattnerbool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 1234d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman CodeGenOpt::Level OptLevel, 1235d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman bool IgnoreChains) { 1236c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1237c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1238c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1239c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1240c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1241c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1242c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1243c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1244c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1245c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1246c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1247c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1248c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1249c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1250c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1251c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1252c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1253c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1254c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root produces a flag, then it gets (even more) interesting. Since it 1255c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // will be "glued" together with its flag use in the scheduler, we need to 1256c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1257c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1258c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1259c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1260c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1261c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1262c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1263c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1264c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1265c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1266c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1267c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1268c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1269c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1270c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1271c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1272c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1273c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [FU] // 1274c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1275c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If FU (flag use) indirectly reaches N (the load), and Root folds N 1276c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // (call it Fold), then X is a predecessor of FU and a successor of 1277c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Fold. But since Fold and FU are flagged together, this will create 1278c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1279c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 12809bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // If the node has flags, walk down the graph to the "lowest" node in the 12819bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // flagged set. 1282e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1283825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (VT == MVT::Flag) { 1284c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *FU = findFlagUse(Root); 1285c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (FU == NULL) 1286c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1287c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov Root = FU; 1288c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 128918fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 129018fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // If our query node has a flag result with a use, we've walked up it. If 129118fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the user (which has already been selected) has a chain or indirectly uses 129218fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the chain, our WalkChainUsers predicate will not consider it. Because of 129318fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // this, we cannot ignore chains in this predicate. 129418fdabadca110671b436de52fe7bd492ad49e656Chris Lattner IgnoreChains = false; 1295c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 129618fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 1297c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 12989bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner SmallPtrSet<SDNode*, 16> Visited; 12999bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains); 1300c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1301c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1302eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) { 1303eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman std::vector<SDValue> Ops(N->op_begin(), N->op_end()); 1304e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SelectInlineAsmMemoryOperands(Ops); 1305e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1306e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::vector<EVT> VTs; 1307e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Other); 1308e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Flag); 1309eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(), 1310e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs, &Ops[0], Ops.size()); 1311d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner New->setNodeId(-1); 1312e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman return New.getNode(); 1313e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1314e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1315eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) { 1316518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0)); 1317e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1318e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 13192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// GetVBR - decode a vbr encoding whose top bit is set. 13202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerALWAYS_INLINE static uint64_t 13212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerGetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) { 13222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(Val >= 128 && "Not a VBR"); 13232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val &= 127; // Remove first vbr bit. 13242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned Shift = 7; 13262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner uint64_t NextBits; 13272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner do { 132814df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner NextBits = MatcherTable[Idx++]; 13292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val |= (NextBits&127) << Shift; 13302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Shift += 7; 13312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } while (NextBits & 128); 13322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return Val; 13342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 13352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// UpdateChainsAndFlags - When a match is complete, this method updates uses of 13382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// interior flag and chain results to use the new flag and chain results. 133982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattnervoid SelectionDAGISel:: 134082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris LattnerUpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain, 134182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &ChainNodesMatched, 134282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SDValue InputFlag, 134382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &FlagResultNodesMatched, 134482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner bool isMorphNodeTo) { 134582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SmallVector<SDNode*, 4> NowDeadNodes; 134682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 134782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner ISelUpdater ISU(ISelPosition); 134882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 13492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Now that all the normal results are replaced, we replace the chain and 13502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // flag results if present. 13512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!ChainNodesMatched.empty()) { 13522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() != 0 && 13532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Matched input chains but didn't produce a chain"); 13542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Loop over all of the nodes we matched that produced a chain result. 13552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Replace all the chain results with the final chain we ended up with. 13562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 13572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *ChainNode = ChainNodesMatched[i]; 13582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 135982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 136082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ChainNode->getOpcode() == ISD::DELETED_NODE) 136182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 136282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 13632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Don't replace the results of the root node if we're doing a 13642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MorphNodeTo. 13652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNode == NodeToMatch && isMorphNodeTo) 13662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 13672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); 13692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainVal.getValueType() == MVT::Flag) 13702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); 13712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainVal.getValueType() == MVT::Other && "Not a chain?"); 137282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU); 137382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 1374856fb395e46a8d485081acbf11928047d852c636Chris Lattner // If the node became dead and we haven't already seen it, delete it. 1375856fb395e46a8d485081acbf11928047d852c636Chris Lattner if (ChainNode->use_empty() && 1376856fb395e46a8d485081acbf11928047d852c636Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode)) 137782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(ChainNode); 13782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 13792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 13802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 13812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the result produces a flag, update any flag results in the matched 13822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern with the flag result. 13832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputFlag.getNode() != 0) { 13842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Handle any interior nodes explicitly marked. 13852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = FlagResultNodesMatched.size(); i != e; ++i) { 13862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *FRN = FlagResultNodesMatched[i]; 138782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 138882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 138982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (FRN->getOpcode() == ISD::DELETED_NODE) 139082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 139182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 13922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Flag && 13932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Doesn't have a flag result"); 13942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), 139582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, &ISU); 139682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 139719e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner // If the node became dead and we haven't already seen it, delete it. 139819e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner if (FRN->use_empty() && 139919e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN)) 140082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(FRN); 14012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 14032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 140482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (!NowDeadNodes.empty()) 140582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU); 140682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 14072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Match complete!\n"); 14082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 14092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1410c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerenum ChainResult { 1411c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_Simple, 1412c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_InducesCycle, 1413c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_LeadsToInteriorNode 1414c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner}; 1415c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1416c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// WalkChainUsers - Walk down the users of the specified chained node that is 1417c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// part of the pattern we're matching, looking at all of the users we find. 1418c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// This determines whether something is an interior node, whether we have a 1419c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// non-pattern node in between two pattern nodes (which prevent folding because 1420c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// it would induce a cycle) and whether we have a TokenFactor node sandwiched 1421c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// between pattern nodes (in which case the TF becomes part of the pattern). 1422c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// 1423c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// The walk we do here is guaranteed to be small because we quickly get down to 1424c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// already selected nodes "below" us. 1425c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerstatic ChainResult 1426c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerWalkChainUsers(SDNode *ChainedNode, 1427c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &ChainedNodesInPattern, 1428c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &InteriorChainedNodes) { 1429c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainResult Result = CR_Simple; 1430c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1431c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (SDNode::use_iterator UI = ChainedNode->use_begin(), 1432c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner E = ChainedNode->use_end(); UI != E; ++UI) { 1433c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Make sure the use is of the chain, not some other value we produce. 1434c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (UI.getUse().getValueType() != MVT::Other) continue; 1435c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1436c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *User = *UI; 1437c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1438c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we see an already-selected machine node, then we've gone beyond the 1439c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that we're selecting down into the already selected chunk of the 1440c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // DAG. 1441c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->isMachineOpcode() || 1442c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner User->getOpcode() == ISD::HANDLENODE) // Root of the graph. 1443c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1444d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1445d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getOpcode() == ISD::CopyToReg || 1446d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner User->getOpcode() == ISD::CopyFromReg || 14477561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::INLINEASM || 14487561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::EH_LABEL) { 1449d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // If their node ID got reset to -1 then they've already been selected. 1450d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Treat them like a MachineOpcode. 1451d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getNodeId() == -1) 1452d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1453d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner } 1454c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1455c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a TokenFactor, we handle it specially. 1456c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->getOpcode() != ISD::TokenFactor) { 1457c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the node isn't a token factor and isn't part of our pattern, then it 1458c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // must be a random chained node in between two nodes we're selecting. 1459c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This happens when we have something like: 1460c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1461c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // call 1462c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1463c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1464c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Because we structurally match the load/store as a read/modify/write, 1465c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // but the call is chained between them. We cannot fold in this case 1466c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // because it would induce a cycle in the graph. 1467c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainedNodesInPattern.begin(), 1468c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.end(), User)) 1469c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1470c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1471c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise we found a node that is part of our pattern. For example in: 1472c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1473c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1474c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1475c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This would happen when we're scanning down from the load and see the 1476c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store as a user. Record that there is a use of ChainedNode that is 1477c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // part of the pattern and keep scanning uses. 1478c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1479c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1480c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1481c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1482c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1483c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we found a TokenFactor, there are two cases to consider: first if the 1484c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // TokenFactor is just hanging "below" the pattern we're matching (i.e. no 1485c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses of the TF are in our pattern) we just want to ignore it. Second, 1486c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the TokenFactor can be sandwiched in between two chained nodes, like so: 1487c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load chain] 1488c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ 1489c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | 1490c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load] 1491c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1492c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | \ DAG's like cheese 1493c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / \ do you? 1494c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / | 1495c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [TokenFactor] [Op] 1496c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1497c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | | 1498c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1499c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1500c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Store] 1501c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1502c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // In this case, the TokenFactor becomes part of our match and we rewrite it 1503c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // as a new TokenFactor. 1504c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1505c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // To distinguish these two cases, do a recursive walk down the uses. 1506c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) { 1507c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_Simple: 1508c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor are just already-selected nodes, ignore 1509c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // it, it is "below" our pattern. 1510c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1511c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_InducesCycle: 1512c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor lead to nodes that are not part of our 1513c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that are not selected, folding would turn this into a cycle, 1514c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // bail out now. 1515c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1516c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_LeadsToInteriorNode: 1517c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner break; // Otherwise, keep processing. 1518c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1519c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1520c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we know we're in the interesting interior case. The TokenFactor 1521c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // is now going to be considered part of the pattern so that we rewrite its 1522c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses (it may have uses that are not part of the pattern) with the 1523c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ultimate chain result of the generated code. We will also add its chain 1524c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // inputs as inputs to the ultimate TokenFactor we create. 1525c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1526c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.push_back(User); 1527c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1528c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1529c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1530c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1531c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return Result; 1532c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner} 1533c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 15346b30792d2d7d142b8192241e6232aee004f745fbChris Lattner/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains 153500592ec857b4c3f31b46412e2738924238c59983Chris Lattner/// operation for when the pattern matched at least one node with a chains. The 1536c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// input vector contains a list of all of the chained nodes that we match. We 1537c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// must determine if this is a valid thing to cover (i.e. matching it won't 1538c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will 1539c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// be used as the input node chain for the generated nodes. 15406b30792d2d7d142b8192241e6232aee004f745fbChris Lattnerstatic SDValue 1541c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerHandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched, 15426b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SelectionDAG *CurDAG) { 1543c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Walk all of the chained nodes we've matched, recursively scanning down the 1544c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // users of the chain result. This adds any TokenFactor nodes that are caught 1545c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // in between chained nodes to the chained and interior nodes list. 1546c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVector<SDNode*, 3> InteriorChainedNodes; 1547c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1548c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched, 1549c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes) == CR_InducesCycle) 1550c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return SDValue(); // Would induce a cycle. 1551c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 15526b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 1553c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we have walked all the matched nodes and collected TokenFactor nodes 1554c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that we are interested in. Form our input TokenFactor node. 15556b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SmallVector<SDValue, 3> InputChains; 15566b30792d2d7d142b8192241e6232aee004f745fbChris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1557c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Add the input chain of this node to the InputChains list (which will be 1558c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the operands of the generated TokenFactor) if it's not an interior node. 1559c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *N = ChainNodesMatched[i]; 1560c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (N->getOpcode() != ISD::TokenFactor) { 1561c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N)) 1562c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1563c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1564c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise, add the input chain. 1565c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDValue InChain = ChainNodesMatched[i]->getOperand(0); 1566c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner assert(InChain.getValueType() == MVT::Other && "Not a chain"); 15676b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChains.push_back(InChain); 1568c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1569c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1570c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1571c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a token factor, we want to add all inputs of the token factor 1572c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that are not part of the pattern we're matching. 1573c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) { 1574c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(), 15756183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner N->getOperand(op).getNode())) 15766183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner InputChains.push_back(N->getOperand(op)); 1577c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 15786b30792d2d7d142b8192241e6232aee004f745fbChris Lattner } 15796b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 15806b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SDValue Res; 15816b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChains.size() == 1) 15826b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return InputChains[0]; 15836b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(), 15846b30792d2d7d142b8192241e6232aee004f745fbChris Lattner MVT::Other, &InputChains[0], InputChains.size()); 15856b30792d2d7d142b8192241e6232aee004f745fbChris Lattner} 15862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 15873ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner/// MorphNode - Handle morphing a node in place for the selector. 15883ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerSDNode *SelectionDAGISel:: 15893ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerMorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList, 15903ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) { 15913ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // It is possible we're using MorphNodeTo to replace a node with no 15923ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // normal results with one that has a normal result (or we could be 15933ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // adding a chain) and the input could have flags and chains as well. 1594caa8870fe09f5526e611434b6bb9f7040c7dfa60Chris Lattner // In this case we need to shift the operands down. 15953ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // FIXME: This is a horrible hack and broken in obscure cases, no worse 1596a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner // than the old isel though. 15973ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner int OldFlagResultNo = -1, OldChainResultNo = -1; 15983ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 15993ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned NTMNumResults = Node->getNumValues(); 16003ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Node->getValueType(NTMNumResults-1) == MVT::Flag) { 16013ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldFlagResultNo = NTMNumResults-1; 16023ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (NTMNumResults != 1 && 16033ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Node->getValueType(NTMNumResults-2) == MVT::Other) 16043ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-2; 16053ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } else if (Node->getValueType(NTMNumResults-1) == MVT::Other) 16063ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-1; 16073ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 160861c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // Call the underlying SelectionDAG routine to do the transmogrification. Note 160961c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // that this deletes operands of the old node that become dead. 16103ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps); 16113ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16123ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // MorphNodeTo can operate in two ways: if an existing node with the 16133ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // specified operands exists, it can just return it. Otherwise, it 16143ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // updates the node in place to have the requested operands. 16153ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res == Node) { 16163ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // If we updated the node in place, reset the node ID. To the isel, 16173ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // this should be just like a newly allocated machine node. 16183ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res->setNodeId(-1); 16193ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } 16203ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16213ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned ResNumResults = Res->getNumValues(); 16223ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the flag if needed. 16233ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) && OldFlagResultNo != -1 && 16243ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldFlagResultNo != ResNumResults-1) 16253ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldFlagResultNo), 16263ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 16273ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16283ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) != 0) 1629d9cb7ca388c400e3c7a509c00d4cf63031de0ddeBill Wendling --ResNumResults; 16303ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16313ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the chain reference if needed. 16323ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 && 16333ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldChainResultNo != ResNumResults-1) 16343ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo), 16353ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 16363ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16373ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Otherwise, no replacement happened because the node already exists. Replace 16383ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Uses of the old node with the new one. 16393ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res != Node) 16403ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesWith(Node, Res); 16413ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 16423ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner return Res; 16433ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner} 16443ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 1645f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1646f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1647da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1648da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const SmallVectorImpl<SDValue> &RecordedNodes) { 1649da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Accept if it is exactly the same as a previously recorded node. 1650da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 1651da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 1652da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return N == RecordedNodes[RecNo]; 1653da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1654da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1655da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1656da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1657f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1658f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel) { 1659f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]); 1660f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1661f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1662f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckNodePredicate - Implements OP_CheckNodePredicate. 1663f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1664f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1665f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel, SDNode *N) { 1666f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]); 1667f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1668f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1669f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1670f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1671f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDNode *N) { 1672d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 1673d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 1674d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner return N->getOpcode() == Opc; 1675f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1676f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1677f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1678f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1679f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N, const TargetLowering &TLI) { 1680f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1681f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (N.getValueType() == VT) return true; 1682f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1683f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Handle the case when VT is iPTR. 1684f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy(); 1685f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1686f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1687f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1688da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1689da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI, 1690da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned ChildNo) { 1691da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (ChildNo >= N.getNumOperands()) 1692da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return false; // Match fails if out of range child #. 1693da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI); 1694da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1695da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1696da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1697da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1698da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1699da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N) { 1700da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return cast<CondCodeSDNode>(N)->get() == 1701da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner (ISD::CondCode)MatcherTable[MatcherIndex++]; 1702da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1703da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1704da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1705da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1706da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI) { 1707da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1708da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (cast<VTSDNode>(N)->getVT() == VT) 1709da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return true; 1710da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1711da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Handle the case when VT is iPTR. 1712da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy(); 1713da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1714da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1715da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1716f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1717f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N) { 1718f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1719f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (Val & 128) 1720f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1721f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1722f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N); 1723f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return C != 0 && C->getSExtValue() == Val; 1724f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1725f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1726da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1727da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1728da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1729da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1730da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1731da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1732da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1733da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::AND) return false; 1734da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1735da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1736da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val); 1737da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1738da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1739da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1740da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1741da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1742da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1743da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1744da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1745da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1746da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::OR) return false; 1747da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1748da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1749da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val); 1750da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1751da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1752f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// IsPredicateKnownToFail - If we know how and can do so without pushing a 1753f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// scope, evaluate the current node. If the current predicate is known to 1754f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// fail, set Result=true and return anything. If the current predicate is 1755f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// known to pass, set Result=false and return the MatcherIndex to continue 1756f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// with. If the current predicate is unknown, set Result=false and return the 1757f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// MatcherIndex to continue with. 1758f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattnerstatic unsigned IsPredicateKnownToFail(const unsigned char *Table, 1759f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned Index, SDValue N, 1760da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner bool &Result, SelectionDAGISel &SDISel, 1761da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SmallVectorImpl<SDValue> &RecordedNodes){ 1762f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner switch (Table[Index++]) { 1763f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner default: 1764f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = false; 1765f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index-1; // Could not evaluate this predicate. 1766da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckSame: 1767da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckSame(Table, Index, N, RecordedNodes); 1768da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1769f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPatternPredicate: 1770da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckPatternPredicate(Table, Index, SDISel); 1771f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1772f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPredicate: 1773da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode()); 1774f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1775f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckOpcode: 1776f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckOpcode(Table, Index, N.getNode()); 1777f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1778f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckType: 1779f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckType(Table, Index, N, SDISel.TLI); 1780f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1781f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild0Type: 1782f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild1Type: 1783f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild2Type: 1784f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild3Type: 1785f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild4Type: 1786f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild5Type: 1787f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild6Type: 1788da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckChild7Type: 1789da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckChildType(Table, Index, N, SDISel.TLI, 1790da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type); 1791da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1792da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckCondCode: 1793da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckCondCode(Table, Index, N); 1794da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1795da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckValueType: 1796da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckValueType(Table, Index, N, SDISel.TLI); 1797f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1798f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckInteger: 1799f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckInteger(Table, Index, N); 1800f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1801da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckAndImm: 1802da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckAndImm(Table, Index, N, SDISel); 1803da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1804da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckOrImm: 1805da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckOrImm(Table, Index, N, SDISel); 1806da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1807f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 1808f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1809f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1810b35798347ea87b8b6d36155b211016a7769f01abDan Gohmannamespace { 18113ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattnerstruct MatchScope { 18132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// FailIndex - If this match fails, this is the index to continue with. 18142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FailIndex; 18152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NodeStack - The node stack when the scope was formed. 18172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 4> NodeStack; 18182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumRecordedNodes - The number of recorded nodes when the scope was formed. 18202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumRecordedNodes; 18212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumMatchedMemRefs - The number of matched memref entries. 18232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumMatchedMemRefs; 18242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// InputChain/InputFlag - The current chain/flag 18262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 18272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty. 18292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasChainNodesMatched, HasFlagResultNodesMatched; 18302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner}; 18312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1832b35798347ea87b8b6d36155b211016a7769f01abDan Gohman} 1833b35798347ea87b8b6d36155b211016a7769f01abDan Gohman 18342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSDNode *SelectionDAGISel:: 18352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable, 18362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned TableSize) { 18372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: Should these even be selected? Handle these cases in the caller? 18382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (NodeToMatch->getOpcode()) { 18392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner default: 18402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 18412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::EntryToken: // These nodes remain the same. 18422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::BasicBlock: 18432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::Register: 18443b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::VALUETYPE: 18453b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::CONDCODE: 18462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::HANDLENODE: 1847decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner case ISD::MDNODE_SDNODE: 18482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstant: 18492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantFP: 18502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantPool: 18512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetFrameIndex: 18522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetExternalSymbol: 18532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetBlockAddress: 18542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetJumpTable: 18552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalTLSAddress: 18562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalAddress: 18572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TokenFactor: 18582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyFromReg: 18592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyToReg: 18607561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner case ISD::EH_LABEL: 1861d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch->setNodeId(-1); // Mark selected. 18622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 18632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertSext: 18642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertZext: 18652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0), 18662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getOperand(0)); 18672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 18682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch); 18692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::UNDEF: return Select_UNDEF(NodeToMatch); 18702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 18712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeToMatch->isMachineOpcode() && "Node already selected!"); 18732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Set up the node stack with NodeToMatch as the only node on the stack. 18752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> NodeStack; 18762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue N = SDValue(NodeToMatch, 0); 18772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 18782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchScopes - Scopes used when matching, if a match failure happens, this 18802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // indicates where to continue checking. 18812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MatchScope, 8> MatchScopes; 18822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // RecordedNodes - This is the set of nodes that have been recorded by the 18842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // state machine. 18852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> RecordedNodes; 18862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchedMemRefs - This is the set of MemRef's we've seen in the input 18882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern. 18892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MachineMemOperand*, 2> MatchedMemRefs; 18902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // These are the current input chain and flag for use when generating nodes. 18922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Various Emit operations change these. For example, emitting a copytoreg 18932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // uses and updates these. 18942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 18952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 18962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // ChainNodesMatched - If a pattern matches nodes that have input/output 18972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains, the OPC_EmitMergeInputChains operation is emitted which indicates 18982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // which ones they are. The result is captured into this list so that we can 18992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // update the chain results when the pattern is complete. 19002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> ChainNodesMatched; 19012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> FlagResultNodesMatched; 19022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Starting pattern match on root node: "; 19042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->dump(CurDAG); 19052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner errs() << '\n'); 19062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19077390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Determine where to start the interpreter. Normally we start at opcode #0, 19087390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // but if the state machine starts with an OPC_SwitchOpcode, then we 19097390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // accelerate the first lookup (which is guaranteed to be hot) with the 19107390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // OpcodeOffset table. 19112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned MatcherIndex = 0; 19127390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19137390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (!OpcodeOffset.empty()) { 19147390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Already computed the OpcodeOffset table, just index into it. 19157390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 19167390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 19177390eebd49b786f3293d24f76fedb02fe183468cChris Lattner DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n"); 19187390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19197390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } else if (MatcherTable[0] == OPC_SwitchOpcode) { 19207390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Otherwise, the table isn't computed, but the state machine does start 19217390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // with an OPC_SwitchOpcode instruction. Populate the table now, since this 19227390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // is the first time we're selecting an instruction. 19237390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned Idx = 1; 19247390eebd49b786f3293d24f76fedb02fe183468cChris Lattner while (1) { 19257390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the size of this case. 19267390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned CaseSize = MatcherTable[Idx++]; 19277390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize & 128) 19287390eebd49b786f3293d24f76fedb02fe183468cChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, Idx); 19297390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize == 0) break; 19307390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19317390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the opcode, add the index to the table. 1932d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[Idx++]; 1933d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[Idx++] << 8; 19347390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (Opc >= OpcodeOffset.size()) 19357390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset.resize((Opc+1)*2); 19367390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset[Opc] = Idx; 19377390eebd49b786f3293d24f76fedb02fe183468cChris Lattner Idx += CaseSize; 19387390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 19397390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19407390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Okay, do the lookup for the first opcode. 19417390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 19427390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 19437390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 19447390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 19452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 19462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(MatcherIndex < TableSize && "Invalid index"); 194719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#ifndef NDEBUG 194819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman unsigned CurrentOpcodeIndex = MatcherIndex; 194919b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#endif 19502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++]; 19512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (Opcode) { 19522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_Scope: { 1953f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Okay, the semantics of this operation are that we should push a scope 1954f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // then evaluate the first child. However, pushing a scope only to have 1955f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // the first check fail (which then pops it) is inefficient. If we can 1956f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // determine immediately that the first check (or first several) will 1957f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // immediately fail, don't even bother pushing a scope for them. 1958f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned FailIndex; 1959f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1960f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner while (1) { 1961f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 1962f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip & 128) 1963f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 1964f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Found the end of the scope with no match. 1965f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip == 0) { 1966f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = 0; 1967f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 1968f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 1969f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1970f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = MatcherIndex+NumToSkip; 1971f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1972a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner unsigned MatcherIndexOfPredicate = MatcherIndex; 1973a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner (void)MatcherIndexOfPredicate; // silence warning. 1974a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner 1975f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If we can't evaluate this predicate without pushing a scope (e.g. if 1976f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // it is a 'MoveParent') or if the predicate succeeds on this node, we 1977f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // push the scope and evaluate the full predicate chain. 1978f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner bool Result; 1979f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N, 1980da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result, *this, RecordedNodes); 1981f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!Result) 1982f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 1983f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1984a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner DEBUG(errs() << " Skipped scope entry (due to false predicate) at " 1985a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << "index " << MatcherIndexOfPredicate 1986a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << ", continuing at " << FailIndex << "\n"); 1987bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 1988f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1989f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Otherwise, we know that this case of the Scope is guaranteed to fail, 1990f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // move to the next case. 1991f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = FailIndex; 1992f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 1993f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1994f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If the whole scope failed to match, bail. 1995f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (FailIndex == 0) break; 1996f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 19972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Push a MatchScope which indicates where to go if the first child fails 19982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // to match. 19992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope NewEntry; 2000f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NewEntry.FailIndex = FailIndex; 20012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); 20022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumRecordedNodes = RecordedNodes.size(); 20032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumMatchedMemRefs = MatchedMemRefs.size(); 20042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputChain = InputChain; 20052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputFlag = InputFlag; 20062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty(); 20072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasFlagResultNodesMatched = !FlagResultNodesMatched.empty(); 20082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.push_back(NewEntry); 20092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordNode: 20122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Remember this node, it may end up being an operand in the pattern. 20132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N); 20142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild0: case OPC_RecordChild1: 20172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild2: case OPC_RecordChild3: 20182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild4: case OPC_RecordChild5: 20192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild6: case OPC_RecordChild7: { 20202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = Opcode-OPC_RecordChild0; 20212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 20222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 20232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N->getOperand(ChildNo)); 20252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordMemRef: 20282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand()); 20292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CaptureFlagInput: 20322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the current node has an input flag, capture it in InputFlag. 20332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (N->getNumOperands() != 0 && 20342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag) 20352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = N->getOperand(N->getNumOperands()-1); 20362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveChild: { 20392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = MatcherTable[MatcherIndex++]; 20402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 20412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 20422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = N.getOperand(ChildNo); 20432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 20442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveParent: 20482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Pop the current node off the NodeStack. 20492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.pop_back(); 20502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeStack.empty() && "Node stack imbalance!"); 20512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 20522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2054da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckSame: 2055da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break; 20562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPatternPredicate: 2058f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break; 20592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPredicate: 2061f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this, 2062f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner N.getNode())) 2063f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 20642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 206557bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner case OPC_CheckComplexPat: { 206657bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned CPNum = MatcherTable[MatcherIndex++]; 206757bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 206857bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat"); 206957bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo], CPNum, 207057bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner RecordedNodes)) 20712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 20722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 207357bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner } 20742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckOpcode: 2075f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break; 2076f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner continue; 2077f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2078f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckType: 2079f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break; 20802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 20812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2082eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner case OPC_SwitchOpcode: { 2083eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CurNodeOpcode = N.getOpcode(); 20847d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2085eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CaseSize; 2086eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner while (1) { 2087eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Get the size of this case. 2088eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2089eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize & 128) 2090eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2091eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2092eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2093d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2094d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2095d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner 2096eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // If the opcode matches, then we will execute this case. 2097d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner if (CurNodeOpcode == Opc) 2098eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner break; 2099eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2100eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, skip over this case. 2101eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner MatcherIndex += CaseSize; 2102eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2103eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2104cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2105eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2106eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2107eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, execute the case we found. 2108eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner DEBUG(errs() << " OpcodeSwitch from " << SwitchStart 2109eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner << " to " << MatcherIndex << "\n"); 2110eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner continue; 2111eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2112eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2113cfe2eab7446dedc471592fe702fefef783383171Chris Lattner case OPC_SwitchType: { 2114cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CurNodeVT = N.getValueType().getSimpleVT().SimpleTy; 2115cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2116cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned CaseSize; 2117cfe2eab7446dedc471592fe702fefef783383171Chris Lattner while (1) { 2118cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Get the size of this case. 2119cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2120cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize & 128) 2121cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2122cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2123cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2124cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CaseVT = 2125cfe2eab7446dedc471592fe702fefef783383171Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2126cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseVT == MVT::iPTR) 2127cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseVT = TLI.getPointerTy().SimpleTy; 2128cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2129cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If the VT matches, then we will execute this case. 2130cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CurNodeVT == CaseVT) 2131cfe2eab7446dedc471592fe702fefef783383171Chris Lattner break; 2132cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2133cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, skip over this case. 2134cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MatcherIndex += CaseSize; 2135cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 2136cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2137cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2138cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2139cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2140cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, execute the case we found. 2141cfe2eab7446dedc471592fe702fefef783383171Chris Lattner DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString() 2142cfe2eab7446dedc471592fe702fefef783383171Chris Lattner << "] from " << SwitchStart << " to " << MatcherIndex<<'\n'); 2143cfe2eab7446dedc471592fe702fefef783383171Chris Lattner continue; 2144cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 21452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild0Type: case OPC_CheckChild1Type: 21462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild2Type: case OPC_CheckChild3Type: 21472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild4Type: case OPC_CheckChild5Type: 2148da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckChild6Type: case OPC_CheckChild7Type: 2149da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI, 2150da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Opcode-OPC_CheckChild0Type)) 2151f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 21522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckCondCode: 2154da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break; 21552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2156da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckValueType: 2157da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break; 21582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2159f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckInteger: 2160f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break; 21612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2162da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckAndImm: 2163da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break; 21642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2165da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckOrImm: 2166da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break; 21672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckFoldableChainNode: { 21702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeStack.size() != 1 && "No parent node"); 21712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Verify that all intermediate nodes between the root and this one have 21722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // a single use. 21732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasMultipleUses = false; 21742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) 21752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!NodeStack[i].hasOneUse()) { 21762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner HasMultipleUses = true; 21772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 21782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 21792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (HasMultipleUses) break; 21802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see that the target thinks this is profitable to fold and that 21822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we can fold it without inducing cycles in the graph. 21832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(), 21842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch) || 21852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(), 2186d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman NodeToMatch, OptLevel, 2187d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman true/*We validate our own chains*/)) 21882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 21892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 21912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 21922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitInteger: { 21932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 21942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 21952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 21962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Val & 128) 21972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 21982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT)); 21992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitRegister: { 22022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 22032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 22042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RegNo = MatcherTable[MatcherIndex++]; 22052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT)); 22062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitConvertToTarget: { 22102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Convert from IMM/FPIMM to target version. 22112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 22122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 22132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Imm = RecordedNodes[RecNo]; 22142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Imm->getOpcode() == ISD::Constant) { 22162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue(); 22172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstant(Val, Imm.getValueType()); 22182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (Imm->getOpcode() == ISD::ConstantFP) { 22192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue(); 22202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType()); 22212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(Imm); 22242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2227aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0 2228aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1 2229aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // These are space-optimized forms of OPC_EmitMergeInputChains. 2230aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(InputChain.getNode() == 0 && 2231aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 2232aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(ChainNodesMatched.empty() && 2233aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "Should only have one EmitMergeInputChains per match"); 2234aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2235aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Read all of the chained nodes. 2236aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1; 2237aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2238aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 2239aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2240aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // FIXME: What if other value results of the node have uses not matched 2241aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // by this pattern? 2242aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2243aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 2244aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.clear(); 2245aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; 2246aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2247aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2248aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Merge the input chains if they are not intra-pattern references. 2249aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 2250aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2251aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (InputChain.getNode() == 0) 2252aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; // Failed to merge. 2253aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner continue; 2254aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2255aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 22562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitMergeInputChains: { 22572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() == 0 && 22582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 22592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // This node gets a list of nodes we matched in the input that have 22602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains. We want to token factor all of the input chains to these nodes 22612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // together. However, if any of the input chains is actually one of the 22622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // nodes matched in this pattern, then we have an intra-match reference. 22632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Ignore these because the newly token factored chain should not refer to 22642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // the old nodes. 22652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumChains = MatcherTable[MatcherIndex++]; 22662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NumChains != 0 && "Can't TF zero chains"); 22672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainNodesMatched.empty() && 22692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Should only have one EmitMergeInputChains per match"); 22702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read all of the chained nodes. 227200592ec857b4c3f31b46412e2738924238c59983Chris Lattner for (unsigned i = 0; i != NumChains; ++i) { 227300592ec857b4c3f31b46412e2738924238c59983Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 22742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 22752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 22762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: What if other value results of the node have uses not matched 22782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // by this pattern? 22792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 22802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 22812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 22822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 22832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22856b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 22866b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // If the inner loop broke out, the match fails. 22876b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (ChainNodesMatched.empty()) 22886b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; 22892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22906b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // Merge the input chains if they are not intra-pattern references. 22916b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 22926b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 22936b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChain.getNode() == 0) 22946b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; // Failed to merge. 22952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitCopyToReg: { 23002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned DestPhysReg = MatcherTable[MatcherIndex++]; 23032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputChain.getNode() == 0) 23052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getEntryNode(); 23062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(), 23082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DestPhysReg, RecordedNodes[RecNo], 23092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag); 23102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = InputChain.getValue(1); 23122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNodeXForm: { 23162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned XFormNo = MatcherTable[MatcherIndex++]; 23172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 23192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo)); 23202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNode: 23242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MorphNodeTo: { 232514df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner uint16_t TargetOpc = MatcherTable[MatcherIndex++]; 232614df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 23272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned EmitNodeInfo = MatcherTable[MatcherIndex++]; 23282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the result VT list. 23292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumVTs = MatcherTable[MatcherIndex++]; 23302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<EVT, 4> VTs; 23312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumVTs; ++i) { 23322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 23332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 23342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy; 23352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(VT); 23362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 23392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Other); 23402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) 23412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Flag); 23422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23437d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // This is hot code, so optimize the two most common cases of 1 and 2 23447d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // results. 23457d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner SDVTList VTList; 23467d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner if (VTs.size() == 1) 23477d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0]); 23487d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else if (VTs.size() == 2) 23497d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0], VTs[1]); 23507d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else 23517d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs.data(), VTs.size()); 23522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the operand list. 23542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumOps = MatcherTable[MatcherIndex++]; 23552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> Ops; 23562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumOps; ++i) { 23572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 23582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 23592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 23602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid EmitNode"); 23622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(RecordedNodes[RecNo]); 23632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If there are variadic operands to add, handle them now. 23662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_VariadicInfo) { 23672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Determine the start index to copy from. 23682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo); 23692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0; 23702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->getNumOperands() >= FirstOpToCopy && 23712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Invalid variadic node"); 23722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Copy all of the variadic operands, not including a potential flag 23732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // input. 23742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands(); 23752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner i != e; ++i) { 23762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue V = NodeToMatch->getOperand(i); 23772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (V.getValueType() == MVT::Flag) break; 23782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(V); 23792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this has chain/flag inputs, add them. 23832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 23842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputChain); 23852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if ((EmitNodeInfo & OPFL_FlagInput) && InputFlag.getNode() != 0) 23862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputFlag); 23872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Create the node. 23892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *Res = 0; 23902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode != OPC_MorphNodeTo) { 23912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this is a normal EmitNode command, just create the new node and 23922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // add the results to the RecordedNodes list. 23932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(), 23942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTList, Ops.data(), Ops.size()); 23952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Add all the non-flag/non-chain results to the RecordedNodes list. 23972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = VTs.size(); i != e; ++i) { 23982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break; 23992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(SDValue(Res, i)); 24002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else { 24033ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(), 24043ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner EmitNodeInfo); 24052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the node had chain/flag results, update our notion of the current 24082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chain and flag. 240982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) { 24102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = SDValue(Res, VTs.size()-1); 24112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 24122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-2); 24132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (EmitNodeInfo & OPFL_Chain) 24142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-1); 24152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the OPFL_MemRefs flag is set on this node, slap all of the 24172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // accumulated memrefs onto it. 24182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // 24192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: This is vastly incorrect for patterns with multiple outputs 24202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // instructions that access memory and for ComplexPatterns that match 24212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // loads. 24222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_MemRefs) { 24232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MachineSDNode::mmo_iterator MemRefs = 24242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MF->allocateMemRefsArray(MatchedMemRefs.size()); 24252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs); 24262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner cast<MachineSDNode>(Res) 24272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size()); 24282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << " " 24312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created") 24322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << " node: "; Res->dump(CurDAG); errs() << "\n"); 24332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this was a MorphNodeTo then we're completely done! 24352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode == OPC_MorphNodeTo) { 24362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 24372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 243882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, true); 243982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner return Res; 24402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MarkFlagResults: { 24462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumNodes = MatcherTable[MatcherIndex++]; 24472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read and remember all the flag-result nodes. 24492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumNodes; ++i) { 24502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 24512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 24522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 24532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 24552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 24562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CompleteMatch: { 24612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // The match has been completed, and any new nodes (if any) have been 24622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created. Patch up references to the matched dag to use the newly 24632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created nodes. 24642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumResults = MatcherTable[MatcherIndex++]; 24652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumResults; ++i) { 24672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ResSlot = MatcherTable[MatcherIndex++]; 24682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ResSlot & 128) 24692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex); 24702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame"); 24722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Res = RecordedNodes[ResSlot]; 24732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2474b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner assert(i < NodeToMatch->getNumValues() && 2475b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Other && 2476b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Flag && 2477b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner "Invalid number of results to complete!"); 24782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert((NodeToMatch->getValueType(i) == Res.getValueType() || 24792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i) == MVT::iPTR || 24802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType() == MVT::iPTR || 24812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i).getSizeInBits() == 24822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType().getSizeInBits()) && 24832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "invalid replacement"); 24842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res); 24852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the root node defines a flag, add it to the flag nodes to update 24882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // list. 24892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Flag) 24902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(NodeToMatch); 24912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 24932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 249482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, false); 24952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->use_empty() && 24972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Didn't replace all uses of the node?"); 24982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: We just return here, which interacts correctly with SelectRoot 25002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // above. We should fix this to not return an SDNode* anymore. 25012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 25022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the code reached this point, then the match failed. See if there is 25062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // another child to try in the current 'Scope', otherwise pop it until we 25072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // find a case to check. 250819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n"); 2509bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 25102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 25112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (MatchScopes.empty()) { 25122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CannotYetSelect(NodeToMatch); 25132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 25142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Restore the interpreter state back to the point where the scope was 25172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // formed. 25182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope &LastScope = MatchScopes.back(); 25192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.resize(LastScope.NumRecordedNodes); 25202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.clear(); 25212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end()); 25222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 25232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size()) 25252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.resize(LastScope.NumMatchedMemRefs); 25262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatcherIndex = LastScope.FailIndex; 25272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 252819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Continuing at " << MatcherIndex << "\n"); 252919b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman 25302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = LastScope.InputChain; 25312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = LastScope.InputFlag; 25322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasChainNodesMatched) 25332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 25342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasFlagResultNodesMatched) 25352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.clear(); 25362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see what the offset is at the new MatcherIndex. If it is zero 25382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we have reached the end of this scope, otherwise we have another child 25392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // in the current scope to try. 25402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 25412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip & 128) 25422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 25432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If we have another child in this scope to match, update FailIndex and 25452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // try it. 25462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip != 0) { 25472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner LastScope.FailIndex = MatcherIndex+NumToSkip; 25482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 25492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // End of this scope, pop it and try the next child in the containing 25522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // scope. 25532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.pop_back(); 25542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 25572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2560eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelect(SDNode *N) { 2561e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::string msg; 2562e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman raw_string_ostream Msg(msg); 2563e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman Msg << "Cannot yet select: "; 25642c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner 25652c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN && 25662c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_WO_CHAIN && 25672c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_VOID) { 25682c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->printrFull(Msg, CurDAG); 25692c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } else { 25702c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other; 25712c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner unsigned iid = 25722c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue(); 25732c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (iid < Intrinsic::num_intrinsics) 25742c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid); 25752c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo()) 25762c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "target intrinsic %" << TII->getName(iid); 25772c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else 25782c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "unknown intrinsic #" << iid; 25792c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } 258075361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error(Msg.str()); 2581e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 2582e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 25831997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 2584