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