SelectionDAGISel.cpp revision decc2671516e6c52ee2f29f7746f8d02753845ea
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 81c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 91c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This implements the SelectionDAGISel class. 111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define DEBUG_TYPE "isel" 1584fbac580941548a6ab1121ed3b0ffdc4e2bc080Dan Gohman#include "ScheduleDAGSDNodes.h" 162048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman#include "SelectionDAGBuilder.h" 176277eb2bb997a5da0808a8a5a57f18fd9faaf336Dan Gohman#include "FunctionLoweringInfo.h" 1884fbac580941548a6ab1121ed3b0ffdc4e2bc080Dan Gohman#include "llvm/CodeGen/SelectionDAGISel.h" 19c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 20713f043c16220b746804f668a72f4e0344cbe4d1Devang Patel#include "llvm/Analysis/DebugInfo.h" 215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 22adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2536ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 26ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 3075c478a96a542dc386152e00518441e63d22058dChris Lattner#include "llvm/LLVMContext.h" 3178eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman#include "llvm/CodeGen/FastISel.h" 325a29c9eed157af51a8d338b5a225b146881819e8Gordon Henriksen#include "llvm/CodeGen/GCStrategy.h" 335eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen#include "llvm/CodeGen/GCMetadata.h" 341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 35ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman#include "llvm/CodeGen/MachineFunctionAnalysis.h" 361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineJumpTableInfo.h" 3984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 4084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 41fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman#include "llvm/CodeGen/ScheduleHazardRecognizer.h" 42eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 446f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 47e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman#include "llvm/Target/TargetIntrinsicInfo.h" 481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 51124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 52a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 53db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 547d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin#include "llvm/Support/ErrorHandling.h" 55db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/MathExtras.h" 56db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 57ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar#include "llvm/Support/raw_ostream.h" 58c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner#include "llvm/ADT/Statistic.h" 597e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 62c19ae9d91d30bc008e0be5f5d4727f333199f64cChris LattnerSTATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on"); 63bed993d8a4ede75a24a142437057b42498ce5b9fChris LattnerSTATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path"); 64c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner 65ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 66293d5f8bc02a9148238b2c79484637f56de65b9cDan GohmanEnableFastISelVerbose("fast-isel-verbose", cl::Hidden, 67d659d50482e2f9edf8f436e4a1aa30c68c6d020bDan Gohman cl::desc("Enable verbose messages in the \"fast\" " 68293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohman "instruction selector")); 69293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohmanstatic cl::opt<bool> 704344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan GohmanEnableFastISelAbort("fast-isel-abort", cl::Hidden, 714344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman cl::desc("Enable abort calls when \"fast\" instruction fails")); 728a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic cl::opt<bool> 73df8ed024735b651d6e0082262d4e7a00b2fa4d32Evan ChengSchedLiveInCopies("schedule-livein-copies", cl::Hidden, 748a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman cl::desc("Schedule copies of livein registers"), 758a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman cl::init(false)); 76ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 77da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 787944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic 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")); 82462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 83462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 84462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 85462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 86462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 87462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 88462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 89462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 90462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 91462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 92462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 9325cf2275ff7de3de3bc0e508abaf457413d74725Duncan SandsViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden, 9425cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands cl::desc("Pop up a window to show dags before the post legalize types" 9525cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands " dag combine pass")); 9625cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sandsstatic cl::opt<bool> 97a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 98a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 99a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 100a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 101a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 1023e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 1033e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 1045bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 1057944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 106462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 107462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 108462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 10925cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombineLT = false, 110462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 111462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 1127944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 1137944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 114eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 115eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 116eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 117eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 118eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 119eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 120eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 121eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 122eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 123eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 124eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 125eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 126844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 127844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 128844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 129844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 130844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 131844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 13213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 133844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 134b8cab9227a0f6ffbdaae33e3c64268e265008a6aDan GohmandefaultListDAGScheduler("default", "Best scheduler for the target", 135844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1364ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 137f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohmannamespace llvm { 138f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman //===--------------------------------------------------------------------===// 139f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// createDefaultScheduler - This creates an instruction scheduler appropriate 140f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// for the target. 14147ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS, 14298a366d547772010e94609e4584489b3e5ce0043Bill Wendling CodeGenOpt::Level OptLevel) { 143e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman const TargetLowering &TLI = IS->getTargetLowering(); 144e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman 14598a366d547772010e94609e4584489b3e5ce0043Bill Wendling if (OptLevel == CodeGenOpt::None) 146be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createFastDAGScheduler(IS, OptLevel); 1479e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) 148be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createTDListDAGScheduler(IS, OptLevel); 1499e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman assert(TLI.getSchedulingPreference() == 150187361b056823df4ff292561fe47468dad956872Bill Wendling TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 151be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createBURRListDAGScheduler(IS, OptLevel); 1523a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 1531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 155ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 156533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// that mark instructions with the 'usesCustomInserter' flag. These 157025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 158025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 159533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// 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. 161533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// When new basic blocks are inserted and the edges from MBB to its successors 162533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// are modified, the method should insert pairs of <OldSucc, NewSucc> into the 163533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// DenseMap. 164ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 165fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng MachineBasicBlock *MBB, 166fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*> *EM) const { 167f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#ifndef NDEBUG 1681a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "If a target marks an instruction with " 169533297b58da8c74bec65551e1aface9801fc2259Dan Gohman "'usesCustomInserter', it must implement " 170f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "TargetLowering::EmitInstrWithCustomInserter!"; 171f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#endif 172c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable(0); 173a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar return 0; 174025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 175025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 1768a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// EmitLiveInCopy - Emit a copy for a live in physical register. If the 1778a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// physical register has only a single copy use, then coalesced the copy 1788a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// if possible. 1798a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic void EmitLiveInCopy(MachineBasicBlock *MBB, 1808a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineBasicBlock::iterator &InsertPos, 1818a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned VirtReg, unsigned PhysReg, 1828a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC, 1838a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman DenseMap<MachineInstr*, unsigned> &CopyRegMap, 1848a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const MachineRegisterInfo &MRI, 1858a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI, 1868a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII) { 1878a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned NumUses = 0; 1888a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineInstr *UseMI = NULL; 1898a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::use_iterator UI = MRI.use_begin(VirtReg), 1908a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman UE = MRI.use_end(); UI != UE; ++UI) { 1918a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman UseMI = &*UI; 1928a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (++NumUses > 1) 1938a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman break; 1948a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 1958a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 1968a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // If the number of uses is not one, or the use is not a move instruction, 1978a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // don't coalesce. Also, only coalesce away a virtual register to virtual 1988a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // register copy. 1998a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman bool Coalesced = false; 20004ee5a1d9267e5e6fab8f088095fcb83c3c5cbd1Evan Cheng unsigned SrcReg, DstReg, SrcSubReg, DstSubReg; 2018a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (NumUses == 1 && 20204ee5a1d9267e5e6fab8f088095fcb83c3c5cbd1Evan Cheng TII.isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubReg, DstSubReg) && 2038a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman TargetRegisterInfo::isVirtualRegister(DstReg)) { 2048a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman VirtReg = DstReg; 2058a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman Coalesced = true; 2068a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2078a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2088a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // Now find an ideal location to insert the copy. 2098a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineBasicBlock::iterator Pos = InsertPos; 2108a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman while (Pos != MBB->begin()) { 2118a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineInstr *PrevMI = prior(Pos); 2128a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman DenseMap<MachineInstr*, unsigned>::iterator RI = CopyRegMap.find(PrevMI); 2138a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copyRegToReg might emit multiple instructions to do a copy. 2148a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned CopyDstReg = (RI == CopyRegMap.end()) ? 0 : RI->second; 2158a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (CopyDstReg && !TRI.regsOverlap(CopyDstReg, PhysReg)) 2168a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // This is what the BB looks like right now: 2178a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1024 = mov r0 2188a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // ... 2198a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1 = mov r1024 2208a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // 2218a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // We want to insert "r1025 = mov r1". Inserting this copy below the 2228a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // move to r1024 makes it impossible for that move to be coalesced. 2238a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // 2248a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1025 = mov r1 2258a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1024 = mov r0 2268a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // ... 2278a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1 = mov 1024 2288a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r2 = mov 1025 2298a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman break; // Woot! Found a good location. 2308a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman --Pos; 2318a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2328a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 233f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin bool Emitted = TII.copyRegToReg(*MBB, Pos, VirtReg, PhysReg, RC, RC); 234f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin assert(Emitted && "Unable to issue a live-in copy instruction!\n"); 235f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin (void) Emitted; 236a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 237931424a7d8b8b15ddda7308d6c5b08277d8bdc0eZhongxing Xu CopyRegMap.insert(std::make_pair(prior(Pos), VirtReg)); 2388a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (Coalesced) { 2398a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (&*InsertPos == UseMI) ++InsertPos; 2408a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MBB->erase(UseMI); 2418a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2428a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman} 2438a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2448a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// EmitLiveInCopies - If this is the first basic block in the function, 2458a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// and if it has live ins that need to be copied into vregs, emit the 2468a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// copies into the block. 2478a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic void EmitLiveInCopies(MachineBasicBlock *EntryMBB, 2488a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const MachineRegisterInfo &MRI, 2498a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI, 2508a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII) { 2518a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (SchedLiveInCopies) { 2528a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan 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(); 2558a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator LI = MRI.livein_begin(), 2568a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = MRI.livein_end(); LI != E; ++LI) 2578a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (LI->second) { 2588a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC = MRI.getRegClass(LI->second); 2598a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman EmitLiveInCopy(EntryMBB, InsertPos, LI->second, LI->first, 2608a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman RC, CopyRegMap, MRI, TRI, TII); 2618a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2628a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } else { 2638a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // Emit the copies into the top of the block. 2648a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator LI = MRI.livein_begin(), 2658a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = MRI.livein_end(); LI != E; ++LI) 2668a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (LI->second) { 2678a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC = MRI.getRegClass(LI->second); 268f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin bool Emitted = TII.copyRegToReg(*EntryMBB, EntryMBB->begin(), 269f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin LI->second, LI->first, RC, RC); 270f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin assert(Emitted && "Unable to issue a live-in copy instruction!\n"); 271f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin (void) Emitted; 2728a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2738a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2748a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman} 2758a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2767041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2777041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 2787041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28098a366d547772010e94609e4584489b3e5ce0043Bill WendlingSelectionDAGISel::SelectionDAGISel(TargetMachine &tm, CodeGenOpt::Level OL) : 281ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()), 2827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 2837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG(new SelectionDAG(TLI, *FuncInfo)), 2842048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB(new SelectionDAGBuilder(*CurDAG, TLI, *FuncInfo, OL)), 2857c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 286be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling OptLevel(OL), 2877c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DAGSize(0) 2887c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman{} 2897c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 2907c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 2912048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman delete SDB; 2927c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 2937c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 2947c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 2957c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 296e50ed30282bb5b4a9ed952580523f2dda16215acOwen Andersonunsigned SelectionDAGISel::MakeReg(EVT VT) { 29784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 2981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 300495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 301c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 302a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<AliasAnalysis>(); 3035eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 304a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<GCModuleInfo>(); 305ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass::getAnalysisUsage(AU); 306495a0b51915eb763576874f29192820b731edc22Chris Lattner} 3071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 308ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohmanbool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) { 309ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman Function &Fn = *mf.getFunction(); 310ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman 3114344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman // Do some sanity-checking on the command-line options. 3124344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelVerbose || EnableFastISel) && 3134344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-verbose requires -fast-isel"); 3144344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelAbort || EnableFastISel) && 3154344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-abort requires -fast-isel"); 3164344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman 3175f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 3185f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 3195f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 320ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MF = &mf; 3218a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII = *TM.getInstrInfo(); 3228a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI = *TM.getRegisterInfo(); 3238a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 324f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (Fn.hasGC()) 325f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman GFI = &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn); 326ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 3275eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = 0; 32879ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman RegInfo = &MF->getRegInfo(); 3291a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n"); 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 331de6e783b2490447866b592cd39855e6f4d25efffChris Lattner CurDAG->init(*MF); 3326277eb2bb997a5da0808a8a5a57f18fd9faaf336Dan Gohman FuncInfo->set(Fn, *MF, EnableFastISel); 3332048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->init(GFI, *AA); 3341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3351532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 3361532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 3371532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 3387c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 3399fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 340de6e783b2490447866b592cd39855e6f4d25efffChris Lattner SelectAllBasicBlocks(Fn, *MF, TII); 341edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3428a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // If the first basic block in the function has live ins that need to be 3438a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 3448a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 34579ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman EmitLiveInCopies(MF->begin(), *RegInfo, TRI, TII); 3468a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 347ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 3488a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 3498a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = RegInfo->livein_end(); I != E; ++I) 35079ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman MF->begin()->addLiveIn(I->first); 351ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 352f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 3537c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman assert(FuncInfo->CatchInfoFound.size() == FuncInfo->CatchInfoLost.size() && 354f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 355f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 356f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3577c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->clear(); 3587c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 3591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 3601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36207f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// SetDebugLoc - Update MF's and SDB's DebugLocs if debug information is 36307f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// attached with this instruction. 36423dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattnerstatic void SetDebugLoc(Instruction *I, SelectionDAGBuilder *SDB, 3650eb419800ae51d6e0e00a656ede0627483755361Chris Lattner FastISel *FastIS, MachineFunction *MF) { 366de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner DebugLoc DL = I->getDebugLoc(); 367de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner if (DL.isUnknown()) return; 36823dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner 369de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner SDB->setCurDebugLoc(DL); 3700eb419800ae51d6e0e00a656ede0627483755361Chris Lattner 37123dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner if (FastIS) 372de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner FastIS->setCurDebugLoc(DL); 3730eb419800ae51d6e0e00a656ede0627483755361Chris Lattner 37423dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner // If the function doesn't have a default debug location yet, set 37523dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner // it. This is kind of a hack. 37623dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner if (MF->getDefaultDebugLoc().isUnknown()) 377de4845c163a5847c82d7ce10ed0c320098bce6e0Chris Lattner MF->setDefaultDebugLoc(DL); 37807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman} 37907f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 38007f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// ResetDebugLoc - Set MF's and SDB's DebugLocs to Unknown. 3813990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattnerstatic void ResetDebugLoc(SelectionDAGBuilder *SDB, FastISel *FastIS) { 382a4f2bb08de92ccec21cbb3d0a9518384b0173660Chris Lattner SDB->setCurDebugLoc(DebugLoc()); 38307f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman if (FastIS) 384a4f2bb08de92ccec21cbb3d0a9518384b0173660Chris Lattner FastIS->setCurDebugLoc(DebugLoc()); 38507f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman} 38607f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 387f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, 388f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator Begin, 389b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman BasicBlock::iterator End, 390b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool &HadTailCall) { 3912048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 392f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 39398ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 39498ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // as a tail call, cease emitting nodes for this block. 3952048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (BasicBlock::iterator I = Begin; I != End && !SDB->HasTailCall; ++I) { 39623dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner SetDebugLoc(I, SDB, 0, MF); 39707f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 39807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman if (!isa<TerminatorInst>(I)) { 3992048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visit(*I); 40007f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 40107f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // Set the current debug location back to "unknown" so that it doesn't 40207f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // spuriously apply to subsequent instructions. 40307f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, 0); 40407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman } 405123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel } 406f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 4072048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->HasTailCall) { 40898ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Ensure that all instructions which are used outside of their defining 40998ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // blocks are available as virtual registers. Invoke is handled elsewhere. 41098ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman for (BasicBlock::iterator I = Begin; I != End; ++I) 41198ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (!isa<PHINode>(I) && !isa<InvokeInst>(I)) 4122048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->CopyToExportRegsIfNeeded(I); 413f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 41498ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Handle PHI nodes in successor blocks. 41598ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (End == LLVMBB->end()) { 41698ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman HandlePHINodesInSuccessorBlocks(LLVMBB); 4173df24e667f04a7003342b534310919abc9c87418Dan Gohman 41898ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower the terminator after the copies are emitted. 41923dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner SetDebugLoc(LLVMBB->getTerminator(), SDB, 0, MF); 4202048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visit(*LLVMBB->getTerminator()); 42107f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, 0); 42298ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman } 4233df24e667f04a7003342b534310919abc9c87418Dan Gohman } 424a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 425a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4262048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 427c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 428f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Final step, emit the lowered DAG as machine code. 429f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 4302048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman HadTailCall = SDB->HasTailCall; 4312048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 4321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 43454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengnamespace { 43554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted 43654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// nodes from the worklist. 43754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengclass SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener { 43854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng SmallVector<SDNode*, 128> &Worklist; 43925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &InWorklist; 44054e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengpublic: 44125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl, 44225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> &inwl) 44325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner : Worklist(wl), InWorklist(inwl) {} 44425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 44525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner void RemoveFromWorklist(SDNode *N) { 44625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!InWorklist.erase(N)) return; 44725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 44825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallVector<SDNode*, 128>::iterator I = 44925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner std::find(Worklist.begin(), Worklist.end(), N); 45025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(I != Worklist.end() && "Not in worklist"); 45125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 45225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner *I = Worklist.back(); 45325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.pop_back(); 45425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 45525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 45654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeDeleted(SDNode *N, SDNode *E) { 45725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner RemoveFromWorklist(N); 45854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 45954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 46054e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeUpdated(SDNode *N) { 46154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng // Ignore updates. 46254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 46354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng}; 46454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng} 46554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 466046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng/// TrivialTruncElim - Eliminate some trivial nops that can result from 467046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng/// ShrinkDemandedOps: (trunc (ext n)) -> n. 468046632f272b22a653c204c0ef56eb4076368d4bbEvan Chengstatic bool TrivialTruncElim(SDValue Op, 469046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng TargetLowering::TargetLoweringOpt &TLO) { 470046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng SDValue N0 = Op.getOperand(0); 471046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng EVT VT = Op.getValueType(); 472046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng if ((N0.getOpcode() == ISD::ZERO_EXTEND || 473046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOpcode() == ISD::SIGN_EXTEND || 474046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOpcode() == ISD::ANY_EXTEND) && 475046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng N0.getOperand(0).getValueType() == VT) { 476046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng return TLO.CombineTo(Op, N0.getOperand(0)); 477046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng } 478046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng return false; 479046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng} 480046632f272b22a653c204c0ef56eb4076368d4bbEvan Cheng 48154eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// ShrinkDemandedOps - A late transformation pass that shrink expressions 48254eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// using TargetLowering::TargetLoweringOpt::ShrinkDemandedOp. It converts 48354eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// x+y to (VT)((SmallVT)x+(SmallVT)y) if the casts are free. 484d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Chengvoid SelectionDAGISel::ShrinkDemandedOps() { 485d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng SmallVector<SDNode*, 128> Worklist; 48625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SmallPtrSet<SDNode*, 128> InWorklist; 487d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 488d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Add all the dag nodes to the worklist. 489d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.reserve(CurDAG->allnodes_size()); 490d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(), 49125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner E = CurDAG->allnodes_end(); I != E; ++I) { 492d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.push_back(I); 49325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(I); 49425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner } 495d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 496d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng TargetLowering::TargetLoweringOpt TLO(*CurDAG, true); 497d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng while (!Worklist.empty()) { 4987b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 49925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.erase(N); 500d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 501d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (N->use_empty() && N != CurDAG->getRoot().getNode()) { 502c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner // Deleting this node may make its operands dead, add them to the worklist 503c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner // if they aren't already there. 504c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 505c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner if (InWorklist.insert(N->getOperand(i).getNode())) 506c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner Worklist.push_back(N->getOperand(i).getNode()); 507c4a3f23b9251b07785cca646ad27b426dfa23230Chris Lattner 50854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng CurDAG->DeleteNode(N); 509d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng continue; 510d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 511d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 512d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Run ShrinkDemandedOp on scalar binary operations. 51325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (N->getNumValues() != 1 || 51425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner !N->getValueType(0).isSimple() || !N->getValueType(0).isInteger()) 51525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner continue; 51625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 51725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner unsigned BitWidth = N->getValueType(0).getScalarType().getSizeInBits(); 51825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner APInt Demanded = APInt::getAllOnesValue(BitWidth); 51925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner APInt KnownZero, KnownOne; 52025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!TLI.SimplifyDemandedBits(SDValue(N, 0), Demanded, 52125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner KnownZero, KnownOne, TLO) && 52225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner (N->getOpcode() != ISD::TRUNCATE || 52325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner !TrivialTruncElim(SDValue(N, 0), TLO))) 52425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner continue; 52525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 52625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Revisit the node. 52725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner assert(!InWorklist.count(N) && "Already in worklist"); 52825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(N); 52925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(N); 53025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 53125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Replace the old value with the new one. 53225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DEBUG(errs() << "\nShrinkDemandedOps replacing "; 53325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner TLO.Old.getNode()->dump(CurDAG); 53425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner errs() << "\nWith: "; 53525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner TLO.New.getNode()->dump(CurDAG); 53625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner errs() << '\n'); 53725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 53825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (InWorklist.insert(TLO.New.getNode())) 53925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(TLO.New.getNode()); 54025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 54125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDOPsWorkListRemover DeadNodes(Worklist, InWorklist); 54225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner CurDAG->ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, &DeadNodes); 54325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 54425e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (!TLO.Old.getNode()->use_empty()) continue; 54525e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 54625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner for (unsigned i = 0, e = TLO.Old.getNode()->getNumOperands(); 54725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner i != e; ++i) { 54825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner SDNode *OpNode = TLO.Old.getNode()->getOperand(i).getNode(); 54925e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner if (OpNode->hasOneUse()) { 55025e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner // Add OpNode to the end of the list to revisit. 55125e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DeadNodes.RemoveFromWorklist(OpNode); 55225e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner Worklist.push_back(OpNode); 55325e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner InWorklist.insert(OpNode); 554d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 555d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 55625e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner 55725e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner DeadNodes.RemoveFromWorklist(TLO.Old.getNode()); 55825e0ab9ae5507b0589be852f54693dec66796f0eChris Lattner CurDAG->DeleteNode(TLO.Old.getNode()); 559d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 560d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng} 561d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 562f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 563ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 564ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 565a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 566ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 567a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 568ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 569ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 570ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 571a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5727b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer do { 5737b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 574a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 575ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 576ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 577ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 578a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 579ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 580ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 581825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 582ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 583a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 584ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 585ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 586ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 587a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 588ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 589ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 590ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 591a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 592ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 593475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 594e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 595ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 596ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 597a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 598f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 599ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 600f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 601a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 602ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 603ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 604ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 605f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (DestReg >= FuncInfo->LiveOutRegInfo.size()) 606f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo.resize(DestReg+1); 607f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FunctionLoweringInfo::LiveOutInfo &LOI = 608f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo[DestReg]; 609ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 610a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownOne = KnownOne; 611a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownZero = KnownZero; 612ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 6137b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer } while (!Worklist.empty()); 614ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 615ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 616f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 617462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 618462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 619462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 620462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 621462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 62225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 62325cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 624f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman BlockName = MF->getFunction()->getNameStr() + ":" + 625f6ccee5a9d2b9573f679bca6266ade3eb8cd3f88Daniel Dunbar BB->getBasicBlock()->getNameStr(); 626462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 6271a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Initial selection DAG:\n"); 628f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 629462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 630f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 631417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 632af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 633ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 6345e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 635be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 636ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 637be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 638ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 639a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 6401a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized lowered selection DAG:\n"); 641f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 642a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 6431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 6441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 645714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 646714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman BlockName); 647714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 648714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman bool Changed; 649714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 650714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 651714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 652714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 653714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 654714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 655714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 6561a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Type-legalized selection DAG:\n"); 657714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 658462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 659714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 660714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 661714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 662714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 663714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 664462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 665714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize types", GroupName); 666714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 667462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 668714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 669462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 670462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 6711a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n"); 672f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 673714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 674462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 675714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 676714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Vector Legalization", GroupName); 677714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 678714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 679714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 680714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 6815c22c8074404797f1313b1334757254fb5c6487aEli Friedman 682714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 6835c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (TimePassesIsEnabled) { 684714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization 2", GroupName); 6859882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 6865c22c8074404797f1313b1334757254fb5c6487aEli Friedman } else { 6879882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 6885c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 6895c22c8074404797f1313b1334757254fb5c6487aEli Friedman 690714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 691714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 6925c22c8074404797f1313b1334757254fb5c6487aEli Friedman 693714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 694714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 695714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName); 696714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 697714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 698714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 6995c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 700714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 7011a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n"); 702714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 70370587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 704a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 705f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 706462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 707ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 7085e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 709714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 710ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 711714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 712ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 713a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 7141a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Legalized selection DAG:\n"); 715f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 716a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 717f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 718462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 719af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 720ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 7215e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 722be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 723ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 724be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 725ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 726a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 7271a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized legalized selection DAG:\n"); 728f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 729417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 730d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (OptLevel != CodeGenOpt::None) { 731d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng ShrinkDemandedOps(); 732f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 733d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 734552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 735552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 736552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner 737a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 738a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 739ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 7405e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 7417c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 742ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 7437c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 744ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 745db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 7461a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Selected selection DAG:\n"); 747f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 748462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 749f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 750462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 7515e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 75247ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 7535e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 7545e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 75547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 7565e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 75747ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 7585e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 7595e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 760462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 761462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 762a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 763db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 764ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 7655e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 7662048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = Scheduler->EmitSchedule(&SDB->EdgeMapping); 767ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 7682048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = Scheduler->EmitSchedule(&SDB->EdgeMapping); 7695e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 7705e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 7715e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 7725e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 7735e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 7745e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 7755e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 7765e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 777ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 778db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 7791a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Selected machine code:\n"); 7801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 781a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 782f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 7837c306da505e2d7f64e160890b274a47fa0740962Chris Lattnervoid SelectionDAGISel::DoInstructionSelection() { 7847c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection begins:\n"); 7857c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7867c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PreprocessISelDAG(); 7877c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7887c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Select target instructions for the DAG. 7897c306da505e2d7f64e160890b274a47fa0740962Chris Lattner { 7907c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Number all nodes with a topological order and set DAGSize. 7917c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DAGSize = CurDAG->AssignTopologicalOrder(); 7927c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7937c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Create a dummy node (which is not added to allnodes), that adds 7947c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // a reference to the root node, preventing it from being deleted, 7957c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // and tracking any changes of the root. 7967c306da505e2d7f64e160890b274a47fa0740962Chris Lattner HandleSDNode Dummy(CurDAG->getRoot()); 7977c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode()); 7987c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ++ISelPosition; 7997c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 8007c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // The AllNodes list is now topological-sorted. Visit the 8017c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // nodes by starting at the end of the list (the root of the 8027c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // graph) and preceding back toward the beginning (the entry 8037c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // node). 8047c306da505e2d7f64e160890b274a47fa0740962Chris Lattner while (ISelPosition != CurDAG->allnodes_begin()) { 8057c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *Node = --ISelPosition; 8067c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes, 8077c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // but there are currently some corner cases that it misses. Also, this 8087c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // makes it theoretically possible to disable the DAGCombiner. 8097c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) 8107c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 8117c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 8127c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *ResNode = Select(Node); 8137c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 81482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // FIXME: This is pretty gross. 'Select' should be changed to not return 81582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // anything at all and this code should be nuked with a tactical strike. 81682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 8177c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If node should not be replaced, continue with the next one. 81882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE) 8197c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 8207c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Replace node. 8217c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (ResNode) 8227c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ReplaceUses(Node, ResNode); 8237c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 8247c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If after the replacement this node is not used any more, 8257c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // remove this dead node. 8267c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) { // Don't delete EntryToken, etc. 8277c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelUpdater ISU(ISelPosition); 8287c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->RemoveDeadNode(Node, &ISU); 8297c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 8307c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 8317c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 8327c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->setRoot(Dummy.getValue()); 8337c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 8347c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection ends:\n"); 8357c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 8367c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PostprocessISelDAG(); 8377c306da505e2d7f64e160890b274a47fa0740962Chris Lattner} 8387c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 8397c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 84079ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn, 84179ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman MachineFunction &MF, 842dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman const TargetInstrInfo &TII) { 843a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 844a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 845a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISel) 846ed3a8067a60ecf2c215e77327a57904c3ebc3355Chris Lattner FastIS = TLI.createFastISel(MF, FuncInfo->ValueMap, FuncInfo->MBBMap, 847dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman FuncInfo->StaticAllocaMap 848dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#ifndef NDEBUG 849dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman , FuncInfo->CatchInfoLost 850dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#endif 851dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman ); 852a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 853a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 85439fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 85539fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng BasicBlock *LLVMBB = &*I; 8567c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = FuncInfo->MBBMap[LLVMBB]; 857f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 8583df24e667f04a7003342b534310919abc9c87418Dan Gohman BasicBlock::iterator const Begin = LLVMBB->begin(); 8593df24e667f04a7003342b534310919abc9c87418Dan Gohman BasicBlock::iterator const End = LLVMBB->end(); 8609f1185076d60153fd35feb3cadb1b4cd8debc0b6Evan Cheng BasicBlock::iterator BI = Begin; 8615edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 8625edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Lower any arguments needed in this block if this is the entry block. 86333134c4a75558288d663267c8991f6bd37a530afDan Gohman bool SuppressFastISel = false; 86433134c4a75558288d663267c8991f6bd37a530afDan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 8655edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman LowerArguments(LLVMBB); 866f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 86733134c4a75558288d663267c8991f6bd37a530afDan Gohman // If any of the arguments has the byval attribute, forgo 86833134c4a75558288d663267c8991f6bd37a530afDan Gohman // fast-isel in the entry block. 869a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (FastIS) { 87033134c4a75558288d663267c8991f6bd37a530afDan Gohman unsigned j = 1; 87133134c4a75558288d663267c8991f6bd37a530afDan Gohman for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end(); 87233134c4a75558288d663267c8991f6bd37a530afDan Gohman I != E; ++I, ++j) 8730598866c052147c31b808391f58434ce3dbfb838Devang Patel if (Fn.paramHasAttr(j, Attribute::ByVal)) { 87477ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) 8751a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel skips entry block due to byval argument\n"; 87633134c4a75558288d663267c8991f6bd37a530afDan Gohman SuppressFastISel = true; 87733134c4a75558288d663267c8991f6bd37a530afDan Gohman break; 87833134c4a75558288d663267c8991f6bd37a530afDan Gohman } 87933134c4a75558288d663267c8991f6bd37a530afDan Gohman } 88033134c4a75558288d663267c8991f6bd37a530afDan Gohman } 88133134c4a75558288d663267c8991f6bd37a530afDan Gohman 882de6e783b2490447866b592cd39855e6f4d25efffChris Lattner if (BB->isLandingPad()) { 883dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 884dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 885de6e783b2490447866b592cd39855e6f4d25efffChris Lattner MCSymbol *Label = MF.getMMI().addLandingPad(BB); 886dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 887518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner const TargetInstrDesc &II = TII.get(TargetOpcode::EH_LABEL); 8887561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner BuildMI(BB, SDB->getCurDebugLoc(), II).addSym(Label); 889dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 890dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Mark exception register as live in. 891dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 892dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Reg) BB->addLiveIn(Reg); 893dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 894dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Mark exception selector register as live in. 895dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 896dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Reg) BB->addLiveIn(Reg); 897dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 898dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 899dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 900dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // like, the basic block containing the invoke), and need to be associated 901dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // with it in the dwarf exception handling tables. Currently however the 902dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 903dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 904dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // then breaking it can result in the intrinsics being in the successor of 905f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach // the landing pad, not the landing pad itself. This results 906f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach // in exceptions not being caught because no typeids are associated with 907f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach // the invoke. This may not be the only way things can go wrong, but it 908f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach // is the only way we try to work around for the moment. 909dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 910dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 911dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 912dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman BasicBlock::iterator I, E; 913dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 914dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (isa<EHSelectorInst>(I)) 915dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman break; 916dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 917dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (I == E) 918dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // No catch info found - try to extract some from the successor. 919de6e783b2490447866b592cd39855e6f4d25efffChris Lattner CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF.getMMI(), *FuncInfo); 920dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman } 921dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman } 922dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 923f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 924dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (FastIS && !SuppressFastISel) { 925a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Emit code for any incoming arguments. This must happen before 926a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // beginning FastISel on the entry block. 927a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 9282048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 929a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman CodeGenAndEmitDAG(); 9302048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 931a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 932241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->startNewBlock(BB); 933a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 934a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman for (; BI != End; ++BI) { 935a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Just before the terminator instruction, insert instructions to 936a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // feed PHI nodes in successor blocks. 937a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<TerminatorInst>(BI)) 938a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!HandlePHINodesInSuccessorBlocksFast(LLVMBB, FastIS)) { 939c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 94007f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 94177ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 9421a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 94377ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman BI->dump(); 94477ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman } 945a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar assert(!EnableFastISelAbort && 946f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "FastISel didn't handle a PHI in a successor"); 947a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 948a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 94933134c4a75558288d663267c8991f6bd37a530afDan Gohman 95023dbf6683b5de64bd0b2f05a5a311a98480b3a72Chris Lattner SetDebugLoc(BI, SDB, FastIS, &MF); 951381ca5572e3c37824e1c5be0fa02f7b5bdd4a1ceDan Gohman 95221c14e3649b3e2a70ac36ebb148f17648f10a2a9Dan Gohman // Try to select the instruction with FastISel. 95307f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman if (FastIS->SelectInstruction(BI)) { 95407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 955a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 95607f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman } 957a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 95807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // Clear out the debug location so that it doesn't carry over to 95907f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // unrelated instructions. 96007f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 961f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 962a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 963a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<CallInst>(BI)) { 964c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 965a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 9661a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel missed call: "; 967a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 968f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 969f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 970f012705c7e4ca8cf90b6b734ce1d5355daca5ba5Benjamin Kramer if (!BI->getType()->isVoidTy()) { 971a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman unsigned &R = FuncInfo->ValueMap[BI]; 972a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 973a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman R = FuncInfo->CreateRegForValue(BI); 974f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 975a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 976b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall = false; 9777896c9f436a4eda5ec15e882a7505ba482a2fcd0Chris Lattner SelectBasicBlock(LLVMBB, BI, llvm::next(BI), HadTailCall); 978b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 979b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman // If the call was emitted as a tail call, we're done with the block. 980b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman if (HadTailCall) { 981b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman BI = End; 982b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman break; 983b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman } 984b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 985241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // If the instruction was codegen'd with multiple blocks, 986241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // inform the FastISel object where to resume inserting. 987241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->setCurrentBlock(BB); 988a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 989f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 990a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 991a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Otherwise, give up on FastISel for the rest of the block. 992a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For now, be a little lenient about non-branch terminators. 993a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!isa<TerminatorInst>(BI) || isa<BranchInst>(BI)) { 994c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner ++NumFastIselFailures; 995a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 9961a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 997a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 998a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 999a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 1000a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 1001a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 1002c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 1003a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 1004a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 1005f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1006f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1007f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 1008d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // Run SelectionDAG instruction selection on the remainder of the block 1009d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // not handled by FastISel. If FastISel is not run, this is the entire 10103df24e667f04a7003342b534310919abc9c87418Dan Gohman // block. 1011390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel if (BI != End) { 1012b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall; 1013b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman SelectBasicBlock(LLVMBB, BI, End, HadTailCall); 1014390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel } 1015381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 10167c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FinishBasicBlock(); 101739fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 1018a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 1019a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 10200e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 10210e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 1022fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 10237c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::FinishBasicBlock() { 10241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 10251a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Target-post-processed machine code:\n"); 1026f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(BB->dump()); 10274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 10281a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Total amount of phi nodes to update: " 10292048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << SDB->PHINodesToUpdate.size() << "\n"); 10302048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman DEBUG(for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) 10311a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Node " << i << " : (" 10322048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << SDB->PHINodesToUpdate[i].first 10332048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << ", " << SDB->PHINodesToUpdate[i].second << ")\n"); 1034a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1035a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 10361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 10372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (SDB->SwitchCases.empty() && 10382048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.empty() && 10392048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.empty()) { 10402048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) { 10412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[i].first; 1042518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 1043f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 1044580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen if (!BB->isSuccessor(PHI->getParent())) 1045580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen continue; 10462048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[i].second, 10479ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 10489ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 1049f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 10502048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->PHINodesToUpdate.clear(); 1051f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 10521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 10534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 10542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) { 10554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 10562048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->BitTestCases[i].Emitted) { 10574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 10582048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Parent; 10592048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 10604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 10612048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestHeader(SDB->BitTestCases[i]); 10622048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1063f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 10642048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 1065a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 10664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 10672048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) { 10684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 10692048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Cases[j].ThisBB; 10702048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 10714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 10724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 10732048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB, 10742048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 10752048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Cases[j]); 10764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 10772048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Default, 10782048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 10792048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Cases[j]); 1080a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1081a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 10822048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1083f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 10842048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 10854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 10864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 10874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 10882048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned pi = 0, pe = SDB->PHINodesToUpdate.size(); pi != pe; ++pi) { 10892048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[pi].first; 10904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 1091518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 10924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 10934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 10944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 10952048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->BitTestCases[i].Default) { 1096f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1097f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 10982048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); 1099f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1100f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 11012048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases. 11029ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 11034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 11044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 11052048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); 11067c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 11072048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB; 1108dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (cBB->isSuccessor(PHIBB)) { 1109f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1110f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 11119ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 11124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 11134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 11144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 11154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 11162048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.clear(); 11174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11189453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 11199453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 11209453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 11212048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) { 11223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 11232048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->JTCases[i].first.Emitted) { 11243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 11252048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].first.HeaderBB; 11262048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 11273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 11282048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first); 11292048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1130f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 11312048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 11324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 1133a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 113437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 11352048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].second.MBB; 11362048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 113737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 11382048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTable(SDB->JTCases[i].second); 11392048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1140f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 11412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 1142a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 114337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 11442048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned pi = 0, pe = SDB->PHINodesToUpdate.size(); pi != pe; ++pi) { 11452048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[pi].first; 114637efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 1147518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 114837efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 11494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 11502048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->JTCases[i].second.Default) { 1151ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 11522048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 1153ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 11542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB)); 1155f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 11564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 1157dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (BB->isSuccessor(PHIBB)) { 1158ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 11592048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 11609ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 116137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 116237efe6764568a3829fee26aba532283131d1a104Nate Begeman } 116337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 11642048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.clear(); 1165a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1166b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 1167b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 11682048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) { 11692048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[i].first; 1170518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 1171b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 1172b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 11732048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[i].second, 11749ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 11759ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 1176b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1177b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1178a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1179f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 1180f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 11812048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) { 1182f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 11832048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock *ThisBB = BB = SDB->SwitchCases[i].ThisBB; 11842048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 1185a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1186f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 11872048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitSwitchCase(SDB->SwitchCases[i]); 11882048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1189f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 1190a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1191d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 1192d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 1193d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1194d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 11952048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman while ((BB = SDB->SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 1196fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng // If new BB's are created during scheduling, the edges may have been 1197ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // updated. That is, the edge from ThisBB to BB may have been split and 1198ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // BB's predecessor is now another block. 1199fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*>::iterator EI = 12002048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->EdgeMapping.find(BB); 12012048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (EI != SDB->EdgeMapping.end()) 1202fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng ThisBB = EI->second; 1203dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen 1204dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // BB may have been removed from the CFG if a branch was constant folded. 1205dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (ThisBB->isSuccessor(BB)) { 1206dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (MachineBasicBlock::iterator Phi = BB->begin(); 1207518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner Phi != BB->end() && Phi->isPHI(); 1208dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen ++Phi) { 1209dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // This value for this PHI node is recorded in PHINodesToUpdate. 1210dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (unsigned pn = 0; ; ++pn) { 1211dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen assert(pn != SDB->PHINodesToUpdate.size() && 1212dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen "Didn't find PHI entry!"); 1213dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (SDB->PHINodesToUpdate[pn].first == Phi) { 1214dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand:: 1215dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen CreateReg(SDB->PHINodesToUpdate[pn].second, 1216dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen false)); 1217dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1218dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen break; 1219dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen } 12208be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1221d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1222f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1223a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1224d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 12252048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (BB == SDB->SwitchCases[i].FalseBB) 12262048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].FalseBB = 0; 1227a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1228d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 12292048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].TrueBB = SDB->SwitchCases[i].FalseBB; 12302048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].FalseBB = 0; 1231f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 12322048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman assert(SDB->SwitchCases[i].TrueBB == 0 && SDB->SwitchCases[i].FalseBB == 0); 12332048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 1234a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 12352048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases.clear(); 12367c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 12372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->PHINodesToUpdate.clear(); 12381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1239a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 124013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 12410a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 12420a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 12430a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 12445e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 124547ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1246eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1247a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 124813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1249eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 12509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 12514ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1252a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1253be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1254a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 12550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1256fc54c552963545a81e4ea38e60460590afb2d5aeDan GohmanScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 1257fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman return new ScheduleHazardRecognizer(); 12589ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 12599ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 1260755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1261755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1262755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1263755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1264755480681c795d585c73556c028b6143c46bda86Chris Lattner 1265755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1266755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1267755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1268755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1269a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1270dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 12712e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 12722e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1273a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1274755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1275755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1276755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1277a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1278755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 12792e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1280755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1281a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1282755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1283755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 12842e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1285ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1286755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1287a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1288755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1289755480681c795d585c73556c028b6143c46bda86Chris Lattner 1290755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1291755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1292755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1293755480681c795d585c73556c028b6143c46bda86Chris Lattner 1294755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1295755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1296755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1297755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1298a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 12992e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 13002e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 13012e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1302a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1303755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1304755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1305755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1306a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1307755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 13082e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1309755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1310a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1311755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1312755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 13132e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1314a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 13152e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 1316ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 1317a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1318755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1319755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1320755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1321a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1322755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1323a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1324755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1325755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1326755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1327755480681c795d585c73556c028b6143c46bda86Chris Lattner 13289ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 13290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 13300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 13310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1332f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1333475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 13340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 13350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1336decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0 1337decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1 1338decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc 13390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1340decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size(); 1341825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (InOps[e-1].getValueType() == MVT::Flag) 13420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 1343a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 13440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1345f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 1346decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (!InlineAsm::isMemKind(Flags)) { 13470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1348697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1349697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1350697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 13510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1352697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1353697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 13540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1355475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1356decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) 13577d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin llvm_report_error("Could not match memory address. Inline asm" 13587d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin " failure!"); 1359a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 13600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 1361decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned NewFlags = 1362decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size()); 1363decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32)); 13640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 13650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 13660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 13670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1368a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 13690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 13700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 13710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 13720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1373794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1374e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson/// findFlagUse - Return use of EVT::Flag value produced by the specified 1375c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1376c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1377c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic SDNode *findFlagUse(SDNode *N) { 1378c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1379c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1380c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1381c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1382c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1383c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1384c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1385c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1386c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1387c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1388c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1389c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1390c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1391d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, 1392d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) { 1393da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The NodeID's are given uniques ID's where a node ID is guaranteed to be 1394da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // greater than all of its (recursive) operands. If we scan to a point where 1395da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 'use' is smaller than the node we're scanning for, then we know we will 1396da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // never find it. 1397da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 1398da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The Use may be -1 (unassigned) if it is a newly allocated node. This can 1399da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // happen because we scan down to newly selected nodes in the case of flag 1400da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // uses. 1401da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1)) 1402da244a091dcde022ea4938793d81ee957903ed70Chris Lattner return false; 1403da244a091dcde022ea4938793d81ee957903ed70Chris Lattner 1404da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // Don't revisit nodes if we already scanned it and didn't fail, we know we 1405da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // won't fail if we scan it again. 1406da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if (!Visited.insert(Use)) 1407c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1408c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1409c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1410d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Ignore chain uses, they are validated by HandleMergeInputChains. 1411d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains) 1412d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1413d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1414c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1415c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1416c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1417c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1418c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1419c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1420c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1421c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1422c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1423d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains)) 1424c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1425c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1426c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1427c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1428c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1429014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsProfitableToFold - Returns true if it's profitable to fold the specific 1430014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// operand node N of U during instruction selection that starts at Root. 1431014bf215c3457bb34fee348265e8f63a70b4d503Evan Chengbool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U, 1432014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng SDNode *Root) const { 1433014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng if (OptLevel == CodeGenOpt::None) return false; 1434014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng return N.hasOneUse(); 1435014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng} 1436014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng 1437014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsLegalToFold - Returns true if the specific operand node N of 1438014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// U can be folded during instruction selection that starts at Root. 1439d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattnerbool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 1440d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) const { 1441c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1442c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1443c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1444c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1445c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1446c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1447c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1448c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1449c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1450c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1451c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1452c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1453c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1454c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1455c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1456c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1457c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1458c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1459c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root produces a flag, then it gets (even more) interesting. Since it 1460c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // will be "glued" together with its flag use in the scheduler, we need to 1461c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1462c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1463c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1464c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1465c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1466c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1467c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1468c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1469c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1470c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1471c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1472c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1473c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1474c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1475c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1476c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1477c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1478c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [FU] // 1479c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1480c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If FU (flag use) indirectly reaches N (the load), and Root folds N 1481c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // (call it Fold), then X is a predecessor of FU and a successor of 1482c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Fold. But since Fold and FU are flagged together, this will create 1483c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1484c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 14859bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // If the node has flags, walk down the graph to the "lowest" node in the 14869bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner // flagged set. 1487e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1488825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (VT == MVT::Flag) { 1489c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *FU = findFlagUse(Root); 1490c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (FU == NULL) 1491c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1492c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov Root = FU; 1493c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 149418fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 149518fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // If our query node has a flag result with a use, we've walked up it. If 149618fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the user (which has already been selected) has a chain or indirectly uses 149718fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the chain, our WalkChainUsers predicate will not consider it. Because of 149818fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // this, we cannot ignore chains in this predicate. 149918fdabadca110671b436de52fe7bd492ad49e656Chris Lattner IgnoreChains = false; 1500c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 150118fdabadca110671b436de52fe7bd492ad49e656Chris Lattner 1502c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 15039bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner SmallPtrSet<SDNode*, 16> Visited; 15049bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains); 1505c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1506c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1507eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) { 1508eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman std::vector<SDValue> Ops(N->op_begin(), N->op_end()); 1509e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SelectInlineAsmMemoryOperands(Ops); 1510e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1511e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::vector<EVT> VTs; 1512e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Other); 1513e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Flag); 1514eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(), 1515e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs, &Ops[0], Ops.size()); 1516d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner New->setNodeId(-1); 1517e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman return New.getNode(); 1518e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1519e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1520eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) { 1521518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0)); 1522e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1523e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 15242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// GetVBR - decode a vbr encoding whose top bit is set. 15252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerALWAYS_INLINE static uint64_t 15262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerGetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) { 15272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(Val >= 128 && "Not a VBR"); 15282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val &= 127; // Remove first vbr bit. 15292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 15302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned Shift = 7; 15312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner uint64_t NextBits; 15322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner do { 153314df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner NextBits = MatcherTable[Idx++]; 15342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val |= (NextBits&127) << Shift; 15352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Shift += 7; 15362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } while (NextBits & 128); 15372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 15382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return Val; 15392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 15402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 15412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 15422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// UpdateChainsAndFlags - When a match is complete, this method updates uses of 15432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// interior flag and chain results to use the new flag and chain results. 154482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattnervoid SelectionDAGISel:: 154582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris LattnerUpdateChainsAndFlags(SDNode *NodeToMatch, SDValue InputChain, 154682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &ChainNodesMatched, 154782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SDValue InputFlag, 154882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner const SmallVectorImpl<SDNode*> &FlagResultNodesMatched, 154982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner bool isMorphNodeTo) { 155082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SmallVector<SDNode*, 4> NowDeadNodes; 155182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 155282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner ISelUpdater ISU(ISelPosition); 155382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 15542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Now that all the normal results are replaced, we replace the chain and 15552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // flag results if present. 15562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!ChainNodesMatched.empty()) { 15572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() != 0 && 15582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Matched input chains but didn't produce a chain"); 15592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Loop over all of the nodes we matched that produced a chain result. 15602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Replace all the chain results with the final chain we ended up with. 15612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 15622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *ChainNode = ChainNodesMatched[i]; 15632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 156482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 156582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ChainNode->getOpcode() == ISD::DELETED_NODE) 156682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 156782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 15682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Don't replace the results of the root node if we're doing a 15692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MorphNodeTo. 15702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNode == NodeToMatch && isMorphNodeTo) 15712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 15722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 15732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); 15742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainVal.getValueType() == MVT::Flag) 15752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); 15762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainVal.getValueType() == MVT::Other && "Not a chain?"); 157782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU); 157882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 1579856fb395e46a8d485081acbf11928047d852c636Chris Lattner // If the node became dead and we haven't already seen it, delete it. 1580856fb395e46a8d485081acbf11928047d852c636Chris Lattner if (ChainNode->use_empty() && 1581856fb395e46a8d485081acbf11928047d852c636Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode)) 158282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(ChainNode); 15832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 15842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 15852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 15862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the result produces a flag, update any flag results in the matched 15872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern with the flag result. 15882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputFlag.getNode() != 0) { 15892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Handle any interior nodes explicitly marked. 15902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = FlagResultNodesMatched.size(); i != e; ++i) { 15912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *FRN = FlagResultNodesMatched[i]; 159282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 159382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 159482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (FRN->getOpcode() == ISD::DELETED_NODE) 159582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 159682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 15972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Flag && 15982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Doesn't have a flag result"); 15992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), 160082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, &ISU); 160182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 160219e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner // If the node became dead and we haven't already seen it, delete it. 160319e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner if (FRN->use_empty() && 160419e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN)) 160582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(FRN); 16062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 16072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 16082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 160982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (!NowDeadNodes.empty()) 161082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU); 161182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 16122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Match complete!\n"); 16132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 16142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1615c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerenum ChainResult { 1616c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_Simple, 1617c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_InducesCycle, 1618c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_LeadsToInteriorNode 1619c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner}; 1620c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1621c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// WalkChainUsers - Walk down the users of the specified chained node that is 1622c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// part of the pattern we're matching, looking at all of the users we find. 1623c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// This determines whether something is an interior node, whether we have a 1624c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// non-pattern node in between two pattern nodes (which prevent folding because 1625c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// it would induce a cycle) and whether we have a TokenFactor node sandwiched 1626c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// between pattern nodes (in which case the TF becomes part of the pattern). 1627c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// 1628c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// The walk we do here is guaranteed to be small because we quickly get down to 1629c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// already selected nodes "below" us. 1630c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerstatic ChainResult 1631c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerWalkChainUsers(SDNode *ChainedNode, 1632c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &ChainedNodesInPattern, 1633c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &InteriorChainedNodes) { 1634c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainResult Result = CR_Simple; 1635c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1636c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (SDNode::use_iterator UI = ChainedNode->use_begin(), 1637c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner E = ChainedNode->use_end(); UI != E; ++UI) { 1638c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Make sure the use is of the chain, not some other value we produce. 1639c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (UI.getUse().getValueType() != MVT::Other) continue; 1640c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1641c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *User = *UI; 1642c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1643c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we see an already-selected machine node, then we've gone beyond the 1644c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that we're selecting down into the already selected chunk of the 1645c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // DAG. 1646c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->isMachineOpcode() || 1647c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner User->getOpcode() == ISD::HANDLENODE) // Root of the graph. 1648c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1649d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner 1650d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getOpcode() == ISD::CopyToReg || 1651d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner User->getOpcode() == ISD::CopyFromReg || 16527561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::INLINEASM || 16537561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::EH_LABEL) { 1654d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // If their node ID got reset to -1 then they've already been selected. 1655d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Treat them like a MachineOpcode. 1656d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getNodeId() == -1) 1657d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1658d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner } 1659c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1660c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a TokenFactor, we handle it specially. 1661c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->getOpcode() != ISD::TokenFactor) { 1662c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the node isn't a token factor and isn't part of our pattern, then it 1663c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // must be a random chained node in between two nodes we're selecting. 1664c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This happens when we have something like: 1665c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1666c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // call 1667c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1668c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1669c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Because we structurally match the load/store as a read/modify/write, 1670c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // but the call is chained between them. We cannot fold in this case 1671c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // because it would induce a cycle in the graph. 1672c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainedNodesInPattern.begin(), 1673c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.end(), User)) 1674c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1675c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1676c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise we found a node that is part of our pattern. For example in: 1677c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1678c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1679c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1680c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This would happen when we're scanning down from the load and see the 1681c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store as a user. Record that there is a use of ChainedNode that is 1682c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // part of the pattern and keep scanning uses. 1683c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1684c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1685c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1686c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1687c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1688c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we found a TokenFactor, there are two cases to consider: first if the 1689c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // TokenFactor is just hanging "below" the pattern we're matching (i.e. no 1690c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses of the TF are in our pattern) we just want to ignore it. Second, 1691c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the TokenFactor can be sandwiched in between two chained nodes, like so: 1692c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load chain] 1693c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ 1694c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | 1695c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load] 1696c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1697c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | \ DAG's like cheese 1698c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / \ do you? 1699c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / | 1700c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [TokenFactor] [Op] 1701c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1702c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | | 1703c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1704c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1705c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Store] 1706c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1707c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // In this case, the TokenFactor becomes part of our match and we rewrite it 1708c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // as a new TokenFactor. 1709c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1710c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // To distinguish these two cases, do a recursive walk down the uses. 1711c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) { 1712c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_Simple: 1713c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor are just already-selected nodes, ignore 1714c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // it, it is "below" our pattern. 1715c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1716c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_InducesCycle: 1717c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor lead to nodes that are not part of our 1718c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that are not selected, folding would turn this into a cycle, 1719c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // bail out now. 1720c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1721c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_LeadsToInteriorNode: 1722c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner break; // Otherwise, keep processing. 1723c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1724c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1725c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we know we're in the interesting interior case. The TokenFactor 1726c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // is now going to be considered part of the pattern so that we rewrite its 1727c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses (it may have uses that are not part of the pattern) with the 1728c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ultimate chain result of the generated code. We will also add its chain 1729c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // inputs as inputs to the ultimate TokenFactor we create. 1730c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1731c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.push_back(User); 1732c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1733c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1734c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1735c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1736c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return Result; 1737c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner} 1738c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 17396b30792d2d7d142b8192241e6232aee004f745fbChris Lattner/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains 174000592ec857b4c3f31b46412e2738924238c59983Chris Lattner/// operation for when the pattern matched at least one node with a chains. The 1741c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// input vector contains a list of all of the chained nodes that we match. We 1742c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// must determine if this is a valid thing to cover (i.e. matching it won't 1743c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will 1744c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// be used as the input node chain for the generated nodes. 17456b30792d2d7d142b8192241e6232aee004f745fbChris Lattnerstatic SDValue 1746c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerHandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched, 17476b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SelectionDAG *CurDAG) { 1748c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Walk all of the chained nodes we've matched, recursively scanning down the 1749c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // users of the chain result. This adds any TokenFactor nodes that are caught 1750c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // in between chained nodes to the chained and interior nodes list. 1751c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVector<SDNode*, 3> InteriorChainedNodes; 1752c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1753c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched, 1754c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes) == CR_InducesCycle) 1755c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return SDValue(); // Would induce a cycle. 1756c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 17576b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 1758c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we have walked all the matched nodes and collected TokenFactor nodes 1759c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that we are interested in. Form our input TokenFactor node. 17606b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SmallVector<SDValue, 3> InputChains; 17616b30792d2d7d142b8192241e6232aee004f745fbChris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1762c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Add the input chain of this node to the InputChains list (which will be 1763c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the operands of the generated TokenFactor) if it's not an interior node. 1764c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *N = ChainNodesMatched[i]; 1765c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (N->getOpcode() != ISD::TokenFactor) { 1766c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N)) 1767c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1768c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1769c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise, add the input chain. 1770c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDValue InChain = ChainNodesMatched[i]->getOperand(0); 1771c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner assert(InChain.getValueType() == MVT::Other && "Not a chain"); 17726b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChains.push_back(InChain); 1773c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1774c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 1775c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1776c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a token factor, we want to add all inputs of the token factor 1777c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that are not part of the pattern we're matching. 1778c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) { 1779c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(), 17806183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner N->getOperand(op).getNode())) 17816183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner InputChains.push_back(N->getOperand(op)); 1782c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 17836b30792d2d7d142b8192241e6232aee004f745fbChris Lattner } 17846b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 17856b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SDValue Res; 17866b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChains.size() == 1) 17876b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return InputChains[0]; 17886b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(), 17896b30792d2d7d142b8192241e6232aee004f745fbChris Lattner MVT::Other, &InputChains[0], InputChains.size()); 17906b30792d2d7d142b8192241e6232aee004f745fbChris Lattner} 17912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 17923ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner/// MorphNode - Handle morphing a node in place for the selector. 17933ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerSDNode *SelectionDAGISel:: 17943ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerMorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList, 17953ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) { 17963ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // It is possible we're using MorphNodeTo to replace a node with no 17973ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // normal results with one that has a normal result (or we could be 17983ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // adding a chain) and the input could have flags and chains as well. 1799caa8870fe09f5526e611434b6bb9f7040c7dfa60Chris Lattner // In this case we need to shift the operands down. 18003ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // FIXME: This is a horrible hack and broken in obscure cases, no worse 1801a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner // than the old isel though. 18023ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner int OldFlagResultNo = -1, OldChainResultNo = -1; 18033ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18043ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned NTMNumResults = Node->getNumValues(); 18053ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Node->getValueType(NTMNumResults-1) == MVT::Flag) { 18063ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldFlagResultNo = NTMNumResults-1; 18073ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (NTMNumResults != 1 && 18083ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Node->getValueType(NTMNumResults-2) == MVT::Other) 18093ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-2; 18103ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } else if (Node->getValueType(NTMNumResults-1) == MVT::Other) 18113ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-1; 18123ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 181361c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // Call the underlying SelectionDAG routine to do the transmogrification. Note 181461c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // that this deletes operands of the old node that become dead. 18153ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps); 18163ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18173ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // MorphNodeTo can operate in two ways: if an existing node with the 18183ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // specified operands exists, it can just return it. Otherwise, it 18193ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // updates the node in place to have the requested operands. 18203ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res == Node) { 18213ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // If we updated the node in place, reset the node ID. To the isel, 18223ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // this should be just like a newly allocated machine node. 18233ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res->setNodeId(-1); 18243ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } 18253ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18263ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned ResNumResults = Res->getNumValues(); 18273ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the flag if needed. 18283ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) && OldFlagResultNo != -1 && 18293ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldFlagResultNo != ResNumResults-1) 18303ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldFlagResultNo), 18313ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 18323ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18333ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_FlagOutput) != 0) 18343ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner --ResNumResults; 18353ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18363ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the chain reference if needed. 18373ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 && 18383ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldChainResultNo != ResNumResults-1) 18393ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo), 18403ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 18413ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18423ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Otherwise, no replacement happened because the node already exists. Replace 18433ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Uses of the old node with the new one. 18443ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res != Node) 18453ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesWith(Node, Res); 18463ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 18473ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner return Res; 18483ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner} 18493ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 1850f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1851f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1852da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1853da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const SmallVectorImpl<SDValue> &RecordedNodes) { 1854da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Accept if it is exactly the same as a previously recorded node. 1855da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 1856da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 1857da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return N == RecordedNodes[RecNo]; 1858da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1859da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1860da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 1861da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1862f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1863f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel) { 1864f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]); 1865f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1866f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1867f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckNodePredicate - Implements OP_CheckNodePredicate. 1868f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1869f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1870f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel, SDNode *N) { 1871f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]); 1872f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1873f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1874f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1875f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1876f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDNode *N) { 1877d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 1878d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 1879d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner return N->getOpcode() == Opc; 1880f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1881f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1882f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1883f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1884f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N, const TargetLowering &TLI) { 1885f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1886f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (N.getValueType() == VT) return true; 1887f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1888f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Handle the case when VT is iPTR. 1889f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy(); 1890f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1891f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1892f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerALWAYS_INLINE static bool 1893da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1894da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI, 1895da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned ChildNo) { 1896da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (ChildNo >= N.getNumOperands()) 1897da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return false; // Match fails if out of range child #. 1898da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI); 1899da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1900da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1901da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1902da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1903da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1904da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N) { 1905da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return cast<CondCodeSDNode>(N)->get() == 1906da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner (ISD::CondCode)MatcherTable[MatcherIndex++]; 1907da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1908da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1909da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1910da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1911da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI) { 1912da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 1913da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (cast<VTSDNode>(N)->getVT() == VT) 1914da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return true; 1915da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1916da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Handle the case when VT is iPTR. 1917da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy(); 1918da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1919da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1920da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1921f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1922f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N) { 1923f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1924f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (Val & 128) 1925f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1926f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1927f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N); 1928f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return C != 0 && C->getSExtValue() == Val; 1929f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1930f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1931da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1932da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1933da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1934da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1935da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1936da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1937da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1938da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::AND) return false; 1939da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1940da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1941da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val); 1942da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1943da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1944da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerALWAYS_INLINE static bool 1945da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1946da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 1947da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 1948da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 1949da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 1950da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1951da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::OR) return false; 1952da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1953da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 1954da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val); 1955da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 1956da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 1957f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// IsPredicateKnownToFail - If we know how and can do so without pushing a 1958f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// scope, evaluate the current node. If the current predicate is known to 1959f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// fail, set Result=true and return anything. If the current predicate is 1960f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// known to pass, set Result=false and return the MatcherIndex to continue 1961f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// with. If the current predicate is unknown, set Result=false and return the 1962f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// MatcherIndex to continue with. 1963f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattnerstatic unsigned IsPredicateKnownToFail(const unsigned char *Table, 1964f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned Index, SDValue N, 1965da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner bool &Result, SelectionDAGISel &SDISel, 1966da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SmallVectorImpl<SDValue> &RecordedNodes){ 1967f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner switch (Table[Index++]) { 1968f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner default: 1969f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = false; 1970f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index-1; // Could not evaluate this predicate. 1971da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckSame: 1972da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckSame(Table, Index, N, RecordedNodes); 1973da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1974f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPatternPredicate: 1975da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckPatternPredicate(Table, Index, SDISel); 1976f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1977f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPredicate: 1978da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode()); 1979f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1980f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckOpcode: 1981f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckOpcode(Table, Index, N.getNode()); 1982f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1983f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckType: 1984f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckType(Table, Index, N, SDISel.TLI); 1985f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 1986f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild0Type: 1987f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild1Type: 1988f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild2Type: 1989f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild3Type: 1990f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild4Type: 1991f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild5Type: 1992f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild6Type: 1993da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckChild7Type: 1994da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckChildType(Table, Index, N, SDISel.TLI, 1995da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type); 1996da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 1997da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckCondCode: 1998da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckCondCode(Table, Index, N); 1999da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2000da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckValueType: 2001da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckValueType(Table, Index, N, SDISel.TLI); 2002f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2003f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckInteger: 2004f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckInteger(Table, Index, N); 2005f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2006da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckAndImm: 2007da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckAndImm(Table, Index, N, SDISel); 2008da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2009da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckOrImm: 2010da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckOrImm(Table, Index, N, SDISel); 2011da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2012f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2013f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2014f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 20153ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 20162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattnerstruct MatchScope { 20172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// FailIndex - If this match fails, this is the index to continue with. 20182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FailIndex; 20192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NodeStack - The node stack when the scope was formed. 20212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 4> NodeStack; 20222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumRecordedNodes - The number of recorded nodes when the scope was formed. 20242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumRecordedNodes; 20252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumMatchedMemRefs - The number of matched memref entries. 20272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumMatchedMemRefs; 20282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// InputChain/InputFlag - The current chain/flag 20302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 20312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty. 20332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasChainNodesMatched, HasFlagResultNodesMatched; 20342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner}; 20352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSDNode *SelectionDAGISel:: 20372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable, 20382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned TableSize) { 20392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: Should these even be selected? Handle these cases in the caller? 20402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (NodeToMatch->getOpcode()) { 20412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner default: 20422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 20432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::EntryToken: // These nodes remain the same. 20442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::BasicBlock: 20452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::Register: 20463b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::VALUETYPE: 20473b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::CONDCODE: 20482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::HANDLENODE: 2049decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner case ISD::MDNODE_SDNODE: 20502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstant: 20512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantFP: 20522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantPool: 20532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetFrameIndex: 20542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetExternalSymbol: 20552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetBlockAddress: 20562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetJumpTable: 20572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalTLSAddress: 20582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalAddress: 20592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TokenFactor: 20602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyFromReg: 20612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyToReg: 20627561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner case ISD::EH_LABEL: 2063d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch->setNodeId(-1); // Mark selected. 20642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 20652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertSext: 20662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertZext: 20672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0), 20682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getOperand(0)); 20692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 20702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch); 20712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::UNDEF: return Select_UNDEF(NodeToMatch); 20722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 20732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeToMatch->isMachineOpcode() && "Node already selected!"); 20752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Set up the node stack with NodeToMatch as the only node on the stack. 20772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> NodeStack; 20782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue N = SDValue(NodeToMatch, 0); 20792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 20802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchScopes - Scopes used when matching, if a match failure happens, this 20822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // indicates where to continue checking. 20832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MatchScope, 8> MatchScopes; 20842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // RecordedNodes - This is the set of nodes that have been recorded by the 20862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // state machine. 20872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> RecordedNodes; 20882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchedMemRefs - This is the set of MemRef's we've seen in the input 20902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern. 20912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MachineMemOperand*, 2> MatchedMemRefs; 20922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // These are the current input chain and flag for use when generating nodes. 20942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Various Emit operations change these. For example, emitting a copytoreg 20952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // uses and updates these. 20962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue InputChain, InputFlag; 20972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 20982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // ChainNodesMatched - If a pattern matches nodes that have input/output 20992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains, the OPC_EmitMergeInputChains operation is emitted which indicates 21002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // which ones they are. The result is captured into this list so that we can 21012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // update the chain results when the pattern is complete. 21022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> ChainNodesMatched; 21032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> FlagResultNodesMatched; 21042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Starting pattern match on root node: "; 21062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->dump(CurDAG); 21072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner errs() << '\n'); 21082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21097390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Determine where to start the interpreter. Normally we start at opcode #0, 21107390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // but if the state machine starts with an OPC_SwitchOpcode, then we 21117390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // accelerate the first lookup (which is guaranteed to be hot) with the 21127390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // OpcodeOffset table. 21132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned MatcherIndex = 0; 21147390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 21157390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (!OpcodeOffset.empty()) { 21167390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Already computed the OpcodeOffset table, just index into it. 21177390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 21187390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 21197390eebd49b786f3293d24f76fedb02fe183468cChris Lattner DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n"); 21207390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 21217390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } else if (MatcherTable[0] == OPC_SwitchOpcode) { 21227390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Otherwise, the table isn't computed, but the state machine does start 21237390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // with an OPC_SwitchOpcode instruction. Populate the table now, since this 21247390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // is the first time we're selecting an instruction. 21257390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned Idx = 1; 21267390eebd49b786f3293d24f76fedb02fe183468cChris Lattner while (1) { 21277390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the size of this case. 21287390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned CaseSize = MatcherTable[Idx++]; 21297390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize & 128) 21307390eebd49b786f3293d24f76fedb02fe183468cChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, Idx); 21317390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize == 0) break; 21327390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 21337390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the opcode, add the index to the table. 2134d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[Idx++]; 2135d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[Idx++] << 8; 21367390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (Opc >= OpcodeOffset.size()) 21377390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset.resize((Opc+1)*2); 21387390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset[Opc] = Idx; 21397390eebd49b786f3293d24f76fedb02fe183468cChris Lattner Idx += CaseSize; 21407390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 21417390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 21427390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Okay, do the lookup for the first opcode. 21437390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 21447390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 21457390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 21467390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 21472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 21482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(MatcherIndex < TableSize && "Invalid index"); 214919b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#ifndef NDEBUG 215019b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman unsigned CurrentOpcodeIndex = MatcherIndex; 215119b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#endif 21522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++]; 21532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (Opcode) { 21542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_Scope: { 2155f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Okay, the semantics of this operation are that we should push a scope 2156f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // then evaluate the first child. However, pushing a scope only to have 2157f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // the first check fail (which then pops it) is inefficient. If we can 2158f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // determine immediately that the first check (or first several) will 2159f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // immediately fail, don't even bother pushing a scope for them. 2160f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned FailIndex; 2161f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2162f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner while (1) { 2163f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 2164f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip & 128) 2165f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 2166f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Found the end of the scope with no match. 2167f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip == 0) { 2168f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = 0; 2169f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 2170f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2171f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2172f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = MatcherIndex+NumToSkip; 2173f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2174a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner unsigned MatcherIndexOfPredicate = MatcherIndex; 2175a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner (void)MatcherIndexOfPredicate; // silence warning. 2176a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner 2177f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If we can't evaluate this predicate without pushing a scope (e.g. if 2178f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // it is a 'MoveParent') or if the predicate succeeds on this node, we 2179f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // push the scope and evaluate the full predicate chain. 2180f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner bool Result; 2181f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N, 2182da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result, *this, RecordedNodes); 2183f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!Result) 2184f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 2185f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2186a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner DEBUG(errs() << " Skipped scope entry (due to false predicate) at " 2187a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << "index " << MatcherIndexOfPredicate 2188a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << ", continuing at " << FailIndex << "\n"); 2189bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 2190f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2191f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Otherwise, we know that this case of the Scope is guaranteed to fail, 2192f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // move to the next case. 2193f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = FailIndex; 2194f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2195f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2196f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If the whole scope failed to match, bail. 2197f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (FailIndex == 0) break; 2198f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 21992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Push a MatchScope which indicates where to go if the first child fails 22002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // to match. 22012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope NewEntry; 2202f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NewEntry.FailIndex = FailIndex; 22032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); 22042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumRecordedNodes = RecordedNodes.size(); 22052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumMatchedMemRefs = MatchedMemRefs.size(); 22062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputChain = InputChain; 22072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputFlag = InputFlag; 22082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty(); 22092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasFlagResultNodesMatched = !FlagResultNodesMatched.empty(); 22102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.push_back(NewEntry); 22112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordNode: 22142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Remember this node, it may end up being an operand in the pattern. 22152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N); 22162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild0: case OPC_RecordChild1: 22192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild2: case OPC_RecordChild3: 22202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild4: case OPC_RecordChild5: 22212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild6: case OPC_RecordChild7: { 22222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = Opcode-OPC_RecordChild0; 22232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 22242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 22252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(N->getOperand(ChildNo)); 22272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordMemRef: 22302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand()); 22312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CaptureFlagInput: 22342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the current node has an input flag, capture it in InputFlag. 22352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (N->getNumOperands() != 0 && 22362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Flag) 22372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = N->getOperand(N->getNumOperands()-1); 22382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveChild: { 22412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = MatcherTable[MatcherIndex++]; 22422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 22432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 22442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = N.getOperand(ChildNo); 22452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 22462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveParent: 22502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Pop the current node off the NodeStack. 22512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.pop_back(); 22522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeStack.empty() && "Node stack imbalance!"); 22532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 22542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2256da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckSame: 2257da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break; 22582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPatternPredicate: 2260f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break; 22612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPredicate: 2263f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this, 2264f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner N.getNode())) 2265f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 22662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 226757bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner case OPC_CheckComplexPat: { 226857bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned CPNum = MatcherTable[MatcherIndex++]; 226957bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 227057bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat"); 227157bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo], CPNum, 227257bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner RecordedNodes)) 22732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 22742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 227557bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner } 22762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckOpcode: 2277f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break; 2278f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner continue; 2279f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2280f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckType: 2281f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break; 22822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 22832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2284eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner case OPC_SwitchOpcode: { 2285eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CurNodeOpcode = N.getOpcode(); 22867d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2287eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CaseSize; 2288eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner while (1) { 2289eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Get the size of this case. 2290eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2291eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize & 128) 2292eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2293eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2294eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2295d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2296d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2297d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner 2298eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // If the opcode matches, then we will execute this case. 2299d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner if (CurNodeOpcode == Opc) 2300eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner break; 2301eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2302eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, skip over this case. 2303eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner MatcherIndex += CaseSize; 2304eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2305eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2306cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2307eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2308eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2309eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, execute the case we found. 2310eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner DEBUG(errs() << " OpcodeSwitch from " << SwitchStart 2311eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner << " to " << MatcherIndex << "\n"); 2312eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner continue; 2313eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 2314eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2315cfe2eab7446dedc471592fe702fefef783383171Chris Lattner case OPC_SwitchType: { 2316cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CurNodeVT = N.getValueType().getSimpleVT().SimpleTy; 2317cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2318cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned CaseSize; 2319cfe2eab7446dedc471592fe702fefef783383171Chris Lattner while (1) { 2320cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Get the size of this case. 2321cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2322cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize & 128) 2323cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2324cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2325cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2326cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MVT::SimpleValueType CaseVT = 2327cfe2eab7446dedc471592fe702fefef783383171Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2328cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseVT == MVT::iPTR) 2329cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseVT = TLI.getPointerTy().SimpleTy; 2330cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2331cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If the VT matches, then we will execute this case. 2332cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CurNodeVT == CaseVT) 2333cfe2eab7446dedc471592fe702fefef783383171Chris Lattner break; 2334cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2335cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, skip over this case. 2336cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MatcherIndex += CaseSize; 2337cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 2338cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2339cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2340cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 2341cfe2eab7446dedc471592fe702fefef783383171Chris Lattner 2342cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, execute the case we found. 2343cfe2eab7446dedc471592fe702fefef783383171Chris Lattner DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString() 2344cfe2eab7446dedc471592fe702fefef783383171Chris Lattner << "] from " << SwitchStart << " to " << MatcherIndex<<'\n'); 2345cfe2eab7446dedc471592fe702fefef783383171Chris Lattner continue; 2346cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 23472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild0Type: case OPC_CheckChild1Type: 23482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild2Type: case OPC_CheckChild3Type: 23492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild4Type: case OPC_CheckChild5Type: 2350da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckChild6Type: case OPC_CheckChild7Type: 2351da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI, 2352da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Opcode-OPC_CheckChild0Type)) 2353f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 23542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckCondCode: 2356da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break; 23572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2358da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckValueType: 2359da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break; 23602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2361f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckInteger: 2362f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break; 23632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2364da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckAndImm: 2365da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break; 23662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2367da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckOrImm: 2368da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break; 23692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckFoldableChainNode: { 23722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeStack.size() != 1 && "No parent node"); 23732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Verify that all intermediate nodes between the root and this one have 23742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // a single use. 23752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasMultipleUses = false; 23762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) 23772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!NodeStack[i].hasOneUse()) { 23782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner HasMultipleUses = true; 23792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 23802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (HasMultipleUses) break; 23822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see that the target thinks this is profitable to fold and that 23842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we can fold it without inducing cycles in the graph. 23852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(), 23862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch) || 23872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(), 2388d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch, true/*We validate our own chains*/)) 23892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 23902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 23912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitInteger: { 23942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 23952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 23962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 23972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Val & 128) 23982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 23992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getTargetConstant(Val, VT)); 24002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitRegister: { 24032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 24042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 24052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RegNo = MatcherTable[MatcherIndex++]; 24062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(CurDAG->getRegister(RegNo, VT)); 24072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitConvertToTarget: { 24112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Convert from IMM/FPIMM to target version. 24122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 24132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 24142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Imm = RecordedNodes[RecNo]; 24152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Imm->getOpcode() == ISD::Constant) { 24172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue(); 24182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstant(Val, Imm.getValueType()); 24192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (Imm->getOpcode() == ISD::ConstantFP) { 24202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue(); 24212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType()); 24222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(Imm); 24252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2428aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0 2429aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1 2430aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // These are space-optimized forms of OPC_EmitMergeInputChains. 2431aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(InputChain.getNode() == 0 && 2432aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 2433aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(ChainNodesMatched.empty() && 2434aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "Should only have one EmitMergeInputChains per match"); 2435aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2436aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Read all of the chained nodes. 2437aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1; 2438aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2439aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 2440aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2441aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // FIXME: What if other value results of the node have uses not matched 2442aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // by this pattern? 2443aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2444aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 2445aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.clear(); 2446aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; 2447aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2448aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2449aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Merge the input chains if they are not intra-pattern references. 2450aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 2451aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 2452aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (InputChain.getNode() == 0) 2453aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; // Failed to merge. 2454aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner continue; 2455aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 2456aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner 24572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitMergeInputChains: { 24582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() == 0 && 24592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 24602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // This node gets a list of nodes we matched in the input that have 24612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains. We want to token factor all of the input chains to these nodes 24622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // together. However, if any of the input chains is actually one of the 24632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // nodes matched in this pattern, then we have an intra-match reference. 24642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Ignore these because the newly token factored chain should not refer to 24652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // the old nodes. 24662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumChains = MatcherTable[MatcherIndex++]; 24672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NumChains != 0 && "Can't TF zero chains"); 24682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainNodesMatched.empty() && 24702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Should only have one EmitMergeInputChains per match"); 24712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read all of the chained nodes. 247300592ec857b4c3f31b46412e2738924238c59983Chris Lattner for (unsigned i = 0; i != NumChains; ++i) { 247400592ec857b4c3f31b46412e2738924238c59983Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 24752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 24762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 24772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: What if other value results of the node have uses not matched 24792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // by this pattern? 24802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 24812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !RecordedNodes[RecNo].hasOneUse()) { 24822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 24832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 24842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24866b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 24876b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // If the inner loop broke out, the match fails. 24886b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (ChainNodesMatched.empty()) 24896b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; 24902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24916b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // Merge the input chains if they are not intra-pattern references. 24926b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 24936b30792d2d7d142b8192241e6232aee004f745fbChris Lattner 24946b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChain.getNode() == 0) 24956b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; // Failed to merge. 24962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 24972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitCopyToReg: { 25012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 25022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 25032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned DestPhysReg = MatcherTable[MatcherIndex++]; 25042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputChain.getNode() == 0) 25062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getEntryNode(); 25072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(), 25092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DestPhysReg, RecordedNodes[RecNo], 25102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag); 25112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = InputChain.getValue(1); 25132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNodeXForm: { 25172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned XFormNo = MatcherTable[MatcherIndex++]; 25182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 25192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 25202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(RunSDNodeXForm(RecordedNodes[RecNo], XFormNo)); 25212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNode: 25252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MorphNodeTo: { 252614df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner uint16_t TargetOpc = MatcherTable[MatcherIndex++]; 252714df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 25282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned EmitNodeInfo = MatcherTable[MatcherIndex++]; 25292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the result VT list. 25302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumVTs = MatcherTable[MatcherIndex++]; 25312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<EVT, 4> VTs; 25322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumVTs; ++i) { 25332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 25342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 25352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy; 25362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(VT); 25372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 25402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Other); 25412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) 25422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Flag); 25432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25447d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // This is hot code, so optimize the two most common cases of 1 and 2 25457d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // results. 25467d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner SDVTList VTList; 25477d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner if (VTs.size() == 1) 25487d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0]); 25497d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else if (VTs.size() == 2) 25507d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0], VTs[1]); 25517d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else 25527d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs.data(), VTs.size()); 25532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the operand list. 25552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumOps = MatcherTable[MatcherIndex++]; 25562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> Ops; 25572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumOps; ++i) { 25582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 25592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 25602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 25612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid EmitNode"); 25632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(RecordedNodes[RecNo]); 25642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If there are variadic operands to add, handle them now. 25672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_VariadicInfo) { 25682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Determine the start index to copy from. 25692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo); 25702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0; 25712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->getNumOperands() >= FirstOpToCopy && 25722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Invalid variadic node"); 25732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Copy all of the variadic operands, not including a potential flag 25742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // input. 25752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands(); 25762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner i != e; ++i) { 25772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue V = NodeToMatch->getOperand(i); 25782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (V.getValueType() == MVT::Flag) break; 25792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(V); 25802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this has chain/flag inputs, add them. 25842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 25852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputChain); 25862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if ((EmitNodeInfo & OPFL_FlagInput) && InputFlag.getNode() != 0) 25872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputFlag); 25882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Create the node. 25902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *Res = 0; 25912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode != OPC_MorphNodeTo) { 25922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this is a normal EmitNode command, just create the new node and 25932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // add the results to the RecordedNodes list. 25942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(), 25952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTList, Ops.data(), Ops.size()); 25962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Add all the non-flag/non-chain results to the RecordedNodes list. 25982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = VTs.size(); i != e; ++i) { 25992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VTs[i] == MVT::Other || VTs[i] == MVT::Flag) break; 26002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.push_back(SDValue(Res, i)); 26012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else { 26043ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(), 26053ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner EmitNodeInfo); 26062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the node had chain/flag results, update our notion of the current 26092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chain and flag. 261082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (EmitNodeInfo & OPFL_FlagOutput) { 26112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = SDValue(Res, VTs.size()-1); 26122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 26132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-2); 26142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (EmitNodeInfo & OPFL_Chain) 26152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-1); 26162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the OPFL_MemRefs flag is set on this node, slap all of the 26182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // accumulated memrefs onto it. 26192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // 26202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: This is vastly incorrect for patterns with multiple outputs 26212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // instructions that access memory and for ComplexPatterns that match 26222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // loads. 26232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_MemRefs) { 26242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MachineSDNode::mmo_iterator MemRefs = 26252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MF->allocateMemRefsArray(MatchedMemRefs.size()); 26262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner std::copy(MatchedMemRefs.begin(), MatchedMemRefs.end(), MemRefs); 26272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner cast<MachineSDNode>(Res) 26282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ->setMemRefs(MemRefs, MemRefs + MatchedMemRefs.size()); 26292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << " " 26322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created") 26332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << " node: "; Res->dump(CurDAG); errs() << "\n"); 26342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this was a MorphNodeTo then we're completely done! 26362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode == OPC_MorphNodeTo) { 26372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 26382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 263982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, true); 264082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner return Res; 26412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 26442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MarkFlagResults: { 26472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumNodes = MatcherTable[MatcherIndex++]; 26482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read and remember all the flag-result nodes. 26502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumNodes; ++i) { 26512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 26522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 26532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 26542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 26562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(RecordedNodes[RecNo].getNode()); 26572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 26592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CompleteMatch: { 26622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // The match has been completed, and any new nodes (if any) have been 26632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created. Patch up references to the matched dag to use the newly 26642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created nodes. 26652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumResults = MatcherTable[MatcherIndex++]; 26662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumResults; ++i) { 26682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ResSlot = MatcherTable[MatcherIndex++]; 26692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ResSlot & 128) 26702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex); 26712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame"); 26732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue Res = RecordedNodes[ResSlot]; 26742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2675b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner assert(i < NodeToMatch->getNumValues() && 2676b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Other && 2677b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Flag && 2678b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner "Invalid number of results to complete!"); 26792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert((NodeToMatch->getValueType(i) == Res.getValueType() || 26802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i) == MVT::iPTR || 26812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType() == MVT::iPTR || 26822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i).getSizeInBits() == 26832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType().getSizeInBits()) && 26842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "invalid replacement"); 26852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res); 26862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the root node defines a flag, add it to the flag nodes to update 26892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // list. 26902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Flag) 26912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.push_back(NodeToMatch); 26922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Update chain and flag uses. 26942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner UpdateChainsAndFlags(NodeToMatch, InputChain, ChainNodesMatched, 269582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner InputFlag, FlagResultNodesMatched, false); 26962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->use_empty() && 26982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Didn't replace all uses of the node?"); 26992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: We just return here, which interacts correctly with SelectRoot 27012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // above. We should fix this to not return an SDNode* anymore. 27022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 27032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the code reached this point, then the match failed. See if there is 27072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // another child to try in the current 'Scope', otherwise pop it until we 27082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // find a case to check. 270919b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n"); 2710bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 27112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 27122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (MatchScopes.empty()) { 27132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CannotYetSelect(NodeToMatch); 27142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 27152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Restore the interpreter state back to the point where the scope was 27182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // formed. 27192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope &LastScope = MatchScopes.back(); 27202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.resize(LastScope.NumRecordedNodes); 27212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.clear(); 27222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end()); 27232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 27242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size()) 27262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.resize(LastScope.NumMatchedMemRefs); 27272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatcherIndex = LastScope.FailIndex; 27282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 272919b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Continuing at " << MatcherIndex << "\n"); 273019b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman 27312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = LastScope.InputChain; 27322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputFlag = LastScope.InputFlag; 27332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasChainNodesMatched) 27342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 27352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasFlagResultNodesMatched) 27362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FlagResultNodesMatched.clear(); 27372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see what the offset is at the new MatcherIndex. If it is zero 27392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we have reached the end of this scope, otherwise we have another child 27402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // in the current scope to try. 27412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 27422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip & 128) 27432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 27442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If we have another child in this scope to match, update FailIndex and 27462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // try it. 27472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip != 0) { 27482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner LastScope.FailIndex = MatcherIndex+NumToSkip; 27492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 27502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // End of this scope, pop it and try the next child in the containing 27532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // scope. 27542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.pop_back(); 27552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 27582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2761eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelect(SDNode *N) { 2762e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::string msg; 2763e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman raw_string_ostream Msg(msg); 2764e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman Msg << "Cannot yet select: "; 27652c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner 27662c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN && 27672c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_WO_CHAIN && 27682c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_VOID) { 27692c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->printrFull(Msg, CurDAG); 27702c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } else { 27712c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other; 27722c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner unsigned iid = 27732c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue(); 27742c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (iid < Intrinsic::num_intrinsics) 27752c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid); 27762c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo()) 27772c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "target intrinsic %" << TII->getName(iid); 27782c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else 27792c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "unknown intrinsic #" << iid; 27802c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } 2781e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman llvm_report_error(Msg.str()); 2782e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 2783e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 27841997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 2785