SelectionDAGISel.cpp revision 21c14e3649b3e2a70ac36ebb148f17648f10a2a9
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" 446e7a1617ac4a34792d9097b8d3644b72f57a45f7Devang Patel#include "llvm/CodeGen/DwarfWriter.h" 456f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 48e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman#include "llvm/Target/TargetIntrinsicInfo.h" 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 52124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 53a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 54db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 557d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin#include "llvm/Support/ErrorHandling.h" 56db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/MathExtras.h" 57db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 58ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar#include "llvm/Support/raw_ostream.h" 597e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 62ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 63293d5f8bc02a9148238b2c79484637f56de65b9cDan GohmanEnableFastISelVerbose("fast-isel-verbose", cl::Hidden, 64d659d50482e2f9edf8f436e4a1aa30c68c6d020bDan Gohman cl::desc("Enable verbose messages in the \"fast\" " 65293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohman "instruction selector")); 66293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohmanstatic cl::opt<bool> 674344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan GohmanEnableFastISelAbort("fast-isel-abort", cl::Hidden, 684344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman cl::desc("Enable abort calls when \"fast\" instruction fails")); 698a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic cl::opt<bool> 70df8ed024735b651d6e0082262d4e7a00b2fa4d32Evan ChengSchedLiveInCopies("schedule-livein-copies", cl::Hidden, 718a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman cl::desc("Schedule copies of livein registers"), 728a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman cl::init(false)); 73ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 74da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 757944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 76462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 77462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 78462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 79462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 80462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 81462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 82462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 83462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 84462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 85462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 86462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 87462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 88462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 89462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 9025cf2275ff7de3de3bc0e508abaf457413d74725Duncan SandsViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden, 9125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands cl::desc("Pop up a window to show dags before the post legalize types" 9225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands " dag combine pass")); 9325cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sandsstatic cl::opt<bool> 94a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 95a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 96a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 97a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 98a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 993e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 1003e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 1015bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 1027944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 103462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 104462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 105462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 10625cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombineLT = false, 107462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 108462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 1097944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 1107944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 111eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 112eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 113eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 114eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 115eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 116eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 117eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 118eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 119eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 120eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 121eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 122eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 123844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 124844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 125844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 126844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 127844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 128844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 12913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 130844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 131b8cab9227a0f6ffbdaae33e3c64268e265008a6aDan GohmandefaultListDAGScheduler("default", "Best scheduler for the target", 132844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1334ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 134f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohmannamespace llvm { 135f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman //===--------------------------------------------------------------------===// 136f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// createDefaultScheduler - This creates an instruction scheduler appropriate 137f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// for the target. 13847ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS, 13998a366d547772010e94609e4584489b3e5ce0043Bill Wendling CodeGenOpt::Level OptLevel) { 140e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman const TargetLowering &TLI = IS->getTargetLowering(); 141e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman 14298a366d547772010e94609e4584489b3e5ce0043Bill Wendling if (OptLevel == CodeGenOpt::None) 143be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createFastDAGScheduler(IS, OptLevel); 1449e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) 145be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createTDListDAGScheduler(IS, OptLevel); 1469e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman assert(TLI.getSchedulingPreference() == 1479e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 148be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createBURRListDAGScheduler(IS, OptLevel); 1493a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 1501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 152ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 153533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// that mark instructions with the 'usesCustomInserter' flag. These 154025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 155025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 156533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// basic blocks, and this method is called to expand it into a sequence of 157533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// instructions, potentially also creating new basic blocks and control flow. 158533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// When new basic blocks are inserted and the edges from MBB to its successors 159533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// are modified, the method should insert pairs of <OldSucc, NewSucc> into the 160533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// DenseMap. 161ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 162fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng MachineBasicBlock *MBB, 163fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*> *EM) const { 164f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#ifndef NDEBUG 1651a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "If a target marks an instruction with " 166533297b58da8c74bec65551e1aface9801fc2259Dan Gohman "'usesCustomInserter', it must implement " 167f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "TargetLowering::EmitInstrWithCustomInserter!"; 168f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#endif 169c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable(0); 170a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar return 0; 171025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 172025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 1738a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// EmitLiveInCopy - Emit a copy for a live in physical register. If the 1748a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// physical register has only a single copy use, then coalesced the copy 1758a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// if possible. 1768a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic void EmitLiveInCopy(MachineBasicBlock *MBB, 1778a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineBasicBlock::iterator &InsertPos, 1788a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned VirtReg, unsigned PhysReg, 1798a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC, 1808a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman DenseMap<MachineInstr*, unsigned> &CopyRegMap, 1818a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const MachineRegisterInfo &MRI, 1828a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI, 1838a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII) { 1848a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned NumUses = 0; 1858a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineInstr *UseMI = NULL; 1868a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::use_iterator UI = MRI.use_begin(VirtReg), 1878a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman UE = MRI.use_end(); UI != UE; ++UI) { 1888a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman UseMI = &*UI; 1898a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (++NumUses > 1) 1908a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman break; 1918a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 1928a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 1938a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // If the number of uses is not one, or the use is not a move instruction, 1948a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // don't coalesce. Also, only coalesce away a virtual register to virtual 1958a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // register copy. 1968a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman bool Coalesced = false; 19704ee5a1d9267e5e6fab8f088095fcb83c3c5cbd1Evan Cheng unsigned SrcReg, DstReg, SrcSubReg, DstSubReg; 1988a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (NumUses == 1 && 19904ee5a1d9267e5e6fab8f088095fcb83c3c5cbd1Evan Cheng TII.isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubReg, DstSubReg) && 2008a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman TargetRegisterInfo::isVirtualRegister(DstReg)) { 2018a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman VirtReg = DstReg; 2028a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman Coalesced = true; 2038a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2048a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2058a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // Now find an ideal location to insert the copy. 2068a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineBasicBlock::iterator Pos = InsertPos; 2078a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman while (Pos != MBB->begin()) { 2088a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineInstr *PrevMI = prior(Pos); 2098a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman DenseMap<MachineInstr*, unsigned>::iterator RI = CopyRegMap.find(PrevMI); 2108a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copyRegToReg might emit multiple instructions to do a copy. 2118a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned CopyDstReg = (RI == CopyRegMap.end()) ? 0 : RI->second; 2128a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (CopyDstReg && !TRI.regsOverlap(CopyDstReg, PhysReg)) 2138a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // This is what the BB looks like right now: 2148a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1024 = mov r0 2158a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // ... 2168a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1 = mov r1024 2178a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // 2188a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // We want to insert "r1025 = mov r1". Inserting this copy below the 2198a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // move to r1024 makes it impossible for that move to be coalesced. 2208a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // 2218a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1025 = mov r1 2228a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1024 = mov r0 2238a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // ... 2248a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1 = mov 1024 2258a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r2 = mov 1025 2268a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman break; // Woot! Found a good location. 2278a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman --Pos; 2288a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2298a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 230f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin bool Emitted = TII.copyRegToReg(*MBB, Pos, VirtReg, PhysReg, RC, RC); 231f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin assert(Emitted && "Unable to issue a live-in copy instruction!\n"); 232f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin (void) Emitted; 233a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 234931424a7d8b8b15ddda7308d6c5b08277d8bdc0eZhongxing Xu CopyRegMap.insert(std::make_pair(prior(Pos), VirtReg)); 2358a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (Coalesced) { 2368a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (&*InsertPos == UseMI) ++InsertPos; 2378a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MBB->erase(UseMI); 2388a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2398a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman} 2408a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2418a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// EmitLiveInCopies - If this is the first basic block in the function, 2428a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// and if it has live ins that need to be copied into vregs, emit the 2438a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// copies into the block. 2448a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic void EmitLiveInCopies(MachineBasicBlock *EntryMBB, 2458a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const MachineRegisterInfo &MRI, 2468a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI, 2478a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII) { 2488a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (SchedLiveInCopies) { 2498a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // Emit the copies at a heuristically-determined location in the block. 2508a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman DenseMap<MachineInstr*, unsigned> CopyRegMap; 2518a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineBasicBlock::iterator InsertPos = EntryMBB->begin(); 2528a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator LI = MRI.livein_begin(), 2538a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = MRI.livein_end(); LI != E; ++LI) 2548a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (LI->second) { 2558a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC = MRI.getRegClass(LI->second); 2568a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman EmitLiveInCopy(EntryMBB, InsertPos, LI->second, LI->first, 2578a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman RC, CopyRegMap, MRI, TRI, TII); 2588a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2598a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } else { 2608a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // Emit the copies into the top of the block. 2618a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator LI = MRI.livein_begin(), 2628a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = MRI.livein_end(); LI != E; ++LI) 2638a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (LI->second) { 2648a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC = MRI.getRegClass(LI->second); 265f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin bool Emitted = TII.copyRegToReg(*EntryMBB, EntryMBB->begin(), 266f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin LI->second, LI->first, RC, RC); 267f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin assert(Emitted && "Unable to issue a live-in copy instruction!\n"); 268f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin (void) Emitted; 2698a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2708a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2718a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman} 2728a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2737041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2747041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 2757041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27798a366d547772010e94609e4584489b3e5ce0043Bill WendlingSelectionDAGISel::SelectionDAGISel(TargetMachine &tm, CodeGenOpt::Level OL) : 278ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()), 2797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 2807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG(new SelectionDAG(TLI, *FuncInfo)), 2812048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB(new SelectionDAGBuilder(*CurDAG, TLI, *FuncInfo, OL)), 2827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 283be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling OptLevel(OL), 2847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DAGSize(0) 2857c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman{} 2867c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 2877c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 2882048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman delete SDB; 2897c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 2907c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 2917c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 2927c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 293e50ed30282bb5b4a9ed952580523f2dda16215acOwen Andersonunsigned SelectionDAGISel::MakeReg(EVT VT) { 29484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 2951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 297495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 298c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 299a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<AliasAnalysis>(); 3005eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 301a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<GCModuleInfo>(); 3026e7a1617ac4a34792d9097b8d3644b72f57a45f7Devang Patel AU.addRequired<DwarfWriter>(); 303a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<DwarfWriter>(); 304ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass::getAnalysisUsage(AU); 305495a0b51915eb763576874f29192820b731edc22Chris Lattner} 3061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 307ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohmanbool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) { 308ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman Function &Fn = *mf.getFunction(); 309ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman 3104344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman // Do some sanity-checking on the command-line options. 3114344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelVerbose || EnableFastISel) && 3124344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-verbose requires -fast-isel"); 3134344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelAbort || EnableFastISel) && 3144344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-abort requires -fast-isel"); 3154344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman 3165f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 3175f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 3185f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 319ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MF = &mf; 3208a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII = *TM.getInstrInfo(); 3218a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI = *TM.getRegisterInfo(); 3228a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 323f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (Fn.hasGC()) 324f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman GFI = &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn); 325ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 3265eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = 0; 32779ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman RegInfo = &MF->getRegInfo(); 3281a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n"); 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3301465d61bdd36cfd6021036a527895f0dd358e97dDuncan Sands MachineModuleInfo *MMI = getAnalysisIfAvailable<MachineModuleInfo>(); 3311465d61bdd36cfd6021036a527895f0dd358e97dDuncan Sands DwarfWriter *DW = getAnalysisIfAvailable<DwarfWriter>(); 3325dcaceb0a6a7fcf508d9898547e10d374b0e4cd1Owen Anderson CurDAG->init(*MF, MMI, DW); 3336277eb2bb997a5da0808a8a5a57f18fd9faaf336Dan Gohman FuncInfo->set(Fn, *MF, EnableFastISel); 3342048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->init(GFI, *AA); 3351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3361532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 3371532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 3381532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 3397c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 3409fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 34179ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman SelectAllBasicBlocks(Fn, *MF, MMI, DW, TII); 342edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3438a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // If the first basic block in the function has live ins that need to be 3448a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 3458a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 34679ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman EmitLiveInCopies(MF->begin(), *RegInfo, TRI, TII); 3478a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 348ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 3498a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 3508a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = RegInfo->livein_end(); I != E; ++I) 35179ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman MF->begin()->addLiveIn(I->first); 352ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 353f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 3547c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman assert(FuncInfo->CatchInfoFound.size() == FuncInfo->CatchInfoLost.size() && 355f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 356f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 357f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3587c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->clear(); 3597c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 3601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 3611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 36307f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// SetDebugLoc - Update MF's and SDB's DebugLocs if debug information is 36407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// attached with this instruction. 3653990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattnerstatic void SetDebugLoc(unsigned MDDbgKind, Instruction *I, 3663990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattner SelectionDAGBuilder *SDB, 3670eb419800ae51d6e0e00a656ede0627483755361Chris Lattner FastISel *FastIS, MachineFunction *MF) { 3680eb419800ae51d6e0e00a656ede0627483755361Chris Lattner if (isa<DbgInfoIntrinsic>(I)) return; 3690eb419800ae51d6e0e00a656ede0627483755361Chris Lattner 3703990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattner if (MDNode *Dbg = I->getMetadata(MDDbgKind)) { 3710eb419800ae51d6e0e00a656ede0627483755361Chris Lattner DILocation DILoc(Dbg); 3720eb419800ae51d6e0e00a656ede0627483755361Chris Lattner DebugLoc Loc = ExtractDebugLocation(DILoc, MF->getDebugLocInfo()); 3730eb419800ae51d6e0e00a656ede0627483755361Chris Lattner 3740eb419800ae51d6e0e00a656ede0627483755361Chris Lattner SDB->setCurDebugLoc(Loc); 3750eb419800ae51d6e0e00a656ede0627483755361Chris Lattner 3760eb419800ae51d6e0e00a656ede0627483755361Chris Lattner if (FastIS) 3770eb419800ae51d6e0e00a656ede0627483755361Chris Lattner FastIS->setCurDebugLoc(Loc); 3780eb419800ae51d6e0e00a656ede0627483755361Chris Lattner 3790eb419800ae51d6e0e00a656ede0627483755361Chris Lattner // If the function doesn't have a default debug location yet, set 3800eb419800ae51d6e0e00a656ede0627483755361Chris Lattner // it. This is kind of a hack. 3810eb419800ae51d6e0e00a656ede0627483755361Chris Lattner if (MF->getDefaultDebugLoc().isUnknown()) 3820eb419800ae51d6e0e00a656ede0627483755361Chris Lattner MF->setDefaultDebugLoc(Loc); 3830eb419800ae51d6e0e00a656ede0627483755361Chris Lattner } 38407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman} 38507f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 38607f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman/// ResetDebugLoc - Set MF's and SDB's DebugLocs to Unknown. 3873990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattnerstatic void ResetDebugLoc(SelectionDAGBuilder *SDB, FastISel *FastIS) { 38807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman SDB->setCurDebugLoc(DebugLoc::getUnknownLoc()); 38907f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman if (FastIS) 390688fb80334e1ad7b259a051411bb72e18abea9e7Dan Gohman FastIS->setCurDebugLoc(DebugLoc::getUnknownLoc()); 39107f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman} 39207f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 393f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, 394f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator Begin, 395b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman BasicBlock::iterator End, 396b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool &HadTailCall) { 3972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 398081134741b40b342fb2f85722c9cea5d412489a8Chris Lattner unsigned MDDbgKind = LLVMBB->getContext().getMDKindID("dbg"); 399f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 40098ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 40198ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // as a tail call, cease emitting nodes for this block. 4022048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (BasicBlock::iterator I = Begin; I != End && !SDB->HasTailCall; ++I) { 4033990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattner SetDebugLoc(MDDbgKind, I, SDB, 0, MF); 40407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 40507f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman if (!isa<TerminatorInst>(I)) { 4062048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visit(*I); 40707f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman 40807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // Set the current debug location back to "unknown" so that it doesn't 40907f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // spuriously apply to subsequent instructions. 41007f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, 0); 41107f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman } 412123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel } 413f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 4142048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->HasTailCall) { 41598ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Ensure that all instructions which are used outside of their defining 41698ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // blocks are available as virtual registers. Invoke is handled elsewhere. 41798ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman for (BasicBlock::iterator I = Begin; I != End; ++I) 41898ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (!isa<PHINode>(I) && !isa<InvokeInst>(I)) 4192048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->CopyToExportRegsIfNeeded(I); 420f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 42198ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Handle PHI nodes in successor blocks. 42298ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (End == LLVMBB->end()) { 42398ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman HandlePHINodesInSuccessorBlocks(LLVMBB); 4243df24e667f04a7003342b534310919abc9c87418Dan Gohman 42598ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower the terminator after the copies are emitted. 4263990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattner SetDebugLoc(MDDbgKind, LLVMBB->getTerminator(), SDB, 0, MF); 4272048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visit(*LLVMBB->getTerminator()); 42807f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, 0); 42998ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman } 4303df24e667f04a7003342b534310919abc9c87418Dan Gohman } 431a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 432a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4332048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 434c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 435f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Final step, emit the lowered DAG as machine code. 436f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 4372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman HadTailCall = SDB->HasTailCall; 4382048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 4391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengnamespace { 44254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// WorkListRemover - This class is a DAGUpdateListener that removes any deleted 44354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng/// nodes from the worklist. 44454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengclass SDOPsWorkListRemover : public SelectionDAG::DAGUpdateListener { 44554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng SmallVector<SDNode*, 128> &Worklist; 44654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Chengpublic: 44754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng SDOPsWorkListRemover(SmallVector<SDNode*, 128> &wl) : Worklist(wl) {} 44854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 44954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeDeleted(SDNode *N, SDNode *E) { 45054e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), N), 45154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng Worklist.end()); 45254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 45354e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 45454e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng virtual void NodeUpdated(SDNode *N) { 45554e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng // Ignore updates. 45654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng } 45754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng}; 45854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng} 45954e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 46054eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// ShrinkDemandedOps - A late transformation pass that shrink expressions 46154eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// using TargetLowering::TargetLoweringOpt::ShrinkDemandedOp. It converts 46254eb4c2991796c3014e831fc07e4a6c0a3df10f0Evan Cheng/// x+y to (VT)((SmallVT)x+(SmallVT)y) if the casts are free. 463d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Chengvoid SelectionDAGISel::ShrinkDemandedOps() { 464d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng SmallVector<SDNode*, 128> Worklist; 465d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 466d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Add all the dag nodes to the worklist. 467d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.reserve(CurDAG->allnodes_size()); 468d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng for (SelectionDAG::allnodes_iterator I = CurDAG->allnodes_begin(), 469d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng E = CurDAG->allnodes_end(); I != E; ++I) 470d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.push_back(I); 471d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 472d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng APInt Mask; 473d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng APInt KnownZero; 474d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng APInt KnownOne; 475d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 476d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng TargetLowering::TargetLoweringOpt TLO(*CurDAG, true); 477d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng while (!Worklist.empty()) { 4787b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 479d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 480d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (N->use_empty() && N != CurDAG->getRoot().getNode()) { 48154e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng CurDAG->DeleteNode(N); 482d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng continue; 483d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 484d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 485d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Run ShrinkDemandedOp on scalar binary operations. 486d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (N->getNumValues() == 1 && 487d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng N->getValueType(0).isSimple() && N->getValueType(0).isInteger()) { 488d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng unsigned BitWidth = N->getValueType(0).getScalarType().getSizeInBits(); 489d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng APInt Demanded = APInt::getAllOnesValue(BitWidth); 490d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng APInt KnownZero, KnownOne; 491d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (TLI.SimplifyDemandedBits(SDValue(N, 0), Demanded, 492d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng KnownZero, KnownOne, TLO)) { 493d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Revisit the node. 494d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), N), 495d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.end()); 496d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.push_back(N); 497d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 498d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng // Replace the old value with the new one. 499d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng DEBUG(errs() << "\nReplacing "; 500d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng TLO.Old.getNode()->dump(CurDAG); 501d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng errs() << "\nWith: "; 502d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng TLO.New.getNode()->dump(CurDAG); 503d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng errs() << '\n'); 504d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 505d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.push_back(TLO.New.getNode()); 50654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng 50754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng SDOPsWorkListRemover DeadNodes(Worklist); 50854e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng CurDAG->ReplaceAllUsesOfValueWith(TLO.Old, TLO.New, &DeadNodes); 509d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 510d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (TLO.Old.getNode()->use_empty()) { 511d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng for (unsigned i = 0, e = TLO.Old.getNode()->getNumOperands(); 512d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng i != e; ++i) { 513d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng SDNode *OpNode = TLO.Old.getNode()->getOperand(i).getNode(); 514d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (OpNode->hasOneUse()) { 515d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), 51654e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng OpNode), Worklist.end()); 51754e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng Worklist.push_back(OpNode); 518d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 519d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 520d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 521d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng Worklist.erase(std::remove(Worklist.begin(), Worklist.end(), 52254e146b935123d3d325e8eb30c2e1f2eca3377acEvan Cheng TLO.Old.getNode()), Worklist.end()); 523d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng CurDAG->DeleteNode(TLO.Old.getNode()); 524d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 525d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 526d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 527d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 528d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng} 529d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng 530f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 531ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 532ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 533a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 534ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 535a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 536ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 537ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 538ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 539a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5407b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer do { 5417b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 542a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 543ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 544ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 545ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 546a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 547ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 548ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 549825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 550ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 551a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 552ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 553ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 554ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 555a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 556ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 557ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 558ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 559a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 560ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 561475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 562e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 563ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 564ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 565a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 566f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 567ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 568f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 569a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 570ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 571ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 572ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 573f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (DestReg >= FuncInfo->LiveOutRegInfo.size()) 574f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo.resize(DestReg+1); 575f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FunctionLoweringInfo::LiveOutInfo &LOI = 576f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo[DestReg]; 577ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 578a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownOne = KnownOne; 579a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownZero = KnownZero; 580ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5817b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer } while (!Worklist.empty()); 582ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 583ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 584f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 585462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 586462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 587462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 588462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 589462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 59025cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 59125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 592f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman BlockName = MF->getFunction()->getNameStr() + ":" + 593f6ccee5a9d2b9573f679bca6266ade3eb8cd3f88Daniel Dunbar BB->getBasicBlock()->getNameStr(); 594462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5951a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Initial selection DAG:\n"); 596f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 597462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 598f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 599417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 600af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 601ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 6025e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 603be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 604ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 605be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 606ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 607a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 6081a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized lowered selection DAG:\n"); 609f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 610a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 6111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 613714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 614714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman BlockName); 615714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 616714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman bool Changed; 617714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 618714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 619714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 620714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 621714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 622714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 623714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 6241a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Type-legalized selection DAG:\n"); 625714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 626462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 627714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 628714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 629714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 630714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 631714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 632462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 633714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize types", GroupName); 634714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 635462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 636714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 637462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 638462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 6391a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized type-legalized selection DAG:\n"); 640f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 641714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 642462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 643714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 644714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Vector Legalization", GroupName); 645714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 646714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 647714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 648714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 6495c22c8074404797f1313b1334757254fb5c6487aEli Friedman 650714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 6515c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (TimePassesIsEnabled) { 652714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("Type Legalization 2", GroupName); 6539882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 6545c22c8074404797f1313b1334757254fb5c6487aEli Friedman } else { 6559882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 6565c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 6575c22c8074404797f1313b1334757254fb5c6487aEli Friedman 658714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 659714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 6605c22c8074404797f1313b1334757254fb5c6487aEli Friedman 661714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 662714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (TimePassesIsEnabled) { 663714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName); 664714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 665714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } else { 666714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 6675c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 668714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 6691a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized vector-legalized selection DAG:\n"); 670714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman DEBUG(CurDAG->dump()); 67170587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 672a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 673f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 674462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 675ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 6765e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 677714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 678ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 679714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->Legalize(OptLevel); 680ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 681a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 6821a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Legalized selection DAG:\n"); 683f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 684a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 685f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 686462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 687af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 688ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 6895e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 690be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 691ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 692be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 693ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 694a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 6951a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Optimized legalized selection DAG:\n"); 696f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 697417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 698f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 699a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 700d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng if (OptLevel != CodeGenOpt::None) { 701d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng ShrinkDemandedOps(); 702f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 703d40d03e1bd1d51857fc2f9f9230e334c3a32b249Evan Cheng } 704552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 705a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 706a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 707ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 7085e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 709f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelect(); 710ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 711f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelect(); 712ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 713db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 7141a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Selected selection DAG:\n"); 715f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 716462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 717f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 718462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 7195e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 72047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 7215e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 7225e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 72347ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 7245e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 72547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 7265e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 7275e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 728462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 729462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 730a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 731db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 732ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 7335e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 7342048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = Scheduler->EmitSchedule(&SDB->EdgeMapping); 735ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 7362048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = Scheduler->EmitSchedule(&SDB->EdgeMapping); 7375e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 7385e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 7395e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 7405e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 7415e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 7425e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 7435e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 7445e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 745ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 746db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 7471a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Selected machine code:\n"); 7481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 749a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 750f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 75179ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn, 75279ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman MachineFunction &MF, 753dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman MachineModuleInfo *MMI, 75483489bb7700c69b7a4a8da59365c42d3f5c8129bDevang Patel DwarfWriter *DW, 755dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman const TargetInstrInfo &TII) { 756a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 757a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 758a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISel) 75979ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman FastIS = TLI.createFastISel(MF, MMI, DW, 760a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FuncInfo->ValueMap, 761a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FuncInfo->MBBMap, 762dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman FuncInfo->StaticAllocaMap 763dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#ifndef NDEBUG 764dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman , FuncInfo->CatchInfoLost 765dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#endif 766dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman ); 767a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 768081134741b40b342fb2f85722c9cea5d412489a8Chris Lattner unsigned MDDbgKind = Fn.getContext().getMDKindID("dbg"); 769123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel 770a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 77139fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 77239fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng BasicBlock *LLVMBB = &*I; 7737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = FuncInfo->MBBMap[LLVMBB]; 774f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 7753df24e667f04a7003342b534310919abc9c87418Dan Gohman BasicBlock::iterator const Begin = LLVMBB->begin(); 7763df24e667f04a7003342b534310919abc9c87418Dan Gohman BasicBlock::iterator const End = LLVMBB->end(); 7779f1185076d60153fd35feb3cadb1b4cd8debc0b6Evan Cheng BasicBlock::iterator BI = Begin; 7785edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 7795edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Lower any arguments needed in this block if this is the entry block. 78033134c4a75558288d663267c8991f6bd37a530afDan Gohman bool SuppressFastISel = false; 78133134c4a75558288d663267c8991f6bd37a530afDan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 7825edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman LowerArguments(LLVMBB); 783f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 78433134c4a75558288d663267c8991f6bd37a530afDan Gohman // If any of the arguments has the byval attribute, forgo 78533134c4a75558288d663267c8991f6bd37a530afDan Gohman // fast-isel in the entry block. 786a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (FastIS) { 78733134c4a75558288d663267c8991f6bd37a530afDan Gohman unsigned j = 1; 78833134c4a75558288d663267c8991f6bd37a530afDan Gohman for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end(); 78933134c4a75558288d663267c8991f6bd37a530afDan Gohman I != E; ++I, ++j) 7900598866c052147c31b808391f58434ce3dbfb838Devang Patel if (Fn.paramHasAttr(j, Attribute::ByVal)) { 79177ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) 7921a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel skips entry block due to byval argument\n"; 79333134c4a75558288d663267c8991f6bd37a530afDan Gohman SuppressFastISel = true; 79433134c4a75558288d663267c8991f6bd37a530afDan Gohman break; 79533134c4a75558288d663267c8991f6bd37a530afDan Gohman } 79633134c4a75558288d663267c8991f6bd37a530afDan Gohman } 79733134c4a75558288d663267c8991f6bd37a530afDan Gohman } 79833134c4a75558288d663267c8991f6bd37a530afDan Gohman 799dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (MMI && BB->isLandingPad()) { 800dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 801dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 802dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman unsigned LabelID = MMI->addLandingPad(BB); 803dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 804dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman const TargetInstrDesc &II = TII.get(TargetInstrInfo::EH_LABEL); 8052048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BuildMI(BB, SDB->getCurDebugLoc(), II).addImm(LabelID); 806dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 807dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Mark exception register as live in. 808dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 809dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Reg) BB->addLiveIn(Reg); 810dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 811dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Mark exception selector register as live in. 812dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 813dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Reg) BB->addLiveIn(Reg); 814dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 815dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 816dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 817dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // like, the basic block containing the invoke), and need to be associated 818dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // with it in the dwarf exception handling tables. Currently however the 819dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 820dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 821dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // then breaking it can result in the intrinsics being in the successor of 822dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // the landing pad, not the landing pad itself. This results in exceptions 823dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // not being caught because no typeids are associated with the invoke. 824dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // This may not be the only way things can go wrong, but it is the only way 825dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // we try to work around for the moment. 826dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 827dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 828dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 829dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman BasicBlock::iterator I, E; 830dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 831dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (isa<EHSelectorInst>(I)) 832dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman break; 833dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 834dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (I == E) 835dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // No catch info found - try to extract some from the successor. 8365fca8b1c8dc0b9efb0a9822222a6505d1eea6bddDan Gohman CopyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, *FuncInfo); 837dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman } 838dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman } 839dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 840f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 841dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (FastIS && !SuppressFastISel) { 842a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Emit code for any incoming arguments. This must happen before 843a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // beginning FastISel on the entry block. 844a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 8452048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 846a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman CodeGenAndEmitDAG(); 8472048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 848a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 849241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->startNewBlock(BB); 850a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 851a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman for (; BI != End; ++BI) { 852a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Just before the terminator instruction, insert instructions to 853a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // feed PHI nodes in successor blocks. 854a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<TerminatorInst>(BI)) 855a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!HandlePHINodesInSuccessorBlocksFast(LLVMBB, FastIS)) { 85607f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 85777ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 8581a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 85977ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman BI->dump(); 86077ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman } 861a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar assert(!EnableFastISelAbort && 862f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "FastISel didn't handle a PHI in a successor"); 863a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 864a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 86533134c4a75558288d663267c8991f6bd37a530afDan Gohman 8663990b121cf4a0b280ed3e54cf13870cbf4259e78Chris Lattner SetDebugLoc(MDDbgKind, BI, SDB, FastIS, &MF); 867381ca5572e3c37824e1c5be0fa02f7b5bdd4a1ceDan Gohman 86821c14e3649b3e2a70ac36ebb148f17648f10a2a9Dan Gohman // Try to select the instruction with FastISel. 86907f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman if (FastIS->SelectInstruction(BI)) { 87007f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 871a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 87207f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman } 873a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 87407f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // Clear out the debug location so that it doesn't carry over to 87507f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman // unrelated instructions. 87607f111e7b746747cade8371eeaf8c613058cb3a0Dan Gohman ResetDebugLoc(SDB, FastIS); 877f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 878a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 879a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<CallInst>(BI)) { 880a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 8811a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel missed call: "; 882a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 883f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 884f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 885f012705c7e4ca8cf90b6b734ce1d5355daca5ba5Benjamin Kramer if (!BI->getType()->isVoidTy()) { 886a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman unsigned &R = FuncInfo->ValueMap[BI]; 887a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 888a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman R = FuncInfo->CreateRegForValue(BI); 889f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 890a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 891b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall = false; 8927896c9f436a4eda5ec15e882a7505ba482a2fcd0Chris Lattner SelectBasicBlock(LLVMBB, BI, llvm::next(BI), HadTailCall); 893b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 894b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman // If the call was emitted as a tail call, we're done with the block. 895b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman if (HadTailCall) { 896b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman BI = End; 897b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman break; 898b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman } 899b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 900241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // If the instruction was codegen'd with multiple blocks, 901241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // inform the FastISel object where to resume inserting. 902241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->setCurrentBlock(BB); 903a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 904f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 905a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 906a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Otherwise, give up on FastISel for the rest of the block. 907a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For now, be a little lenient about non-branch terminators. 908a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!isa<TerminatorInst>(BI) || isa<BranchInst>(BI)) { 909a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 9101a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 911a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 912a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 913a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 914a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 915a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 916c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 917a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 918a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 919f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 920f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 921f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 922d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // Run SelectionDAG instruction selection on the remainder of the block 923d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // not handled by FastISel. If FastISel is not run, this is the entire 9243df24e667f04a7003342b534310919abc9c87418Dan Gohman // block. 925390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel if (BI != End) { 926b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall; 927b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman SelectBasicBlock(LLVMBB, BI, End, HadTailCall); 928390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel } 929381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 9307c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FinishBasicBlock(); 93139fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 932a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 933a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 9340e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 9350e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 936fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 9377c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::FinishBasicBlock() { 9381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 9391a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Target-post-processed machine code:\n"); 940f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(BB->dump()); 9414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9421a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Total amount of phi nodes to update: " 9432048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << SDB->PHINodesToUpdate.size() << "\n"); 9442048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman DEBUG(for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) 9451a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Node " << i << " : (" 9462048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << SDB->PHINodesToUpdate[i].first 9472048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman << ", " << SDB->PHINodesToUpdate[i].second << ")\n"); 948a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 949a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 9501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 9512048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (SDB->SwitchCases.empty() && 9522048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.empty() && 9532048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.empty()) { 9542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) { 9552048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[i].first; 956f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 957f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 9582048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[i].second, 9599ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 9609ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 961f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 9622048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->PHINodesToUpdate.clear(); 963f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 9641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 9654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9662048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) { 9674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 9682048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->BitTestCases[i].Emitted) { 9694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 9702048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Parent; 9712048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 9724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 9732048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestHeader(SDB->BitTestCases[i]); 9742048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 975f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 9762048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 977a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 9784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9792048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) { 9804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 9812048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->BitTestCases[i].Cases[j].ThisBB; 9822048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 9834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 9844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 9852048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Cases[j+1].ThisBB, 9862048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 9872048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Cases[j]); 9884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 9892048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitBitTestCase(SDB->BitTestCases[i].Default, 9902048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 9912048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Cases[j]); 992a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 993a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 9942048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 995f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 9962048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 9974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 10002048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned pi = 0, pe = SDB->PHINodesToUpdate.size(); pi != pe; ++pi) { 10012048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[pi].first; 10024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 10034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 10044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 10054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 10064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 10072048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->BitTestCases[i].Default) { 10082048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, 10099ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 10102048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); 10112048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, 10129ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 10132048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases. 10149ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 10154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 10164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 10172048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); 10187c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 10192048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB; 1020dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (cBB->isSuccessor(PHIBB)) { 10212048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, 10229ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 10239ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 10244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 10254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 10264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 10274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 10282048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.clear(); 10294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 10309453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 10319453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 10329453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 10332048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) { 10343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 10352048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->JTCases[i].first.Emitted) { 10363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 10372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].first.HeaderBB; 10382048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 10393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 10402048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first); 10412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1042f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 10432048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 10444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 1045a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 104637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 10472048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman BB = SDB->JTCases[i].second.MBB; 10482048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 104937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 10502048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTable(SDB->JTCases[i].second); 10512048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1052f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 10532048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 1054a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 105537efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 10562048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned pi = 0, pe = SDB->PHINodesToUpdate.size(); pi != pe; ++pi) { 10572048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[pi].first; 105837efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 105937efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 106037efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 10614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 10622048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->JTCases[i].second.Default) { 1063ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 10642048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 1065ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 10662048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB)); 1067f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 10684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 1069dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (BB->isSuccessor(PHIBB)) { 1070ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 10712048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateReg(SDB->PHINodesToUpdate[pi].second, false)); 10729ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 107337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 107437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 107537efe6764568a3829fee26aba532283131d1a104Nate Begeman } 10762048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.clear(); 1077a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1078b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 1079b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 10802048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->PHINodesToUpdate.size(); i != e; ++i) { 10812048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineInstr *PHI = SDB->PHINodesToUpdate[i].first; 1082b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 1083b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 1084b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 10852048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateReg(SDB->PHINodesToUpdate[i].second, 10869ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 10879ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 1088b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1089b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1090a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1091f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 1092f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 10932048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) { 1094f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 10952048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock *ThisBB = BB = SDB->SwitchCases[i].ThisBB; 10962048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->setCurrentBasicBlock(BB); 1097a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1098f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 10992048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitSwitchCase(SDB->SwitchCases[i]); 11002048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 1101f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 1102a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1103d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 1104d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 1105d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1106d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 11072048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman while ((BB = SDB->SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 1108fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng // If new BB's are created during scheduling, the edges may have been 1109ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // updated. That is, the edge from ThisBB to BB may have been split and 1110ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // BB's predecessor is now another block. 1111fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*>::iterator EI = 11122048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->EdgeMapping.find(BB); 11132048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (EI != SDB->EdgeMapping.end()) 1114fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng ThisBB = EI->second; 1115dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen 1116dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // BB may have been removed from the CFG if a branch was constant folded. 1117dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (ThisBB->isSuccessor(BB)) { 1118dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (MachineBasicBlock::iterator Phi = BB->begin(); 1119dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; 1120dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen ++Phi) { 1121dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // This value for this PHI node is recorded in PHINodesToUpdate. 1122dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (unsigned pn = 0; ; ++pn) { 1123dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen assert(pn != SDB->PHINodesToUpdate.size() && 1124dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen "Didn't find PHI entry!"); 1125dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (SDB->PHINodesToUpdate[pn].first == Phi) { 1126dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand:: 1127dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen CreateReg(SDB->PHINodesToUpdate[pn].second, 1128dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen false)); 1129dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1130dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen break; 1131dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen } 11328be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1133d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1134f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1135a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1136d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 11372048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (BB == SDB->SwitchCases[i].FalseBB) 11382048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].FalseBB = 0; 1139a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1140d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 11412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].TrueBB = SDB->SwitchCases[i].FalseBB; 11422048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases[i].FalseBB = 0; 1143f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 11442048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman assert(SDB->SwitchCases[i].TrueBB == 0 && SDB->SwitchCases[i].FalseBB == 0); 11452048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 1146a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 11472048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases.clear(); 11487c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 11492048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->PHINodesToUpdate.clear(); 11501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1151a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 115213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 11530a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 11540a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 11550a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 11565e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 115747ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1158eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1159a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 116013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1161eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 11629373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 11634ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1164a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1165be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1166a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 11670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1168fc54c552963545a81e4ea38e60460590afb2d5aeDan GohmanScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 1169fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman return new ScheduleHazardRecognizer(); 11709ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 11719ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 1172755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1173755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1174755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1175755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1176755480681c795d585c73556c028b6143c46bda86Chris Lattner 1177755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1178755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1179755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1180755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1181a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1182dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 11832e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 11842e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1185a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1186755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1187755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1188755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1189a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1190755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 11912e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1192755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1193a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1194755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1195755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 11962e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1197ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1198755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1199a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1200755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1201755480681c795d585c73556c028b6143c46bda86Chris Lattner 1202755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1203755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1204755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1205755480681c795d585c73556c028b6143c46bda86Chris Lattner 1206755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1207755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1208755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1209755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1210a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 12112e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 12122e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 12132e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1214a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1215755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1216755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1217755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1218a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1219755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 12202e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1221755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1222a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1223755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1224755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 12252e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1226a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12272e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 1228ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 1229a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1230755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1231755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1232755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1233a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1234755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1235a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1236755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1237755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1238755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1239755480681c795d585c73556c028b6143c46bda86Chris Lattner 12409ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 12410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 12420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 12430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1244f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1245475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 12460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 12470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 12480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 12490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 12500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 12510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 1252825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (InOps[e-1].getValueType() == MVT::Flag) 12530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 1254a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1256f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 125786b49f8e2de796cb46c7c8b6a4c4900533fd53f4Dale Johannesen if ((Flags & 7) != 4 /*MEM*/) { 12580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1259697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1260697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1261697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 12620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1263697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1264697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 12650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1266475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1267f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) { 12687d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin llvm_report_error("Could not match memory address. Inline asm" 12697d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin " failure!"); 12700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1271a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 127386b49f8e2de796cb46c7c8b6a4c4900533fd53f4Dale Johannesen Ops.push_back(CurDAG->getTargetConstant(4/*MEM*/ | (SelOps.size()<< 3), 12749949933d6eb406bc74f7df7a0180a11c050a236fDale Johannesen MVT::i32)); 12750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 12760e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 12770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 12780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1279a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 12810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 12820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 12830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1284794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1285e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson/// findFlagUse - Return use of EVT::Flag value produced by the specified 1286c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1287c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1288c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic SDNode *findFlagUse(SDNode *N) { 1289c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1290c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1291c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1292c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1293c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1294c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1295c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1296c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1297c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1298c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1299c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1300c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1301c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1302c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *Root, 1303c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SmallPtrSet<SDNode*, 16> &Visited) { 1304c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use->getNodeId() < Def->getNodeId() || 1305c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov !Visited.insert(Use)) 1306c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1307c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1308c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1309c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1310c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1311c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1312c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1313c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1314c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1315c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1316c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1317c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1318c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (findNonImmUse(N, Def, ImmedUse, Root, Visited)) 1319c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1320c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1321c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1322c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1323c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1324c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// isNonImmUse - Start searching from Root up the DAG to check is Def can 1325c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// be reached. Return true if that's the case. However, ignore direct uses 1326c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// by ImmedUse (which would be U in the example illustrated in 1327c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// IsLegalAndProfitableToFold) and by Root (which can happen in the store 1328c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// case). 1329c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// FIXME: to be really generic, we should allow direct use by any node 1330c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// that is being folded. But realisticly since we only fold loads which 1331c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// have one non-chain use, we only need to watch out for load/op/store 1332c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// and load/op/cmp case where the root (store / cmp) may reach the load via 1333c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// its chain operand. 1334c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic inline bool isNonImmUse(SDNode *Root, SDNode *Def, SDNode *ImmedUse) { 1335c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SmallPtrSet<SDNode*, 16> Visited; 1336c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return findNonImmUse(Root, Def, ImmedUse, Root, Visited); 1337c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1338c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1339c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// IsLegalAndProfitableToFold - Returns true if the specific operand node N of 1340c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// U can be folded during instruction selection that starts at Root and 1341c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// folding N is profitable. 1342c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovbool SelectionDAGISel::IsLegalAndProfitableToFold(SDNode *N, SDNode *U, 1343c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *Root) const { 1344c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1345c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1346c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1347c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1348c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1349c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1350c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1351c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1352c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1353c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1354c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1355c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1356c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1357c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1358c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1359c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1360c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1361c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1362c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root produces a flag, then it gets (even more) interesting. Since it 1363c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // will be "glued" together with its flag use in the scheduler, we need to 1364c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1365c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1366c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1367c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1368c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1369c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1370c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1371c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1372c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1373c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1374c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1375c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1376c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1377c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1378c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1379c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1380c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1381c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [FU] // 1382c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1383c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If FU (flag use) indirectly reaches N (the load), and Root folds N 1384c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // (call it Fold), then X is a predecessor of FU and a successor of 1385c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Fold. But since Fold and FU are flagged together, this will create 1386c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1387c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1388e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1389825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (VT == MVT::Flag) { 1390c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *FU = findFlagUse(Root); 1391c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (FU == NULL) 1392c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1393c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov Root = FU; 1394c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 1395c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1396c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1397c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return !isNonImmUse(Root, N, U); 1398c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1399c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1400eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) { 1401eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman std::vector<SDValue> Ops(N->op_begin(), N->op_end()); 1402e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SelectInlineAsmMemoryOperands(Ops); 1403e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1404e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::vector<EVT> VTs; 1405e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Other); 1406e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Flag); 1407eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(), 1408e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs, &Ops[0], Ops.size()); 1409e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman return New.getNode(); 1410e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1411e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1412eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) { 1413eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman return CurDAG->SelectNodeTo(N, TargetInstrInfo::IMPLICIT_DEF, 1414eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman N->getValueType(0)); 1415e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1416e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1417eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_EH_LABEL(SDNode *N) { 1418eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue Chain = N->getOperand(0); 1419e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman unsigned C = cast<LabelSDNode>(N)->getLabelID(); 1420e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SDValue Tmp = CurDAG->getTargetConstant(C, MVT::i32); 1421eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman return CurDAG->SelectNodeTo(N, TargetInstrInfo::EH_LABEL, 1422e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman MVT::Other, Tmp, Chain); 1423e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1424e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1425eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelect(SDNode *N) { 1426e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::string msg; 1427e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman raw_string_ostream Msg(msg); 1428e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman Msg << "Cannot yet select: "; 1429eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman N->print(Msg, CurDAG); 1430e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman llvm_report_error(Msg.str()); 1431e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1432e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1433eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelectIntrinsic(SDNode *N) { 14341a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Cannot yet select: "; 1435e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman unsigned iid = 1436eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman cast<ConstantSDNode>(N->getOperand(N->getOperand(0).getValueType() == MVT::Other))->getZExtValue(); 1437e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman if (iid < Intrinsic::num_intrinsics) 1438e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman llvm_report_error("Cannot yet select: intrinsic %" + Intrinsic::getName((Intrinsic::ID)iid)); 1439e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman else if (const TargetIntrinsicInfo *tii = TM.getIntrinsicInfo()) 1440e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman llvm_report_error(Twine("Cannot yet select: target intrinsic %") + 1441e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman tii->getName(iid)); 1442e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1443c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 14441997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 1445