SelectionDAGISel.cpp revision a2148402ce39fb3aad09e98a32078d3853a01ae9
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" 16f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman#include "SelectionDAGBuild.h" 1784fbac580941548a6ab1121ed3b0ffdc4e2bc080Dan Gohman#include "llvm/CodeGen/SelectionDAGISel.h" 18c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 19713f043c16220b746804f668a72f4e0344cbe4d1Devang Patel#include "llvm/Analysis/DebugInfo.h" 205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 21adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2436ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 25ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 2978eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman#include "llvm/CodeGen/FastISel.h" 305a29c9eed157af51a8d338b5a225b146881819e8Gordon Henriksen#include "llvm/CodeGen/GCStrategy.h" 315eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen#include "llvm/CodeGen/GCMetadata.h" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 33ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman#include "llvm/CodeGen/MachineFunctionAnalysis.h" 341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineJumpTableInfo.h" 3784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 39fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman#include "llvm/CodeGen/ScheduleHazardRecognizer.h" 40eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 426e7a1617ac4a34792d9097b8d3644b72f57a45f7Devang Patel#include "llvm/CodeGen/DwarfWriter.h" 436f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 49124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 50a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 51db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 527d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin#include "llvm/Support/ErrorHandling.h" 53db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/MathExtras.h" 54db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 55ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar#include "llvm/Support/raw_ostream.h" 567e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 59ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 607cb07874dcadaa9a5082a80959cd15d44ba3a133Duncan SandsDisableLegalizeTypes("disable-legalize-types", cl::Hidden); 6178eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohmanstatic cl::opt<bool> 62293d5f8bc02a9148238b2c79484637f56de65b9cDan GohmanEnableFastISelVerbose("fast-isel-verbose", cl::Hidden, 63d659d50482e2f9edf8f436e4a1aa30c68c6d020bDan Gohman cl::desc("Enable verbose messages in the \"fast\" " 64293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohman "instruction selector")); 65293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohmanstatic cl::opt<bool> 664344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan GohmanEnableFastISelAbort("fast-isel-abort", cl::Hidden, 674344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman cl::desc("Enable abort calls when \"fast\" instruction fails")); 688a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic cl::opt<bool> 698a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan GohmanSchedLiveInCopies("schedule-livein-copies", 708a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman cl::desc("Schedule copies of livein registers"), 718a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman cl::init(false)); 72ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 73da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 747944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 75462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 76462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 77462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 78462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 79462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 80462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 81462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 82462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 83462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 84462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 85462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 86462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 87462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 88462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 8925cf2275ff7de3de3bc0e508abaf457413d74725Duncan SandsViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden, 9025cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands cl::desc("Pop up a window to show dags before the post legalize types" 9125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands " dag combine pass")); 9225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sandsstatic cl::opt<bool> 93a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 94a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 95a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 96a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 97a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 983e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 993e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 1005bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 1017944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 102462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 103462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 104462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 10525cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombineLT = false, 106462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 107462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 1087944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 1097944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 110eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 111eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 112eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 113eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 114eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 115eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 116eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 117eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 118eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 119eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 120eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 121eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 122844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 123844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 124844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 125844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 126844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 127844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 12813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 129844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 130b8cab9227a0f6ffbdaae33e3c64268e265008a6aDan GohmandefaultListDAGScheduler("default", "Best scheduler for the target", 131844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1324ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 133f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohmannamespace llvm { 134f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman //===--------------------------------------------------------------------===// 135f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// createDefaultScheduler - This creates an instruction scheduler appropriate 136f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// for the target. 13747ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS, 13898a366d547772010e94609e4584489b3e5ce0043Bill Wendling CodeGenOpt::Level OptLevel) { 139e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman const TargetLowering &TLI = IS->getTargetLowering(); 140e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman 14198a366d547772010e94609e4584489b3e5ce0043Bill Wendling if (OptLevel == CodeGenOpt::None) 142be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createFastDAGScheduler(IS, OptLevel); 1439e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) 144be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createTDListDAGScheduler(IS, OptLevel); 1459e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman assert(TLI.getSchedulingPreference() == 1469e76fea3abd4229749e6ead46a0016cabff4a056Dan Gohman TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 147be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return createBURRListDAGScheduler(IS, OptLevel); 1483a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 1491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 151ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 152ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 153025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 154025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 155025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 156ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 157fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng MachineBasicBlock *MBB, 158fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*> *EM) const { 159f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#ifndef NDEBUG 1604437ae213d5435390f0750213b53ec807c047f22Chris Lattner errs() << "If a target marks an instruction with " 161f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "'usesCustomDAGSchedInserter', it must implement " 162f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "TargetLowering::EmitInstrWithCustomInserter!"; 163f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#endif 164c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable(0); 165a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar return 0; 166025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 167025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 1688a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// EmitLiveInCopy - Emit a copy for a live in physical register. If the 1698a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// physical register has only a single copy use, then coalesced the copy 1708a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// if possible. 1718a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic void EmitLiveInCopy(MachineBasicBlock *MBB, 1728a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineBasicBlock::iterator &InsertPos, 1738a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned VirtReg, unsigned PhysReg, 1748a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC, 1758a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman DenseMap<MachineInstr*, unsigned> &CopyRegMap, 1768a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const MachineRegisterInfo &MRI, 1778a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI, 1788a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII) { 1798a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned NumUses = 0; 1808a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineInstr *UseMI = NULL; 1818a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::use_iterator UI = MRI.use_begin(VirtReg), 1828a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman UE = MRI.use_end(); UI != UE; ++UI) { 1838a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman UseMI = &*UI; 1848a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (++NumUses > 1) 1858a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman break; 1868a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 1878a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 1888a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // If the number of uses is not one, or the use is not a move instruction, 1898a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // don't coalesce. Also, only coalesce away a virtual register to virtual 1908a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // register copy. 1918a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman bool Coalesced = false; 19204ee5a1d9267e5e6fab8f088095fcb83c3c5cbd1Evan Cheng unsigned SrcReg, DstReg, SrcSubReg, DstSubReg; 1938a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (NumUses == 1 && 19404ee5a1d9267e5e6fab8f088095fcb83c3c5cbd1Evan Cheng TII.isMoveInstr(*UseMI, SrcReg, DstReg, SrcSubReg, DstSubReg) && 1958a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman TargetRegisterInfo::isVirtualRegister(DstReg)) { 1968a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman VirtReg = DstReg; 1978a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman Coalesced = true; 1988a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 1998a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2008a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // Now find an ideal location to insert the copy. 2018a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineBasicBlock::iterator Pos = InsertPos; 2028a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman while (Pos != MBB->begin()) { 2038a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineInstr *PrevMI = prior(Pos); 2048a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman DenseMap<MachineInstr*, unsigned>::iterator RI = CopyRegMap.find(PrevMI); 2058a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copyRegToReg might emit multiple instructions to do a copy. 2068a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman unsigned CopyDstReg = (RI == CopyRegMap.end()) ? 0 : RI->second; 2078a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (CopyDstReg && !TRI.regsOverlap(CopyDstReg, PhysReg)) 2088a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // This is what the BB looks like right now: 2098a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1024 = mov r0 2108a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // ... 2118a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1 = mov r1024 2128a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // 2138a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // We want to insert "r1025 = mov r1". Inserting this copy below the 2148a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // move to r1024 makes it impossible for that move to be coalesced. 2158a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // 2168a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1025 = mov r1 2178a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1024 = mov r0 2188a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // ... 2198a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r1 = mov 1024 2208a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // r2 = mov 1025 2218a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman break; // Woot! Found a good location. 2228a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman --Pos; 2238a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2248a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 225f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin bool Emitted = TII.copyRegToReg(*MBB, Pos, VirtReg, PhysReg, RC, RC); 226f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin assert(Emitted && "Unable to issue a live-in copy instruction!\n"); 227f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin (void) Emitted; 228a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 229f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David GoodwinCopyRegMap.insert(std::make_pair(prior(Pos), VirtReg)); 2308a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (Coalesced) { 2318a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (&*InsertPos == UseMI) ++InsertPos; 2328a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MBB->erase(UseMI); 2338a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2348a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman} 2358a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2368a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// EmitLiveInCopies - If this is the first basic block in the function, 2378a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// and if it has live ins that need to be copied into vregs, emit the 2388a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman/// copies into the block. 2398a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohmanstatic void EmitLiveInCopies(MachineBasicBlock *EntryMBB, 2408a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const MachineRegisterInfo &MRI, 2418a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI, 2428a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII) { 2438a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (SchedLiveInCopies) { 2448a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // Emit the copies at a heuristically-determined location in the block. 2458a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman DenseMap<MachineInstr*, unsigned> CopyRegMap; 2468a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman MachineBasicBlock::iterator InsertPos = EntryMBB->begin(); 2478a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator LI = MRI.livein_begin(), 2488a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = MRI.livein_end(); LI != E; ++LI) 2498a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (LI->second) { 2508a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC = MRI.getRegClass(LI->second); 2518a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman EmitLiveInCopy(EntryMBB, InsertPos, LI->second, LI->first, 2528a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman RC, CopyRegMap, MRI, TRI, TII); 2538a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2548a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } else { 2558a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // Emit the copies into the top of the block. 2568a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator LI = MRI.livein_begin(), 2578a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = MRI.livein_end(); LI != E; ++LI) 2588a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman if (LI->second) { 2598a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterClass *RC = MRI.getRegClass(LI->second); 260f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin bool Emitted = TII.copyRegToReg(*EntryMBB, EntryMBB->begin(), 261f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin LI->second, LI->first, RC, RC); 262f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin assert(Emitted && "Unable to issue a live-in copy instruction!\n"); 263f1daf7d8abebd6e0104a6b41a774ccbb19a51c60David Goodwin (void) Emitted; 2648a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2658a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman } 2668a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman} 2678a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 2687041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2697041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 2707041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27298a366d547772010e94609e4584489b3e5ce0043Bill WendlingSelectionDAGISel::SelectionDAGISel(TargetMachine &tm, CodeGenOpt::Level OL) : 273ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass(&ID), TM(tm), TLI(*tm.getTargetLowering()), 2747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 2757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG(new SelectionDAG(TLI, *FuncInfo)), 276be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling SDL(new SelectionDAGLowering(*CurDAG, TLI, *FuncInfo, OL)), 2777c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 278be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling OptLevel(OL), 2797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DAGSize(0) 2807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman{} 2817c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 2827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 2837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete SDL; 2847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 2857c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 2867c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 2877c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 288e50ed30282bb5b4a9ed952580523f2dda16215acOwen Andersonunsigned SelectionDAGISel::MakeReg(EVT VT) { 28984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 2901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 292495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 293c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 294a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<AliasAnalysis>(); 2955eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 296a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<GCModuleInfo>(); 2976e7a1617ac4a34792d9097b8d3644b72f57a45f7Devang Patel AU.addRequired<DwarfWriter>(); 298a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<DwarfWriter>(); 299ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass::getAnalysisUsage(AU); 300495a0b51915eb763576874f29192820b731edc22Chris Lattner} 3011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 302ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohmanbool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) { 303ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman Function &Fn = *mf.getFunction(); 304ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman 3054344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman // Do some sanity-checking on the command-line options. 3064344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelVerbose || EnableFastISel) && 3074344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-verbose requires -fast-isel"); 3084344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman assert((!EnableFastISelAbort || EnableFastISel) && 3094344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-abort requires -fast-isel"); 3104344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman 3115f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 3125f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 3135f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 314ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MF = &mf; 3158a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII = *TM.getInstrInfo(); 3168a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI = *TM.getRegisterInfo(); 3178a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 318f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (Fn.hasGC()) 319f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman GFI = &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn); 320ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 3215eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = 0; 32279ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman RegInfo = &MF->getRegInfo(); 323ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar DEBUG(errs() << "\n\n\n=== " << Fn.getName() << "\n"); 3241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3251465d61bdd36cfd6021036a527895f0dd358e97dDuncan Sands MachineModuleInfo *MMI = getAnalysisIfAvailable<MachineModuleInfo>(); 3261465d61bdd36cfd6021036a527895f0dd358e97dDuncan Sands DwarfWriter *DW = getAnalysisIfAvailable<DwarfWriter>(); 3275dcaceb0a6a7fcf508d9898547e10d374b0e4cd1Owen Anderson CurDAG->init(*MF, MMI, DW); 328b51d40cf40eac676dda3ae9dfeb55822fa403394Devang Patel FuncInfo->set(Fn, *MF, *CurDAG, EnableFastISel); 3297c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->init(GFI, *AA); 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3311532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 3321532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 3331532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 3347c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 3359fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 33679ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman SelectAllBasicBlocks(Fn, *MF, MMI, DW, TII); 337edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3388a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // If the first basic block in the function has live ins that need to be 3398a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 3408a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 34179ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman EmitLiveInCopies(MF->begin(), *RegInfo, TRI, TII); 3428a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 343ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 3448a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 3458a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman E = RegInfo->livein_end(); I != E; ++I) 34679ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman MF->begin()->addLiveIn(I->first); 347ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 348f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 3497c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman assert(FuncInfo->CatchInfoFound.size() == FuncInfo->CatchInfoLost.size() && 350f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 351f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 352f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3537c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->clear(); 3547c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 3551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 358f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 359f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 360f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 361f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman if (EHSelectorInst *EHSel = dyn_cast<EHSelectorInst>(I)) { 362f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 363f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman AddCatchInfo(*EHSel, MMI, FLI.MBBMap[DestBB]); 364f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 365560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 366f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman FLI.CatchInfoFound.insert(EHSel); 367f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 368f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 369f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 370f40708223e409a152834b1553c6883ff2035b957Duncan Sands 371f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, 372f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator Begin, 3735edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman BasicBlock::iterator End) { 3747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 375123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel Metadata &TheMetadata = LLVMBB->getParent()->getContext().getMetadata(); 376a2148402ce39fb3aad09e98a32078d3853a01ae9Devang Patel unsigned MDDbgKind = TheMetadata.getMDKind("dbg"); 377f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 37898ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 37998ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // as a tail call, cease emitting nodes for this block. 380123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel for (BasicBlock::iterator I = Begin; I != End && !SDL->HasTailCall; ++I) { 381123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel if (MDDbgKind) { 382a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Update DebugLoc if debug information is attached with this 383123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel // instruction. 384a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar if (MDNode *Dbg = 385a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar dyn_cast_or_null<MDNode>(TheMetadata.getMD(MDDbgKind, I))) { 386a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar DILocation DILoc(Dbg); 387a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar DebugLoc Loc = ExtractDebugLocation(DILoc, MF->getDebugLocInfo()); 388a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar SDL->setCurDebugLoc(Loc); 389123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel } 390123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel } 391f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!isa<TerminatorInst>(I)) 3927c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visit(*I); 393123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel } 394f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 39598ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (!SDL->HasTailCall) { 39698ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Ensure that all instructions which are used outside of their defining 39798ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // blocks are available as virtual registers. Invoke is handled elsewhere. 39898ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman for (BasicBlock::iterator I = Begin; I != End; ++I) 39998ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (!isa<PHINode>(I) && !isa<InvokeInst>(I)) 40098ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman SDL->CopyToExportRegsIfNeeded(I); 401f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 40298ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Handle PHI nodes in successor blocks. 40398ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman if (End == LLVMBB->end()) { 40498ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman HandlePHINodesInSuccessorBlocks(LLVMBB); 4053df24e667f04a7003342b534310919abc9c87418Dan Gohman 40698ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower the terminator after the copies are emitted. 40798ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman SDL->visit(*LLVMBB->getTerminator()); 40898ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman } 4093df24e667f04a7003342b534310919abc9c87418Dan Gohman } 410a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 411a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4127c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getControlRoot()); 413c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 414f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Final step, emit the lowered DAG as machine code. 415f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 4167c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 4171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 419f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 420ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 421ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 422a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 423ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 424a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 425ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 426ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 427ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 428a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 429ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner while (!Worklist.empty()) { 430ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDNode *N = Worklist.back(); 431ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.pop_back(); 432a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 433ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 434ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 435ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 436a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 437ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 438ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 439825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 440ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 441a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 442ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 443ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 444ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 445a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 446ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 447ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 448ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 449a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 450ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 451475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 452e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 453ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 454ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 455a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 456f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 457ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 458f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 459a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 460ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 461ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 462ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 463f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman if (DestReg >= FuncInfo->LiveOutRegInfo.size()) 464f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo.resize(DestReg+1); 465f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FunctionLoweringInfo::LiveOutInfo &LOI = 466f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman FuncInfo->LiveOutRegInfo[DestReg]; 467ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 468a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownOne = KnownOne; 469a80efceb93211a22e13dfc68198da4a25c1a7762Dan Gohman LOI.KnownZero = KnownZero; 470ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 471ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 472ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 473ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 474f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 475462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 476462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 477462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 478462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 479462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 48025cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 48125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 482f7d6cd46e920776bb33913b2498347cf99358dc4Dan Gohman BlockName = MF->getFunction()->getNameStr() + ":" + 483f6ccee5a9d2b9573f679bca6266ade3eb8cd3f88Daniel Dunbar BB->getBasicBlock()->getNameStr(); 484462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 485bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Initial selection DAG:\n"); 486f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 487462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 488f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 489417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 490af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 491ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 4925e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 493be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 494ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 495be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(Unrestricted, *AA, OptLevel); 496ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 497a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 498bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Optimized lowered selection DAG:\n"); 499f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 500a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 5037cb07874dcadaa9a5082a80959cd15d44ba3a133Duncan Sands if (!DisableLegalizeTypes) { 504f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 505f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BlockName); 506462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 50725cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands bool Changed; 508462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 509462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 51025cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands Changed = CurDAG->LegalizeTypes(); 511462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 51225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands Changed = CurDAG->LegalizeTypes(); 513462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 514462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 515bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Type-legalized selection DAG:\n"); 516f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 517462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 51825cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands if (Changed) { 51925cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands if (ViewDAGCombineLT) 52025cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 52125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands 52225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands // Run the DAG combiner in post-type-legalize mode. 52325cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands if (TimePassesIsEnabled) { 52425cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands NamedRegionTimer T("DAG Combining after legalize types", GroupName); 525be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 52625cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands } else { 527be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalTypes, *AA, OptLevel); 52825cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands } 52925cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands 530bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Optimized type-legalized selection DAG:\n"); 53125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands DEBUG(CurDAG->dump()); 53225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands } 5335c22c8074404797f1313b1334757254fb5c6487aEli Friedman 5345c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (TimePassesIsEnabled) { 5355c22c8074404797f1313b1334757254fb5c6487aEli Friedman NamedRegionTimer T("Vector Legalization", GroupName); 5365c22c8074404797f1313b1334757254fb5c6487aEli Friedman Changed = CurDAG->LegalizeVectors(); 5375c22c8074404797f1313b1334757254fb5c6487aEli Friedman } else { 5385c22c8074404797f1313b1334757254fb5c6487aEli Friedman Changed = CurDAG->LegalizeVectors(); 5395c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 5405c22c8074404797f1313b1334757254fb5c6487aEli Friedman 5415c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (Changed) { 5425c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (TimePassesIsEnabled) { 5435c22c8074404797f1313b1334757254fb5c6487aEli Friedman NamedRegionTimer T("Type Legalization 2", GroupName); 5445c22c8074404797f1313b1334757254fb5c6487aEli Friedman Changed = CurDAG->LegalizeTypes(); 5455c22c8074404797f1313b1334757254fb5c6487aEli Friedman } else { 5465c22c8074404797f1313b1334757254fb5c6487aEli Friedman Changed = CurDAG->LegalizeTypes(); 5475c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 5485c22c8074404797f1313b1334757254fb5c6487aEli Friedman 5495c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (ViewDAGCombineLT) 5505c22c8074404797f1313b1334757254fb5c6487aEli Friedman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 5515c22c8074404797f1313b1334757254fb5c6487aEli Friedman 5525c22c8074404797f1313b1334757254fb5c6487aEli Friedman // Run the DAG combiner in post-type-legalize mode. 5535c22c8074404797f1313b1334757254fb5c6487aEli Friedman if (TimePassesIsEnabled) { 5545c22c8074404797f1313b1334757254fb5c6487aEli Friedman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName); 5555c22c8074404797f1313b1334757254fb5c6487aEli Friedman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 5565c22c8074404797f1313b1334757254fb5c6487aEli Friedman } else { 5575c22c8074404797f1313b1334757254fb5c6487aEli Friedman CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 5585c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 5595c22c8074404797f1313b1334757254fb5c6487aEli Friedman 560bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Optimized vector-legalized selection DAG:\n"); 5615c22c8074404797f1313b1334757254fb5c6487aEli Friedman DEBUG(CurDAG->dump()); 5625c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 56370587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 564a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 565f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 566462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 567ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5685e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 569be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Legalize(DisableLegalizeTypes, OptLevel); 570ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 571be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Legalize(DisableLegalizeTypes, OptLevel); 572ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 573a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 574bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Legalized selection DAG:\n"); 575f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 576a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 577f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 578462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 579af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 580ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5815e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 582be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 583ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 584be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling CurDAG->Combine(NoIllegalOperations, *AA, OptLevel); 585ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 586a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 587bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Optimized legalized selection DAG:\n"); 588f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 589417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 590f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 591a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 59298a366d547772010e94609e4584489b3e5ce0043Bill Wendling if (OptLevel != CodeGenOpt::None) 593f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 594552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 595a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 596a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 597ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 5985e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 599f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelect(); 600ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 601f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelect(); 602ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 603db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 604bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Selected selection DAG:\n"); 605f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 606462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 607f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 608462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 6095e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 61047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 6115e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 6125e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 61347ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 6145e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 61547ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman Scheduler->Run(CurDAG, BB, BB->end()); 6165e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6175e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 618462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 619462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 620a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 621db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 622ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 6235e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 624fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng BB = Scheduler->EmitSchedule(&SDL->EdgeMapping); 625ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 626fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng BB = Scheduler->EmitSchedule(&SDL->EdgeMapping); 6275e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6285e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 6295e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 6305e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 6315e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 6325e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 6335e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 6345e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 635ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 636db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 637bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Selected machine code:\n"); 6381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 639a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 640f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 64179ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn, 64279ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman MachineFunction &MF, 643dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman MachineModuleInfo *MMI, 64483489bb7700c69b7a4a8da59365c42d3f5c8129bDevang Patel DwarfWriter *DW, 645dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman const TargetInstrInfo &TII) { 646a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 647a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 648a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISel) 64979ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman FastIS = TLI.createFastISel(MF, MMI, DW, 650a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FuncInfo->ValueMap, 651a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FuncInfo->MBBMap, 652dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman FuncInfo->StaticAllocaMap 653dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#ifndef NDEBUG 654dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman , FuncInfo->CatchInfoLost 655dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman#endif 656dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman ); 657a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 658123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel Metadata &TheMetadata = Fn.getContext().getMetadata(); 659a2148402ce39fb3aad09e98a32078d3853a01ae9Devang Patel unsigned MDDbgKind = TheMetadata.getMDKind("dbg"); 660123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel 661a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 66239fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 66339fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng BasicBlock *LLVMBB = &*I; 6647c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = FuncInfo->MBBMap[LLVMBB]; 665f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 6663df24e667f04a7003342b534310919abc9c87418Dan Gohman BasicBlock::iterator const Begin = LLVMBB->begin(); 6673df24e667f04a7003342b534310919abc9c87418Dan Gohman BasicBlock::iterator const End = LLVMBB->end(); 6689f1185076d60153fd35feb3cadb1b4cd8debc0b6Evan Cheng BasicBlock::iterator BI = Begin; 6695edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 6705edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Lower any arguments needed in this block if this is the entry block. 67133134c4a75558288d663267c8991f6bd37a530afDan Gohman bool SuppressFastISel = false; 67233134c4a75558288d663267c8991f6bd37a530afDan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 6735edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman LowerArguments(LLVMBB); 674f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 67533134c4a75558288d663267c8991f6bd37a530afDan Gohman // If any of the arguments has the byval attribute, forgo 67633134c4a75558288d663267c8991f6bd37a530afDan Gohman // fast-isel in the entry block. 677a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (FastIS) { 67833134c4a75558288d663267c8991f6bd37a530afDan Gohman unsigned j = 1; 67933134c4a75558288d663267c8991f6bd37a530afDan Gohman for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end(); 68033134c4a75558288d663267c8991f6bd37a530afDan Gohman I != E; ++I, ++j) 6810598866c052147c31b808391f58434ce3dbfb838Devang Patel if (Fn.paramHasAttr(j, Attribute::ByVal)) { 68277ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) 6834437ae213d5435390f0750213b53ec807c047f22Chris Lattner errs() << "FastISel skips entry block due to byval argument\n"; 68433134c4a75558288d663267c8991f6bd37a530afDan Gohman SuppressFastISel = true; 68533134c4a75558288d663267c8991f6bd37a530afDan Gohman break; 68633134c4a75558288d663267c8991f6bd37a530afDan Gohman } 68733134c4a75558288d663267c8991f6bd37a530afDan Gohman } 68833134c4a75558288d663267c8991f6bd37a530afDan Gohman } 68933134c4a75558288d663267c8991f6bd37a530afDan Gohman 690dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (MMI && BB->isLandingPad()) { 691dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 692dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 693dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman unsigned LabelID = MMI->addLandingPad(BB); 694dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 695dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman const TargetInstrDesc &II = TII.get(TargetInstrInfo::EH_LABEL); 696b288487a8e2291dd802e19b1a9bc930368f448bfBill Wendling BuildMI(BB, SDL->getCurDebugLoc(), II).addImm(LabelID); 697dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 698dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Mark exception register as live in. 699dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 700dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Reg) BB->addLiveIn(Reg); 701dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 702dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // Mark exception selector register as live in. 703dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 704dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Reg) BB->addLiveIn(Reg); 705dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 706dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 707dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 708dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // like, the basic block containing the invoke), and need to be associated 709dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // with it in the dwarf exception handling tables. Currently however the 710dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 711dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 712dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // then breaking it can result in the intrinsics being in the successor of 713dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // the landing pad, not the landing pad itself. This results in exceptions 714dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // not being caught because no typeids are associated with the invoke. 715dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // This may not be the only way things can go wrong, but it is the only way 716dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // we try to work around for the moment. 717dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 718dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 719dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 720dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman BasicBlock::iterator I, E; 721dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 722dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (isa<EHSelectorInst>(I)) 723dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman break; 724dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 725dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (I == E) 726dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman // No catch info found - try to extract some from the successor. 727dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, *FuncInfo); 728dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman } 729dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman } 730dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman 731f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 732dd5b58ad7be78be90390074f0df138778af5c895Dan Gohman if (FastIS && !SuppressFastISel) { 733a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Emit code for any incoming arguments. This must happen before 734a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // beginning FastISel on the entry block. 735a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 736a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman CurDAG->setRoot(SDL->getControlRoot()); 737a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman CodeGenAndEmitDAG(); 738a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman SDL->clear(); 739a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 740241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->startNewBlock(BB); 741a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 742a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman for (; BI != End; ++BI) { 743a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar if (MDDbgKind) { 744a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Update DebugLoc if debug information is attached with this 745a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // instruction. 746a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar if (MDNode *Dbg = 747a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar dyn_cast_or_null<MDNode>(TheMetadata.getMD(MDDbgKind, BI))) { 748a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar DILocation DILoc(Dbg); 749a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar DebugLoc Loc = ExtractDebugLocation(DILoc, 750a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar MF.getDebugLocInfo()); 751a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar FastIS->setCurDebugLoc(Loc); 752a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 753a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 754123eaa71b50f5ac2ea2233685baedddbb72f387bDevang Patel 755a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Just before the terminator instruction, insert instructions to 756a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // feed PHI nodes in successor blocks. 757a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<TerminatorInst>(BI)) 758a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!HandlePHINodesInSuccessorBlocksFast(LLVMBB, FastIS)) { 75977ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 7604437ae213d5435390f0750213b53ec807c047f22Chris Lattner errs() << "FastISel miss: "; 76177ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman BI->dump(); 76277ca41e5c3f99ee8962b21a7d90bb251a594a65eDan Gohman } 763a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar assert(!EnableFastISelAbort && 764f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "FastISel didn't handle a PHI in a successor"); 765a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 766a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 76733134c4a75558288d663267c8991f6bd37a530afDan Gohman 768a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // First try normal tablegen-generated "fast" selection. 769a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (FastIS->SelectInstruction(BI)) 770a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 771a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 772a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Next, try calling the target to attempt to handle the instruction. 773a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (FastIS->TargetSelectInstruction(BI)) 774a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 775f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 776a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 777a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (isa<CallInst>(BI)) { 778a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 7794437ae213d5435390f0750213b53ec807c047f22Chris Lattner errs() << "FastISel missed call: "; 780a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 781f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 782f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 7831d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson if (BI->getType() != Type::getVoidTy(*CurDAG->getContext())) { 784a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman unsigned &R = FuncInfo->ValueMap[BI]; 785a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 786a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman R = FuncInfo->CreateRegForValue(BI); 787f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 788a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 789390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel SDL->setCurDebugLoc(FastIS->getCurDebugLoc()); 790a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman SelectBasicBlock(LLVMBB, BI, next(BI)); 791241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // If the instruction was codegen'd with multiple blocks, 792241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman // inform the FastISel object where to resume inserting. 793241f464d24a6c22721607841069bbeb17b3f71e6Dan Gohman FastIS->setCurrentBlock(BB); 794a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 795f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 796a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 797a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Otherwise, give up on FastISel for the rest of the block. 798a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For now, be a little lenient about non-branch terminators. 799a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!isa<TerminatorInst>(BI) || isa<BranchInst>(BI)) { 800a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 8014437ae213d5435390f0750213b53ec807c047f22Chris Lattner errs() << "FastISel miss: "; 802a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman BI->dump(); 803a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 804a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 805a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 806a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 807c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 808a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 809a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 810f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 811f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 812f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 813d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // Run SelectionDAG instruction selection on the remainder of the block 814d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // not handled by FastISel. If FastISel is not run, this is the entire 8153df24e667f04a7003342b534310919abc9c87418Dan Gohman // block. 816390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel if (BI != End) { 817390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel // If FastISel is run and it has known DebugLoc then use it. 818390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel if (FastIS && !FastIS->getCurDebugLoc().isUnknown()) 819390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel SDL->setCurDebugLoc(FastIS->getCurDebugLoc()); 8209f1185076d60153fd35feb3cadb1b4cd8debc0b6Evan Cheng SelectBasicBlock(LLVMBB, BI, End); 821390f3ace34855a3d4c9e0adf468976375f8c6dc1Devang Patel } 822381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 8237c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FinishBasicBlock(); 82439fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 825a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 826a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 8270e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 8280e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 829fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 8307c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::FinishBasicBlock() { 8311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 832bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Target-post-processed machine code:\n"); 833f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(BB->dump()); 8344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 835bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner DEBUG(errs() << "Total amount of phi nodes to update: " 836bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner << SDL->PHINodesToUpdate.size() << "\n"); 8377c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DEBUG(for (unsigned i = 0, e = SDL->PHINodesToUpdate.size(); i != e; ++i) 838bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner errs() << "Node " << i << " : (" 839bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner << SDL->PHINodesToUpdate[i].first 840bbbfa99d3d18fe9f20265305e833666645ada528Chris Lattner << ", " << SDL->PHINodesToUpdate[i].second << ")\n"); 841a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 842a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 8431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 8447c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (SDL->SwitchCases.empty() && 8457c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->JTCases.empty() && 8467c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases.empty()) { 8477c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->PHINodesToUpdate.size(); i != e; ++i) { 8487c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineInstr *PHI = SDL->PHINodesToUpdate[i].first; 849f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 850f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 8517c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[i].second, 8529ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 8539ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 854f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 8557c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->PHINodesToUpdate.clear(); 856f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 8571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8597c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->BitTestCases.size(); i != e; ++i) { 8604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 8617c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (!SDL->BitTestCases[i].Emitted) { 8624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 8637c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->BitTestCases[i].Parent; 8647c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 8654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 8667c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitBitTestHeader(SDL->BitTestCases[i]); 8677c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 868f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 8697c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 870a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 8714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8727c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned j = 0, ej = SDL->BitTestCases[i].Cases.size(); j != ej; ++j) { 8734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 8747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->BitTestCases[i].Cases[j].ThisBB; 8757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 8764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 8774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 8787c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitBitTestCase(SDL->BitTestCases[i].Cases[j+1].ThisBB, 8797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases[i].Reg, 8807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases[i].Cases[j]); 8814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 8827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitBitTestCase(SDL->BitTestCases[i].Default, 8837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases[i].Reg, 8847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases[i].Cases[j]); 885a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 886a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 8877c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 888f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 8897c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 8904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 8914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 8924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 8937c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned pi = 0, pe = SDL->PHINodesToUpdate.size(); pi != pe; ++pi) { 8947c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineInstr *PHI = SDL->PHINodesToUpdate[pi].first; 8954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 8964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 8974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 8984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 8994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 9007c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (PHIBB == SDL->BitTestCases[i].Default) { 9017c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, 9029ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 9037c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDL->BitTestCases[i].Parent)); 9047c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, 9059ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 9067c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDL->BitTestCases[i].Cases. 9079ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 9084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 9107c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned j = 0, ej = SDL->BitTestCases[i].Cases.size(); 9117c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 9127c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineBasicBlock* cBB = SDL->BitTestCases[i].Cases[j].ThisBB; 9134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 9144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 9157c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, 9169ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 9179ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 9184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 9227c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases.clear(); 9234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 9249453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 9259453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 9269453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 9277c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->JTCases.size(); i != e; ++i) { 9283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 9297c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (!SDL->JTCases[i].first.Emitted) { 9303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 9317c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->JTCases[i].first.HeaderBB; 9327c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 9333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 9347c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitJumpTableHeader(SDL->JTCases[i].second, SDL->JTCases[i].first); 9357c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 936f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 9377c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 9384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 939a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 94037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 9417c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->JTCases[i].second.MBB; 9427c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 94337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 9447c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitJumpTable(SDL->JTCases[i].second); 9457c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 946f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 9477c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 948a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 94937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 9507c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned pi = 0, pe = SDL->PHINodesToUpdate.size(); pi != pe; ++pi) { 9517c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineInstr *PHI = SDL->PHINodesToUpdate[pi].first; 95237efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 95337efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 95437efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 9554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 9567c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (PHIBB == SDL->JTCases[i].second.Default) { 957ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 958ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng (MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, false)); 959ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 960ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng (MachineOperand::CreateMBB(SDL->JTCases[i].first.HeaderBB)); 961f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 9624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 963f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 964ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 965ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng (MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, false)); 9669ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 96737efe6764568a3829fee26aba532283131d1a104Nate Begeman } 96837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 96937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 9707c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->JTCases.clear(); 971a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 972b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 973b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 9747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->PHINodesToUpdate.size(); i != e; ++i) { 9757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineInstr *PHI = SDL->PHINodesToUpdate[i].first; 976b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 977b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 978b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 9797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[i].second, 9809ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 9819ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 982b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 983b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 984a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 985f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 986f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 9877c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->SwitchCases.size(); i != e; ++i) { 988f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 989fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng MachineBasicBlock *ThisBB = BB = SDL->SwitchCases[i].ThisBB; 9907c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 991a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 992f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 9937c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitSwitchCase(SDL->SwitchCases[i]); 9947c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 995f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 996a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 997d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 998d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 999d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1000d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 10017c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman while ((BB = SDL->SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 1002fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng // If new BB's are created during scheduling, the edges may have been 1003ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // updated. That is, the edge from ThisBB to BB may have been split and 1004ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng // BB's predecessor is now another block. 1005fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng DenseMap<MachineBasicBlock*, MachineBasicBlock*>::iterator EI = 1006fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng SDL->EdgeMapping.find(BB); 1007fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng if (EI != SDL->EdgeMapping.end()) 1008fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng ThisBB = EI->second; 1009d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 1010d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 1011d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 1012d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 10137c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman assert(pn != SDL->PHINodesToUpdate.size() && 10147c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman "Didn't find PHI entry!"); 10158be58a11868ae081c195c107cd39a07f1f523877Evan Cheng if (SDL->PHINodesToUpdate[pn].first == Phi) { 10168be58a11868ae081c195c107cd39a07f1f523877Evan Cheng Phi->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pn]. 10178be58a11868ae081c195c107cd39a07f1f523877Evan Cheng second, false)); 1018fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1019d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 10208be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1021d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1022f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1023a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1024d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 10257c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (BB == SDL->SwitchCases[i].FalseBB) 10267c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->SwitchCases[i].FalseBB = 0; 1027a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1028d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 10297c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->SwitchCases[i].TrueBB = SDL->SwitchCases[i].FalseBB; 10307c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->SwitchCases[i].FalseBB = 0; 1031f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 10327c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman assert(SDL->SwitchCases[i].TrueBB == 0 && SDL->SwitchCases[i].FalseBB == 0); 1033fb2e752e4175920d0531f2afc93a23d0cdf4db14Evan Cheng SDL->clear(); 1034a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 10357c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->SwitchCases.clear(); 10367c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 10377c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->PHINodesToUpdate.clear(); 10381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1039a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 104013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 10410a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 10420a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 10430a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 10445e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 104547ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1046eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1047a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 104813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1049eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 10509373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 10514ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1052a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1053be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1054a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 10550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1056fc54c552963545a81e4ea38e60460590afb2d5aeDan GohmanScheduleHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 1057fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman return new ScheduleHazardRecognizer(); 10589ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 10599ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 1060755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1061755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1062755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1063755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1064755480681c795d585c73556c028b6143c46bda86Chris Lattner 1065755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1066755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1067755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1068755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1069a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1070dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 10712e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 10722e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1073a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1074755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1075755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1076755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1077a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1078755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 10792e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1080755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1081a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1082755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1083755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 10842e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1085ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1086755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1087a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1088755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1089755480681c795d585c73556c028b6143c46bda86Chris Lattner 1090755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1091755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1092755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1093755480681c795d585c73556c028b6143c46bda86Chris Lattner 1094755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1095755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1096755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1097755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1098a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 10992e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 11002e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 11012e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1102a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1103755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1104755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1105755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1106a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1107755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 11082e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1109755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1110a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1111755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1112755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 11132e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1114a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11152e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 1116ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 1117a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1118755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1119755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1120755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1121a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1122755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1123a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1124755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1125755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1126755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1127755480681c795d585c73556c028b6143c46bda86Chris Lattner 11289ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 11290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 11300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 11310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1132f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1133475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 11340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 11350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 11360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 11370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 11380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 11390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 1140825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (InOps[e-1].getValueType() == MVT::Flag) 11410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 1142a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1144f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 114586b49f8e2de796cb46c7c8b6a4c4900533fd53f4Dale Johannesen if ((Flags & 7) != 4 /*MEM*/) { 11460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1147697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1148697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1149697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 11500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1151697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1152697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 11530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1154475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1155f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) { 11567d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin llvm_report_error("Could not match memory address. Inline asm" 11577d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin " failure!"); 11580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1159a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 1161e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT IntPtrTy = TLI.getPointerTy(); 116286b49f8e2de796cb46c7c8b6a4c4900533fd53f4Dale Johannesen Ops.push_back(CurDAG->getTargetConstant(4/*MEM*/ | (SelOps.size()<< 3), 1163f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman IntPtrTy)); 11640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 11650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 11660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 11670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1168a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 11690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 11700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 11710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 11720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1173794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1174e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson/// findFlagUse - Return use of EVT::Flag value produced by the specified 1175c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1176c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1177c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic SDNode *findFlagUse(SDNode *N) { 1178c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1179c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1180c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1181c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1182c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1183c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1184c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1185c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1186c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1187c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1188c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1189c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1190c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1191c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *Root, 1192c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SmallPtrSet<SDNode*, 16> &Visited) { 1193c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use->getNodeId() < Def->getNodeId() || 1194c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov !Visited.insert(Use)) 1195c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1196c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1197c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1198c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1199c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1200c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1201c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1202c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1203c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1204c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1205c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1206c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1207c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (findNonImmUse(N, Def, ImmedUse, Root, Visited)) 1208c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1209c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1210c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1211c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1212c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1213c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// isNonImmUse - Start searching from Root up the DAG to check is Def can 1214c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// be reached. Return true if that's the case. However, ignore direct uses 1215c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// by ImmedUse (which would be U in the example illustrated in 1216c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// IsLegalAndProfitableToFold) and by Root (which can happen in the store 1217c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// case). 1218c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// FIXME: to be really generic, we should allow direct use by any node 1219c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// that is being folded. But realisticly since we only fold loads which 1220c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// have one non-chain use, we only need to watch out for load/op/store 1221c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// and load/op/cmp case where the root (store / cmp) may reach the load via 1222c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// its chain operand. 1223c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic inline bool isNonImmUse(SDNode *Root, SDNode *Def, SDNode *ImmedUse) { 1224c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SmallPtrSet<SDNode*, 16> Visited; 1225c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return findNonImmUse(Root, Def, ImmedUse, Root, Visited); 1226c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1227c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1228c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// IsLegalAndProfitableToFold - Returns true if the specific operand node N of 1229c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// U can be folded during instruction selection that starts at Root and 1230c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// folding N is profitable. 1231c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovbool SelectionDAGISel::IsLegalAndProfitableToFold(SDNode *N, SDNode *U, 1232c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *Root) const { 1233c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1234c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1235c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1236c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1237c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1238c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1239c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1240c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1241c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1242c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1243c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1244c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1245c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1246c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1247c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1248c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1249c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1250c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1251c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root produces a flag, then it gets (even more) interesting. Since it 1252c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // will be "glued" together with its flag use in the scheduler, we need to 1253c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1254c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1255c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1256c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1257c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1258c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1259c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1260c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1261c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1262c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1263c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1264c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1265c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1266c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1267c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1268c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1269c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1270c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [FU] // 1271c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1272c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If FU (flag use) indirectly reaches N (the load), and Root folds N 1273c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // (call it Fold), then X is a predecessor of FU and a successor of 1274c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Fold. But since Fold and FU are flagged together, this will create 1275c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1276c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1277e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1278825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson while (VT == MVT::Flag) { 1279c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *FU = findFlagUse(Root); 1280c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (FU == NULL) 1281c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1282c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov Root = FU; 1283c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 1284c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1285c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1286c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return !isNonImmUse(Root, N, U); 1287c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1288c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1289c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 12901997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 1291