SelectionDAGISel.cpp revision 34706936412b9e9ff73511fed58e97bf6e100e69
11c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===-- SelectionDAGISel.cpp - Implement the SelectionDAGISel class -------===// 2edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 31c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// The LLVM Compiler Infrastructure 41c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman// 81c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 91c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// This implements the SelectionDAGISel class. 111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner// 121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define DEBUG_TYPE "isel" 1584fbac580941548a6ab1121ed3b0ffdc4e2bc080Dan Gohman#include "ScheduleDAGSDNodes.h" 162048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman#include "SelectionDAGBuilder.h" 174c3fd9f92f89810d659973d2666ab729758de64aDan Gohman#include "llvm/CodeGen/FunctionLoweringInfo.h" 1884fbac580941548a6ab1121ed3b0ffdc4e2bc080Dan Gohman#include "llvm/CodeGen/SelectionDAGISel.h" 19c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 207cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak#include "llvm/Analysis/BranchProbabilityInfo.h" 21713f043c16220b746804f668a72f4e0344cbe4d1Devang Patel#include "llvm/Analysis/DebugInfo.h" 225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 24ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 2875c478a96a542dc386152e00518441e63d22058dChris Lattner#include "llvm/LLVMContext.h" 299af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling#include "llvm/Module.h" 3078eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman#include "llvm/CodeGen/FastISel.h" 315a29c9eed157af51a8d338b5a225b146881819e8Gordon Henriksen#include "llvm/CodeGen/GCStrategy.h" 325eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen#include "llvm/CodeGen/GCMetadata.h" 33b92187a4103dca24c3767c380f63593d1f6161a7Bill Wendling#include "llvm/CodeGen/MachineFrameInfo.h" 341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 38fc54c552963545a81e4ea38e60460590afb2d5aeDan Gohman#include "llvm/CodeGen/ScheduleHazardRecognizer.h" 39eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 416f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 42e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman#include "llvm/Target/TargetIntrinsicInfo.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 44243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson#include "llvm/Target/TargetLibraryInfo.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 47124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 4896ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner#include "llvm/Transforms/Utils/BasicBlockUtils.h" 49a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 50db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 517d696d80409aad20bb5da0fc4eccab941dd371d4Torok Edwin#include "llvm/Support/ErrorHandling.h" 52db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 53ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar#include "llvm/Support/raw_ostream.h" 542dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich#include "llvm/ADT/PostOrderIterator.h" 55c19ae9d91d30bc008e0be5f5d4727f333199f64cChris Lattner#include "llvm/ADT/Statistic.h" 567e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 59c19ae9d91d30bc008e0be5f5d4727f333199f64cChris LattnerSTATISTIC(NumFastIselFailures, "Number of instructions fast isel failed on"); 6062427ae8d311d3dda8f5257ddf34d13c19c214bbJim GrosbachSTATISTIC(NumFastIselSuccess, "Number of instructions fast isel selected"); 61948f7d0216cbd847a68fc6aaf391f01816a02494Devang PatelSTATISTIC(NumFastIselBlocks, "Number of blocks selected entirely by fast isel"); 62948f7d0216cbd847a68fc6aaf391f01816a02494Devang PatelSTATISTIC(NumDAGBlocks, "Number of blocks selected using DAG"); 63bed993d8a4ede75a24a142437057b42498ce5b9fChris LattnerSTATISTIC(NumDAGIselRetries,"Number of times dag isel has to try another path"); 64a568d66512759f93e0d37af7c8f905603dd27449Nick Lewycky 6573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#ifndef NDEBUG 66f2a745efe50dfd57f0e83e5f3ed964611cba6077Chad Rosierstatic cl::opt<bool> 67f2a745efe50dfd57f0e83e5f3ed964611cba6077Chad RosierEnableFastISelVerbose2("fast-isel-verbose2", cl::Hidden, 68f2a745efe50dfd57f0e83e5f3ed964611cba6077Chad Rosier cl::desc("Enable extra verbose messages in the \"fast\" " 69f2a745efe50dfd57f0e83e5f3ed964611cba6077Chad Rosier "instruction selector")); 7073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Terminators 7173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailRet,"Fast isel fails on Ret"); 7273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailBr,"Fast isel fails on Br"); 7373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSwitch,"Fast isel fails on Switch"); 7473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailIndirectBr,"Fast isel fails on IndirectBr"); 7573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailInvoke,"Fast isel fails on Invoke"); 7673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailResume,"Fast isel fails on Resume"); 7773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailUnwind,"Fast isel fails on Unwind"); 7873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailUnreachable,"Fast isel fails on Unreachable"); 7973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 8073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Standard binary operators... 8173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAdd,"Fast isel fails on Add"); 8273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFAdd,"Fast isel fails on FAdd"); 8373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSub,"Fast isel fails on Sub"); 8473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFSub,"Fast isel fails on FSub"); 8573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailMul,"Fast isel fails on Mul"); 8673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFMul,"Fast isel fails on FMul"); 8773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailUDiv,"Fast isel fails on UDiv"); 8873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSDiv,"Fast isel fails on SDiv"); 8973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFDiv,"Fast isel fails on FDiv"); 9073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailURem,"Fast isel fails on URem"); 9173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSRem,"Fast isel fails on SRem"); 9273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFRem,"Fast isel fails on FRem"); 9373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 9473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Logical operators... 9573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAnd,"Fast isel fails on And"); 9673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailOr,"Fast isel fails on Or"); 9773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailXor,"Fast isel fails on Xor"); 9873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 9973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Memory instructions... 10073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAlloca,"Fast isel fails on Alloca"); 10173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailLoad,"Fast isel fails on Load"); 10273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailStore,"Fast isel fails on Store"); 10373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAtomicCmpXchg,"Fast isel fails on AtomicCmpXchg"); 10473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAtomicRMW,"Fast isel fails on AtomicRWM"); 10573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFence,"Fast isel fails on Frence"); 10673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailGetElementPtr,"Fast isel fails on GetElementPtr"); 10773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 10873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Convert instructions... 10973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailTrunc,"Fast isel fails on Trunc"); 11073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailZExt,"Fast isel fails on ZExt"); 11173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSExt,"Fast isel fails on SExt"); 11273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFPTrunc,"Fast isel fails on FPTrunc"); 11373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFPExt,"Fast isel fails on FPExt"); 11473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFPToUI,"Fast isel fails on FPToUI"); 11573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFPToSI,"Fast isel fails on FPToSI"); 11673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailUIToFP,"Fast isel fails on UIToFP"); 11773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSIToFP,"Fast isel fails on SIToFP"); 11873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailIntToPtr,"Fast isel fails on IntToPtr"); 11973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailPtrToInt,"Fast isel fails on PtrToInt"); 12073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailBitCast,"Fast isel fails on BitCast"); 12173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 12273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Other instructions... 12373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailICmp,"Fast isel fails on ICmp"); 12473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFCmp,"Fast isel fails on FCmp"); 12573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailPHI,"Fast isel fails on PHI"); 12673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSelect,"Fast isel fails on Select"); 12773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailCall,"Fast isel fails on Call"); 12873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailShl,"Fast isel fails on Shl"); 12973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailLShr,"Fast isel fails on LShr"); 13073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAShr,"Fast isel fails on AShr"); 13173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailVAArg,"Fast isel fails on VAArg"); 13273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailExtractElement,"Fast isel fails on ExtractElement"); 13373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailInsertElement,"Fast isel fails on InsertElement"); 13473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailShuffleVector,"Fast isel fails on ShuffleVector"); 13573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailExtractValue,"Fast isel fails on ExtractValue"); 13673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailInsertValue,"Fast isel fails on InsertValue"); 13773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailLandingPad,"Fast isel fails on LandingPad"); 13873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#endif 13973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 140ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 141293d5f8bc02a9148238b2c79484637f56de65b9cDan GohmanEnableFastISelVerbose("fast-isel-verbose", cl::Hidden, 142d659d50482e2f9edf8f436e4a1aa30c68c6d020bDan Gohman cl::desc("Enable verbose messages in the \"fast\" " 143293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohman "instruction selector")); 144293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohmanstatic cl::opt<bool> 1454344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan GohmanEnableFastISelAbort("fast-isel-abort", cl::Hidden, 1464344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman cl::desc("Enable abort calls when \"fast\" instruction fails")); 147ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 1487cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszakstatic cl::opt<bool> 1497cc2b07437a1243c33324549a1904fefc5f1845eJakub StaszakUseMBPI("use-mbpi", 1507cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak cl::desc("use Machine Branch Probability Info"), 1517cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak cl::init(true), cl::Hidden); 1527cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak 153da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 1547944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 155462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 156462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 157462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 158462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 159462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 160462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 161462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 162462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 163462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 164462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 165462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 166462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 167462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 168462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 16925cf2275ff7de3de3bc0e508abaf457413d74725Duncan SandsViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden, 17025cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands cl::desc("Pop up a window to show dags before the post legalize types" 17125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands " dag combine pass")); 17225cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sandsstatic cl::opt<bool> 173a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 174a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 175a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 176a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 177a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 1783e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 1793e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 1805bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 1817944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 182462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 183462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 184462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 18525cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombineLT = false, 186462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 187462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 1887944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 1897944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 190eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 191eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 192eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 193eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 194eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 195eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 196eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 197eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 198eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 199eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 200eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 201eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 202844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 203844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 204844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 205844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 206844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 207844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 20813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 209844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 210b8cab9227a0f6ffbdaae33e3c64268e265008a6aDan GohmandefaultListDAGScheduler("default", "Best scheduler for the target", 211844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 2124ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 213f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohmannamespace llvm { 214f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman //===--------------------------------------------------------------------===// 215f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// createDefaultScheduler - This creates an instruction scheduler appropriate 216f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// for the target. 21747ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS, 21898a366d547772010e94609e4584489b3e5ce0043Bill Wendling CodeGenOpt::Level OptLevel) { 219e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman const TargetLowering &TLI = IS->getTargetLowering(); 220e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman 22198a366d547772010e94609e4584489b3e5ce0043Bill Wendling if (OptLevel == CodeGenOpt::None) 222e667e0172346773cb5718f694efa93ea49114c7bDan Gohman return createSourceListDAGScheduler(IS, OptLevel); 22315a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng if (TLI.getSchedulingPreference() == Sched::RegPressure) 22415a16def6e70c8f7df1023da80ceb89887203b40Evan Cheng return createBURRListDAGScheduler(IS, OptLevel); 22570017e44cdba1946cc478ce1856a3e855a767e28Evan Cheng if (TLI.getSchedulingPreference() == Sched::Hybrid) 22670017e44cdba1946cc478ce1856a3e855a767e28Evan Cheng return createHybridListDAGScheduler(IS, OptLevel); 22770017e44cdba1946cc478ce1856a3e855a767e28Evan Cheng assert(TLI.getSchedulingPreference() == Sched::ILP && 228211ffa13519cadfb7f9baf4c8447fa055bf38fe8Evan Cheng "Unknown sched type!"); 22970017e44cdba1946cc478ce1856a3e855a767e28Evan Cheng return createILPListDAGScheduler(IS, OptLevel); 2303a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 2311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 233ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 234533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// that mark instructions with the 'usesCustomInserter' flag. These 235025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 236025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 237533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// basic blocks, and this method is called to expand it into a sequence of 238533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// instructions, potentially also creating new basic blocks and control flow. 239533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// When new basic blocks are inserted and the edges from MBB to its successors 240533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// are modified, the method should insert pairs of <OldSucc, NewSucc> into the 241533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// DenseMap. 242af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanMachineBasicBlock * 243af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanTargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 244af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman MachineBasicBlock *MBB) const { 245f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#ifndef NDEBUG 2461a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "If a target marks an instruction with " 247533297b58da8c74bec65551e1aface9801fc2259Dan Gohman "'usesCustomInserter', it must implement " 248f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "TargetLowering::EmitInstrWithCustomInserter!"; 249f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#endif 250c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable(0); 251a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar return 0; 252025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 253025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 25437fefc20d3a1e3934a377567d54a141f67752227Evan Chengvoid TargetLowering::AdjustInstrPostInstrSelection(MachineInstr *MI, 25537fefc20d3a1e3934a377567d54a141f67752227Evan Cheng SDNode *Node) const { 2565a96b3dad2f634c9081c8b2b6c2575441dc5a2bdEvan Cheng assert(!MI->hasPostISelHook() && 2573be654f8082dcbdff011a6716a7c90486e28fc9eAndrew Trick "If a target marks an instruction with 'hasPostISelHook', " 2583be654f8082dcbdff011a6716a7c90486e28fc9eAndrew Trick "it must implement TargetLowering::AdjustInstrPostInstrSelection!"); 25937fefc20d3a1e3934a377567d54a141f67752227Evan Cheng} 26037fefc20d3a1e3934a377567d54a141f67752227Evan Cheng 2617041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2627041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 2637041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 265762a17a040f2e5c7f76b6b85d853cca454289e71Eric ChristopherSelectionDAGISel::SelectionDAGISel(const TargetMachine &tm, 266762a17a040f2e5c7f76b6b85d853cca454289e71Eric Christopher CodeGenOpt::Level OL) : 26790c579de5a383cee278acc3f7e7b9d0a656e6a35Owen Anderson MachineFunctionPass(ID), TM(tm), TLI(*tm.getTargetLowering()), 2687c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 2690508d047fefef36d4f943ee13c82c18cf3a943abDevang Patel CurDAG(new SelectionDAG(tm, OL)), 27055e59c186303ff02c0be7429da3b1b36c347f164Dan Gohman SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)), 2717c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 272be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling OptLevel(OL), 273081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson DAGSize(0) { 274081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson initializeGCModuleInfoPass(*PassRegistry::getPassRegistry()); 275081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson initializeAliasAnalysisAnalysisGroup(*PassRegistry::getPassRegistry()); 2767cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak initializeBranchProbabilityInfoPass(*PassRegistry::getPassRegistry()); 277243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson initializeTargetLibraryInfoPass(*PassRegistry::getPassRegistry()); 278081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson } 2797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 2807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 2812048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman delete SDB; 2827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 2837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 2847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 2857c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 286495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 287c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 288a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<AliasAnalysis>(); 2895eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 290a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<GCModuleInfo>(); 291243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson AU.addRequired<TargetLibraryInfo>(); 2927cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak if (UseMBPI && OptLevel != CodeGenOpt::None) 2937cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak AU.addRequired<BranchProbabilityInfo>(); 294ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass::getAnalysisUsage(AU); 295495a0b51915eb763576874f29192820b731edc22Chris Lattner} 2961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that 29896ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// may trap on it. In this case we have to split the edge so that the path 29996ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// through the predecessor block that doesn't go to the phi block doesn't 30096ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// execute the possibly trapping instruction. 30196ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// 30296ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// This is required for correctness, so it must be done at -O0. 30396ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// 30496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattnerstatic void SplitCriticalSideEffectEdges(Function &Fn, Pass *SDISel) { 30596ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // Loop for blocks with phi nodes. 30696ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 30796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner PHINode *PN = dyn_cast<PHINode>(BB->begin()); 30896ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner if (PN == 0) continue; 3096e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 31096ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner ReprocessBlock: 31196ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // For each block with a PHI node, check to see if any of the input values 31296ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // are potentially trapping constant expressions. Constant expressions are 31396ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // the only potentially trapping value that can occur as the argument to a 31496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // PHI. 31596ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I) 31696ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) { 31796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i)); 31896ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner if (CE == 0 || !CE->canTrap()) continue; 3196e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 32096ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // The only case we have to worry about is when the edge is critical. 32196ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // Since this block has a PHI Node, we assume it has multiple input 32296ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // edges: check to see if the pred has multiple successors. 32396ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner BasicBlock *Pred = PN->getIncomingBlock(i); 32496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner if (Pred->getTerminator()->getNumSuccessors() == 1) 32596ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner continue; 3266e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 32796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // Okay, we have to split this edge. 32896ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner SplitCriticalEdge(Pred->getTerminator(), 32996ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner GetSuccessorNumber(Pred, BB), SDISel, true); 33096ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner goto ReprocessBlock; 33196ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner } 33296ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner } 33396ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner} 33496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner 335ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohmanbool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) { 3364344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman // Do some sanity-checking on the command-line options. 3378a8d479214745c82ef00f08d4e4f1c173b5f9ce2Nick Lewycky assert((!EnableFastISelVerbose || TM.Options.EnableFastISel) && 3384344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-verbose requires -fast-isel"); 3398a8d479214745c82ef00f08d4e4f1c173b5f9ce2Nick Lewycky assert((!EnableFastISelAbort || TM.Options.EnableFastISel) && 3404344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-abort requires -fast-isel"); 3414344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman 342ae541aad5c36cb3e4256514447d1f81e253079c7Dan Gohman const Function &Fn = *mf.getFunction(); 3438a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII = *TM.getInstrInfo(); 3448a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI = *TM.getRegisterInfo(); 3458a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 346c0fb65da040668df543db514f05e4be571edf700Dan Gohman MF = &mf; 34779ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman RegInfo = &MF->getRegInfo(); 348c0fb65da040668df543db514f05e4be571edf700Dan Gohman AA = &getAnalysis<AliasAnalysis>(); 349243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson LibInfo = &getAnalysis<TargetLibraryInfo>(); 350c0fb65da040668df543db514f05e4be571edf700Dan Gohman GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0; 351c0fb65da040668df543db514f05e4be571edf700Dan Gohman 3521a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n"); 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 35496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner SplitCriticalSideEffectEdges(const_cast<Function&>(Fn), this); 3556e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 356de6e783b2490447866b592cd39855e6f4d25efffChris Lattner CurDAG->init(*MF); 3577451d3e09d26115195280ba36f686a0a90815089Dan Gohman FuncInfo->set(Fn, *MF); 3587cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak 3597cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak if (UseMBPI && OptLevel != CodeGenOpt::None) 3607cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak FuncInfo->BPI = &getAnalysis<BranchProbabilityInfo>(); 3617cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak else 3627cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak FuncInfo->BPI = 0; 3637cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak 364243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson SDB->init(GFI, *AA, LibInfo); 3651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3666a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman SelectAllBasicBlocks(Fn); 367edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3681b79a2ff547a5ead0eef933bb02f51b3a2f4cc1cDan Gohman // If the first basic block in the function has live ins that need to be 3698a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 3708a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 3712ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock *EntryMBB = MF->begin(); 3722ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII); 3732ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 374394427b014a7126e56f3ee411993f08677d93c83Devang Patel DenseMap<unsigned, unsigned> LiveInMap; 375394427b014a7126e56f3ee411993f08677d93c83Devang Patel if (!FuncInfo->ArgDbgValues.empty()) 376394427b014a7126e56f3ee411993f08677d93c83Devang Patel for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(), 377394427b014a7126e56f3ee411993f08677d93c83Devang Patel E = RegInfo->livein_end(); LI != E; ++LI) 3786e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick if (LI->second) 379394427b014a7126e56f3ee411993f08677d93c83Devang Patel LiveInMap.insert(std::make_pair(LI->first, LI->second)); 380394427b014a7126e56f3ee411993f08677d93c83Devang Patel 3812ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Insert DBG_VALUE instructions for function arguments to the entry block. 3822ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) { 3832ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1]; 3842ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng unsigned Reg = MI->getOperand(0).getReg(); 3852ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng if (TargetRegisterInfo::isPhysicalRegister(Reg)) 3862ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng EntryMBB->insert(EntryMBB->begin(), MI); 3872ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng else { 3882ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *Def = RegInfo->getVRegDef(Reg); 3892ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock::iterator InsertPos = Def; 390f1ced259b5617e9c15fcafd47e090c22e2702062Evan Cheng // FIXME: VR def may not be in entry block. 391f1ced259b5617e9c15fcafd47e090c22e2702062Evan Cheng Def->getParent()->insert(llvm::next(InsertPos), MI); 3922ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 393394427b014a7126e56f3ee411993f08677d93c83Devang Patel 394394427b014a7126e56f3ee411993f08677d93c83Devang Patel // If Reg is live-in then update debug info to track its copy in a vreg. 395394427b014a7126e56f3ee411993f08677d93c83Devang Patel DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg); 396394427b014a7126e56f3ee411993f08677d93c83Devang Patel if (LDI != LiveInMap.end()) { 397394427b014a7126e56f3ee411993f08677d93c83Devang Patel MachineInstr *Def = RegInfo->getVRegDef(LDI->second); 398394427b014a7126e56f3ee411993f08677d93c83Devang Patel MachineBasicBlock::iterator InsertPos = Def; 3996e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick const MDNode *Variable = 400394427b014a7126e56f3ee411993f08677d93c83Devang Patel MI->getOperand(MI->getNumOperands()-1).getMetadata(); 401394427b014a7126e56f3ee411993f08677d93c83Devang Patel unsigned Offset = MI->getOperand(1).getImm(); 402394427b014a7126e56f3ee411993f08677d93c83Devang Patel // Def is never a terminator here, so it is ok to increment InsertPos. 4036e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(), 404394427b014a7126e56f3ee411993f08677d93c83Devang Patel TII.get(TargetOpcode::DBG_VALUE)) 405394427b014a7126e56f3ee411993f08677d93c83Devang Patel .addReg(LDI->second, RegState::Debug) 406394427b014a7126e56f3ee411993f08677d93c83Devang Patel .addImm(Offset).addMetadata(Variable); 40744cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel 40844cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel // If this vreg is directly copied into an exported register then 40944cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel // that COPY instructions also need DBG_VALUE, if it is the only 41044cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel // user of LDI->second. 41144cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel MachineInstr *CopyUseMI = NULL; 4126e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick for (MachineRegisterInfo::use_iterator 4136e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick UI = RegInfo->use_begin(LDI->second); 41444cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel MachineInstr *UseMI = UI.skipInstruction();) { 41544cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel if (UseMI->isDebugValue()) continue; 41644cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel if (UseMI->isCopy() && !CopyUseMI && UseMI->getParent() == EntryMBB) { 41744cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel CopyUseMI = UseMI; continue; 41844cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel } 41944cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel // Otherwise this is another use or second copy use. 42044cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel CopyUseMI = NULL; break; 42144cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel } 42244cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel if (CopyUseMI) { 42344cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel MachineInstr *NewMI = 4246e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick BuildMI(*MF, CopyUseMI->getDebugLoc(), 42544cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel TII.get(TargetOpcode::DBG_VALUE)) 42644cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel .addReg(CopyUseMI->getOperand(0).getReg(), RegState::Debug) 42744cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel .addImm(Offset).addMetadata(Variable); 4287c2a4a30e0e16762c75adacebd05ec9fcbccf16bEvan Cheng MachineBasicBlock::iterator Pos = CopyUseMI; 4297c2a4a30e0e16762c75adacebd05ec9fcbccf16bEvan Cheng EntryMBB->insertAfter(Pos, NewMI); 43044cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel } 431394427b014a7126e56f3ee411993f08677d93c83Devang Patel } 4322ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 4332ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 43453f7602b61157ed56ccbf91379c188c55235f619Bill Wendling // Determine if there are any calls in this machine function. 43553f7602b61157ed56ccbf91379c188c55235f619Bill Wendling MachineFrameInfo *MFI = MF->getFrameInfo(); 43653f7602b61157ed56ccbf91379c188c55235f619Bill Wendling if (!MFI->hasCalls()) { 43753f7602b61157ed56ccbf91379c188c55235f619Bill Wendling for (MachineFunction::const_iterator 43853f7602b61157ed56ccbf91379c188c55235f619Bill Wendling I = MF->begin(), E = MF->end(); I != E; ++I) { 43953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling const MachineBasicBlock *MBB = I; 44053f7602b61157ed56ccbf91379c188c55235f619Bill Wendling for (MachineBasicBlock::const_iterator 44153f7602b61157ed56ccbf91379c188c55235f619Bill Wendling II = MBB->begin(), IE = MBB->end(); II != IE; ++II) { 442e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &MCID = TM.getInstrInfo()->get(II->getOpcode()); 4438886c495a33703d8bd8319d16b62645cee4dd546Bill Wendling 444e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng if ((MCID.isCall() && !MCID.isReturn()) || 445c36b7069b42bece963b7e6adf020353ce990ef76Evan Cheng II->isStackAligningInlineAsm()) { 44653f7602b61157ed56ccbf91379c188c55235f619Bill Wendling MFI->setHasCalls(true); 44753f7602b61157ed56ccbf91379c188c55235f619Bill Wendling goto done; 44853f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 44953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 45053f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 45153f7602b61157ed56ccbf91379c188c55235f619Bill Wendling done:; 45253f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 45353f7602b61157ed56ccbf91379c188c55235f619Bill Wendling 4549af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling // Determine if there is a call to setjmp in the machine function. 45534706936412b9e9ff73511fed58e97bf6e100e69Joerg Sonnenberger MF->setExposesReturnsTwice(Fn.callsFunctionThatReturnsTwice()); 4569af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling 45784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Replace forward-declared registers with the registers containing 45884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // the desired value. 45984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MachineRegisterInfo &MRI = MF->getRegInfo(); 46084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (DenseMap<unsigned, unsigned>::iterator 46184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end(); 46284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman I != E; ++I) { 46384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned From = I->first; 46484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned To = I->second; 46584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If To is also scheduled to be replaced, find what its ultimate 46684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // replacement is. 46784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (;;) { 46884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman DenseMap<unsigned, unsigned>::iterator J = 46984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->RegFixups.find(To); 47084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (J == E) break; 47184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman To = J->second; 47284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman } 47384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Replace it. 47484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MRI.replaceRegWith(From, To); 47584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman } 47684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 4772ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Release function-specific state. SDB and CurDAG are already cleared 4782ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // at this point. 4792ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng FuncInfo->clear(); 4808a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 4821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 484685090f5988a03da1a515493bad1e592d26b9956Chris Lattnervoid SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin, 485685090f5988a03da1a515493bad1e592d26b9956Chris Lattner BasicBlock::const_iterator End, 486685090f5988a03da1a515493bad1e592d26b9956Chris Lattner bool &HadTailCall) { 48798ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 488f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // as a tail call, cease emitting nodes for this block. Terminators 489f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // are handled below. 490c105a2b5b7d8969e78bd4b203e980dced8a1c689Dan Gohman for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I) 491f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman SDB->visit(*I); 492f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 493a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4942048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 4952048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman HadTailCall = SDB->HasTailCall; 4962048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 49795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 49895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Final step, emit the lowered DAG as machine code. 49984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 5001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 502f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 503ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 504ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 505a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 506ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 507a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 508ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 509ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 510ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 511a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5127b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer do { 5137b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 514a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 515ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 516ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 517ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 518a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 519ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 520ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 521825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 522ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 523a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 524ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 525ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 526ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 527a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 528ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 529ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 530ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 531a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 532ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 533475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 534e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 535ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 536ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 537a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 538f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 539ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 540f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 541e1497b979166765d97c91813a8e830a1ab8fbe12Cameron Zwarich FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne); 5427b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer } while (!Worklist.empty()); 543ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 544ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 54584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 546462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 547462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 548462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 549462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 550a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick int BlockNumber = -1; 5511f6a329f79b3568d379142f921f59c4143ddaa14Duncan Sands (void)BlockNumber; 552a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick#ifdef NDEBUG 553462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 55425cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 55525cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 556a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick#endif 557a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick { 558a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick BlockNumber = FuncInfo->MBB->getNumber(); 559a7b0cb759433c715065440ee2a963a04db7f2b0bBenjamin Kramer BlockName = MF->getFunction()->getName().str() + ":" + 560a7b0cb759433c715065440ee2a963a04db7f2b0bBenjamin Kramer FuncInfo->MBB->getBasicBlock()->getName().str(); 561a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick } 562a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber 563a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 564462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 565f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 566417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 567af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 56803c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 56903c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled); 570501852423d34578bc41a745681783b04124dd0dbEli Friedman CurDAG->Combine(BeforeLegalizeTypes, *AA, OptLevel); 571ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 572a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 573a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber 574a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 575a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 5771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 578714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 579714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman BlockName); 580714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 581714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman bool Changed; 58203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 58303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled); 584714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 585714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 586714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 587a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber 588a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 589462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 590714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 591714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 592714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 593714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 594714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 59503c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 59603c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining after legalize types", GroupName, 59703c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 598501852423d34578bc41a745681783b04124dd0dbEli Friedman CurDAG->Combine(AfterLegalizeTypes, *AA, OptLevel); 599462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 600462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 601a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumber 602a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 603714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 604462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 60503c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 60603c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled); 607714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 608714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 6095c22c8074404797f1313b1334757254fb5c6487aEli Friedman 610714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 61103c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 61203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled); 6139882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 6145c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 6155c22c8074404797f1313b1334757254fb5c6487aEli Friedman 616714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 617714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 6185c22c8074404797f1313b1334757254fb5c6487aEli Friedman 619714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 62003c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 62103c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName, 62203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 623501852423d34578bc41a745681783b04124dd0dbEli Friedman CurDAG->Combine(AfterLegalizeVectorOps, *AA, OptLevel); 6245c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 625714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 626a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Optimized vector-legalized selection DAG: BB#" 627a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << BlockNumber << " '" << BlockName << "'\n"; CurDAG->dump()); 62870587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 629a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 630f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 631462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 63203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 63303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled); 634975716af1b9a09274df6c2d92683449015bd8564Dan Gohman CurDAG->Legalize(); 635ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 636a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 637a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Legalized selection DAG: BB#" << BlockNumber 638a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 639a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 640f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 641462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 642af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 64303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 64403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled); 645501852423d34578bc41a745681783b04124dd0dbEli Friedman CurDAG->Combine(AfterLegalizeDAG, *AA, OptLevel); 646ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 647a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 648a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Optimized legalized selection DAG: BB#" << BlockNumber 649a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 650417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 6514e39e9da0f3a435445261d0f796bb0913f3c2bf0Dan Gohman if (OptLevel != CodeGenOpt::None) 652f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 653552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 654552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 655552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner 656a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 657a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 65803c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 65903c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled); 6607c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 661ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 662db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 663a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Selected selection DAG: BB#" << BlockNumber 664a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 665462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 666f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 667462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 6685e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 66947ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 67003c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 67103c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName, 67203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 67384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Scheduler->Run(CurDAG, FuncInfo->MBB, FuncInfo->InsertPt); 6745e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6755e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 676462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 677462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 678a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 679db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 6802622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen MachineBasicBlock *FirstMBB = FuncInfo->MBB, *LastMBB; 68103c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 68203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled); 68384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 6842622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen LastMBB = FuncInfo->MBB = Scheduler->EmitSchedule(); 68584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = Scheduler->InsertPos; 6865e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6875e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 6882622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen // If the block was split, make sure we update any references that are used to 6892622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen // update PHI nodes later on. 6902622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen if (FirstMBB != LastMBB) 6912622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen SDB->UpdateSplitBlock(FirstMBB, LastMBB); 6922622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen 6935e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 69403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 69503c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName, 69603c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 6975e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 698ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 699db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 70095140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Free the SelectionDAG state, now that we're finished with it. 70195140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman CurDAG->clear(); 702a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 703f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 7047c306da505e2d7f64e160890b274a47fa0740962Chris Lattnervoid SelectionDAGISel::DoInstructionSelection() { 705a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(errs() << "===== Instruction selection begins: BB#" 706a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << FuncInfo->MBB->getNumber() 707a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << FuncInfo->MBB->getName() << "'\n"); 7087c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7097c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PreprocessISelDAG(); 7106e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7117c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Select target instructions for the DAG. 7127c306da505e2d7f64e160890b274a47fa0740962Chris Lattner { 7137c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Number all nodes with a topological order and set DAGSize. 7147c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DAGSize = CurDAG->AssignTopologicalOrder(); 7156e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7167c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Create a dummy node (which is not added to allnodes), that adds 7177c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // a reference to the root node, preventing it from being deleted, 7187c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // and tracking any changes of the root. 7197c306da505e2d7f64e160890b274a47fa0740962Chris Lattner HandleSDNode Dummy(CurDAG->getRoot()); 7207c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode()); 7217c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ++ISelPosition; 7226e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7237c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // The AllNodes list is now topological-sorted. Visit the 7247c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // nodes by starting at the end of the list (the root of the 7257c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // graph) and preceding back toward the beginning (the entry 7267c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // node). 7277c306da505e2d7f64e160890b274a47fa0740962Chris Lattner while (ISelPosition != CurDAG->allnodes_begin()) { 7287c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *Node = --ISelPosition; 7297c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes, 7307c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // but there are currently some corner cases that it misses. Also, this 7317c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // makes it theoretically possible to disable the DAGCombiner. 7327c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) 7337c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 7346e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7357c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *ResNode = Select(Node); 7366e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 73782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // FIXME: This is pretty gross. 'Select' should be changed to not return 73882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // anything at all and this code should be nuked with a tactical strike. 7396e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7407c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If node should not be replaced, continue with the next one. 74182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE) 7427c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 7437c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Replace node. 7447c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (ResNode) 7457c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ReplaceUses(Node, ResNode); 7466e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7477c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If after the replacement this node is not used any more, 7487c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // remove this dead node. 7497c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) { // Don't delete EntryToken, etc. 7507c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelUpdater ISU(ISelPosition); 7517c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->RemoveDeadNode(Node, &ISU); 7527c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 7537c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 7546e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7557c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->setRoot(Dummy.getValue()); 7566e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick } 75753f7602b61157ed56ccbf91379c188c55235f619Bill Wendling 7587c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection ends:\n"); 7597c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7607c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PostprocessISelDAG(); 7617c306da505e2d7f64e160890b274a47fa0740962Chris Lattner} 7627c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7632520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and 7642520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// do other setup for EH landing-pad blocks. 76584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohmanvoid SelectionDAGISel::PrepareEHLandingPad() { 7666f500541eac11413364f1d79320a2307079d3bbdBill Wendling MachineBasicBlock *MBB = FuncInfo->MBB; 7676f500541eac11413364f1d79320a2307079d3bbdBill Wendling 7682520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 7692520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 7706f500541eac11413364f1d79320a2307079d3bbdBill Wendling MCSymbol *Label = MF->getMMI().addLandingPad(MBB); 7712520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 77230e6740f2e3d518ce1cfcd484ef728ac5764a645Bill Wendling // Assign the call site to the landing pad's begin label. 77330e6740f2e3d518ce1cfcd484ef728ac5764a645Bill Wendling MF->getMMI().setCallSiteLandingPad(Label, SDB->LPadToCallSiteMap[MBB]); 77430e6740f2e3d518ce1cfcd484ef728ac5764a645Bill Wendling 775e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL); 7766f500541eac11413364f1d79320a2307079d3bbdBill Wendling BuildMI(*MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II) 77784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman .addSym(Label); 7782520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7792520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception register as live in. 7802520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 7816f500541eac11413364f1d79320a2307079d3bbdBill Wendling if (Reg) MBB->addLiveIn(Reg); 7822520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7832520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception selector register as live in. 7842520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 7856f500541eac11413364f1d79320a2307079d3bbdBill Wendling if (Reg) MBB->addLiveIn(Reg); 7862520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7872520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 7882520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 7892520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // like, the basic block containing the invoke), and need to be associated 7902520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // with it in the dwarf exception handling tables. Currently however the 7912520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 7922520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 7932520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // then breaking it can result in the intrinsics being in the successor of 7942520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the landing pad, not the landing pad itself. This results 7952520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // in exceptions not being caught because no typeids are associated with 7962520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // the invoke. This may not be the only way things can go wrong, but it 7972520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // is the only way we try to work around for the moment. 7986f500541eac11413364f1d79320a2307079d3bbdBill Wendling const BasicBlock *LLVMBB = MBB->getBasicBlock(); 7992520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman const BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 8002520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 8012520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 8022520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman BasicBlock::const_iterator I, E; 8032520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 8042520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (isa<EHSelectorInst>(I)) 8052520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman break; 8062520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 8072520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman if (I == E) 8082520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // No catch info found - try to extract some from the successor. 8092520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman CopyCatchInfo(Br->getSuccessor(0), LLVMBB, &MF->getMMI(), *FuncInfo); 8102520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman } 8112520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman} 8127c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 813b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// TryToFoldFastISelLoad - We're checking to see if we can fold the specified 814b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// load into the specified FoldInst. Note that we could have a sequence where 815b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// multiple LLVM IR instructions are folded into the same machineinstr. For 816b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// example we could have: 817b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// A: x = load i32 *P 818b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// B: y = icmp A, 42 819b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// C: br y, ... 820b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// 821b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// In this scenario, LI is "A", and FoldInst is "C". We know about "B" (and 822b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// any other folded instructions) because it is between A and C. 823b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// 824b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// If we succeed in folding the load into the operation, return true. 825b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// 826beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattnerbool SelectionDAGISel::TryToFoldFastISelLoad(const LoadInst *LI, 827b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner const Instruction *FoldInst, 828beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner FastISel *FastIS) { 829b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // We know that the load has a single use, but don't know what it is. If it 830b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // isn't one of the folded instructions, then we can't succeed here. Handle 831b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // this by scanning the single-use users of the load until we get to FoldInst. 832b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner unsigned MaxUsers = 6; // Don't scan down huge single-use chains of instrs. 8333af7a67629292840f0dbae8fad4e333b009e69ddAndrew Trick 834b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner const Instruction *TheUser = LI->use_back(); 835b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner while (TheUser != FoldInst && // Scan up until we find FoldInst. 836b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // Stay in the right block. 837b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner TheUser->getParent() == FoldInst->getParent() && 838b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner --MaxUsers) { // Don't scan too far. 839b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // If there are multiple or no uses of this instruction, then bail out. 840b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner if (!TheUser->hasOneUse()) 841b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner return false; 8423af7a67629292840f0dbae8fad4e333b009e69ddAndrew Trick 843b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner TheUser = TheUser->use_back(); 844b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner } 8453af7a67629292840f0dbae8fad4e333b009e69ddAndrew Trick 846f4ea68fa5a85d3e883cf35075133e64de4dfc046Chris Lattner // If we didn't find the fold instruction, then we failed to collapse the 847f4ea68fa5a85d3e883cf35075133e64de4dfc046Chris Lattner // sequence. 848f4ea68fa5a85d3e883cf35075133e64de4dfc046Chris Lattner if (TheUser != FoldInst) 849f4ea68fa5a85d3e883cf35075133e64de4dfc046Chris Lattner return false; 8503af7a67629292840f0dbae8fad4e333b009e69ddAndrew Trick 851beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // Don't try to fold volatile loads. Target has to deal with alignment 852beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // constraints. 853beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner if (LI->isVolatile()) return false; 8546e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 855b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // Figure out which vreg this is going into. If there is no assigned vreg yet 856b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // then there actually was no reference to it. Perhaps the load is referenced 857b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // by a dead instruction. 858beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner unsigned LoadReg = FastIS->getRegForValue(LI); 859b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner if (LoadReg == 0) 860b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner return false; 861beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner 862beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // Check to see what the uses of this vreg are. If it has no uses, or more 863beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // than one use (at the machine instr level) then we can't fold it. 864beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner MachineRegisterInfo::reg_iterator RI = RegInfo->reg_begin(LoadReg); 865beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner if (RI == RegInfo->reg_end()) 866beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner return false; 8676e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 868beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // See if there is exactly one use of the vreg. If there are multiple uses, 869beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // then the instruction got lowered to multiple machine instructions or the 870beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // use of the loaded value ended up being multiple operands of the result, in 871beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // either case, we can't fold this. 872beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner MachineRegisterInfo::reg_iterator PostRI = RI; ++PostRI; 873beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner if (PostRI != RegInfo->reg_end()) 874beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner return false; 8756e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 876beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner assert(RI.getOperand().isUse() && 877beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner "The only use of the vreg must be a use, we haven't emitted the def!"); 878beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner 879b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner MachineInstr *User = &*RI; 8809d40193d79052fb4ddd0f667f0fe47f07922c72aJim Grosbach 881b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner // Set the insertion point properly. Folding the load can cause generation of 882b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner // other random instructions (like sign extends) for addressing modes, make 883b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner // sure they get inserted in a logical place before the new instruction. 884b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner FuncInfo->InsertPt = User; 885b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner FuncInfo->MBB = User->getParent(); 886b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner 887beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // Ask the target to try folding the load. 888b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner return FastIS->TryToFoldLoad(User, RI.getOperandNo(), LI); 889beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner} 890beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner 8918bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner/// isFoldedOrDeadInstruction - Return true if the specified instruction is 8928bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner/// side-effect free and is either dead or folded into a generated instruction. 8938bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner/// Return false if it needs to be emitted. 8948bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattnerstatic bool isFoldedOrDeadInstruction(const Instruction *I, 8958bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner FunctionLoweringInfo *FuncInfo) { 896b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner return !I->mayWriteToMemory() && // Side-effecting instructions aren't folded. 897b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner !isa<TerminatorInst>(I) && // Terminators aren't folded. 898b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner !isa<DbgInfoIntrinsic>(I) && // Debug instructions aren't folded. 8994477d691ed9fa63f051986dcb98e358054c8281fBill Wendling !isa<LandingPadInst>(I) && // Landingpad instructions aren't folded. 900b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner !FuncInfo->isExportedInst(I); // Exported instrs must be computed. 9018bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner} 9028bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner 90373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#ifndef NDEBUG 90473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosierstatic void collectFailStats(const Instruction *I) { 90573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier switch (I->getOpcode()) { 90673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier default: assert (0 && "<Invalid operator> "); 90773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 90873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Terminators 90973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Ret: NumFastIselFailRet++; return; 91073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Br: NumFastIselFailBr++; return; 91173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Switch: NumFastIselFailSwitch++; return; 91273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::IndirectBr: NumFastIselFailIndirectBr++; return; 91373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Invoke: NumFastIselFailInvoke++; return; 91473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Resume: NumFastIselFailResume++; return; 91573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Unwind: NumFastIselFailUnwind++; return; 91673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Unreachable: NumFastIselFailUnreachable++; return; 91773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 91873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Standard binary operators... 91973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Add: NumFastIselFailAdd++; return; 92073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FAdd: NumFastIselFailFAdd++; return; 92173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Sub: NumFastIselFailSub++; return; 92273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FSub: NumFastIselFailFSub++; return; 92373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Mul: NumFastIselFailMul++; return; 92473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FMul: NumFastIselFailFMul++; return; 92573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::UDiv: NumFastIselFailUDiv++; return; 92673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::SDiv: NumFastIselFailSDiv++; return; 92773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FDiv: NumFastIselFailFDiv++; return; 92873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::URem: NumFastIselFailURem++; return; 92973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::SRem: NumFastIselFailSRem++; return; 93073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FRem: NumFastIselFailFRem++; return; 93173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 93273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Logical operators... 93373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::And: NumFastIselFailAnd++; return; 93473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Or: NumFastIselFailOr++; return; 93573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Xor: NumFastIselFailXor++; return; 93673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 93773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Memory instructions... 93873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Alloca: NumFastIselFailAlloca++; return; 93973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Load: NumFastIselFailLoad++; return; 94073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Store: NumFastIselFailStore++; return; 94173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::AtomicCmpXchg: NumFastIselFailAtomicCmpXchg++; return; 94273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::AtomicRMW: NumFastIselFailAtomicRMW++; return; 94373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Fence: NumFastIselFailFence++; return; 94473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::GetElementPtr: NumFastIselFailGetElementPtr++; return; 94573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 94673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Convert instructions... 94773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Trunc: NumFastIselFailTrunc++; return; 94873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ZExt: NumFastIselFailZExt++; return; 94973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::SExt: NumFastIselFailSExt++; return; 95073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FPTrunc: NumFastIselFailFPTrunc++; return; 95173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FPExt: NumFastIselFailFPExt++; return; 95273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FPToUI: NumFastIselFailFPToUI++; return; 95373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FPToSI: NumFastIselFailFPToSI++; return; 95473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::UIToFP: NumFastIselFailUIToFP++; return; 95573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::SIToFP: NumFastIselFailSIToFP++; return; 95673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::IntToPtr: NumFastIselFailIntToPtr++; return; 95773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::PtrToInt: NumFastIselFailPtrToInt++; return; 95873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::BitCast: NumFastIselFailBitCast++; return; 95973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 96073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Other instructions... 96173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ICmp: NumFastIselFailICmp++; return; 96273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FCmp: NumFastIselFailFCmp++; return; 96373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::PHI: NumFastIselFailPHI++; return; 96473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Select: NumFastIselFailSelect++; return; 96573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Call: NumFastIselFailCall++; return; 96673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Shl: NumFastIselFailShl++; return; 96773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::LShr: NumFastIselFailLShr++; return; 96873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::AShr: NumFastIselFailAShr++; return; 96973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::VAArg: NumFastIselFailVAArg++; return; 97073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ExtractElement: NumFastIselFailExtractElement++; return; 97173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::InsertElement: NumFastIselFailInsertElement++; return; 97273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ShuffleVector: NumFastIselFailShuffleVector++; return; 97373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ExtractValue: NumFastIselFailExtractValue++; return; 97473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::InsertValue: NumFastIselFailInsertValue++; return; 97573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::LandingPad: NumFastIselFailLandingPad++; return; 97673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier } 97773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier return; 97873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier} 97973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#endif 98073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 98146510a73e977273ec67747eb34cbdb43f815e451Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) { 982a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 983a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 9848a8d479214745c82ef00f08d4e4f1c173b5f9ce2Nick Lewycky if (TM.Options.EnableFastISel) 985a4160c3434b08288d1f79f1acbe453d1b9610b22Dan Gohman FastIS = TLI.createFastISel(*FuncInfo); 986a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 987a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 9882dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich ReversePostOrderTraversal<const Function*> RPOT(&Fn); 9892dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich for (ReversePostOrderTraversal<const Function*>::rpo_iterator 9902dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich I = RPOT.begin(), E = RPOT.end(); I != E; ++I) { 9912dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich const BasicBlock *LLVMBB = *I; 992a46cd97818ac6fa336b093adecf2006fb041ca1cCameron Zwarich 993324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich if (OptLevel != CodeGenOpt::None) { 994324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich bool AllPredsVisited = true; 995324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich for (const_pred_iterator PI = pred_begin(LLVMBB), PE = pred_end(LLVMBB); 996324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich PI != PE; ++PI) { 997324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich if (!FuncInfo->VisitedBBs.count(*PI)) { 998324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich AllPredsVisited = false; 999324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich break; 1000324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich } 1001324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich } 1002324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich 10038ca814c4e0a39e1fcac023f0fb014917da07a796Cameron Zwarich if (AllPredsVisited) { 10048bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner for (BasicBlock::const_iterator I = LLVMBB->begin(); 10058bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner isa<PHINode>(I); ++I) 10068ca814c4e0a39e1fcac023f0fb014917da07a796Cameron Zwarich FuncInfo->ComputePHILiveOutRegInfo(cast<PHINode>(I)); 10078ca814c4e0a39e1fcac023f0fb014917da07a796Cameron Zwarich } else { 10088bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner for (BasicBlock::const_iterator I = LLVMBB->begin(); 10098bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner isa<PHINode>(I); ++I) 1010324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich FuncInfo->InvalidatePHILiveOutRegInfo(cast<PHINode>(I)); 1011324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich } 1012324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich 1013a46cd97818ac6fa336b093adecf2006fb041ca1cCameron Zwarich FuncInfo->VisitedBBs.insert(LLVMBB); 1014324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich } 1015a46cd97818ac6fa336b093adecf2006fb041ca1cCameron Zwarich 101684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB]; 101784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI(); 1018f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 1019ba5be5c07bb19dcf484e3aa40cd139dd07c10407Dan Gohman BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI(); 102046510a73e977273ec67747eb34cbdb43f815e451Dan Gohman BasicBlock::const_iterator const End = LLVMBB->end(); 102184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman BasicBlock::const_iterator BI = End; 10225edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 102384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI(); 102484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 102584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Setup an EH landing-pad block. 102684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isLandingPad()) 102784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PrepareEHLandingPad(); 10286e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1029f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // Lower any arguments needed in this block if this is the entry block. 103068e6beeccc0b9ac2e8d3687a8a5b7d4b172edca1Devang Patel if (LLVMBB == &Fn.getEntryBlock()) 1031f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman LowerArguments(LLVMBB); 1032f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman 1033f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 1034d725f04ff81db0e61baa153bf21ca2dd08838244Dan Gohman if (FastIS) { 103584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->startNewBlock(); 103684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 1037f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // Emit code for any incoming arguments. This must happen before 1038f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // beginning FastISel on the entry block. 1039f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 1040f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman CurDAG->setRoot(SDB->getControlRoot()); 1041f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman SDB->clear(); 104284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 104384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 104484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If we inserted any instructions at the beginning, make a note of 104584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // where they are, so we can be sure to emit subsequent instructions 104684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // after them. 104784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->InsertPt != FuncInfo->MBB->begin()) 104884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->setLastLocalValue(llvm::prior(FuncInfo->InsertPt)); 104984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman else 105084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->setLastLocalValue(0); 1051f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman } 105284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 1053f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier unsigned NumFastIselRemaining = std::distance(Begin, End); 1054a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 105584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (; BI != Begin; --BI) { 105684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman const Instruction *Inst = llvm::prior(BI); 105784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 105884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If we no longer require this instruction, skip it. 1059f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier if (isFoldedOrDeadInstruction(Inst, FuncInfo)) { 1060f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier --NumFastIselRemaining; 106120d4be151b54feb18aa1e5cc04033a4aa64137aeDan Gohman continue; 1062f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier } 106384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 106484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Bottom-up: reset the insert pos at the top, after any local-value 106584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // instructions. 106684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->recomputeInsertPt(); 106720d4be151b54feb18aa1e5cc04033a4aa64137aeDan Gohman 106821c14e3649b3e2a70ac36ebb148f17648f10a2a9Dan Gohman // Try to select the instruction with FastISel. 1069beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner if (FastIS->SelectInstruction(Inst)) { 1070f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier --NumFastIselRemaining; 107162427ae8d311d3dda8f5257ddf34d13c19c214bbJim Grosbach ++NumFastIselSuccess; 1072b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // If fast isel succeeded, skip over all the folded instructions, and 1073b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // then see if there is a load right before the selected instructions. 1074b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // Try to fold the load if so. 1075b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner const Instruction *BeforeInst = Inst; 1076b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner while (BeforeInst != Begin) { 1077b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner BeforeInst = llvm::prior(BasicBlock::const_iterator(BeforeInst)); 1078b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner if (!isFoldedOrDeadInstruction(BeforeInst, FuncInfo)) 1079b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner break; 1080b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner } 1081b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner if (BeforeInst != Inst && isa<LoadInst>(BeforeInst) && 1082b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner BeforeInst->hasOneUse() && 1083f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier TryToFoldFastISelLoad(cast<LoadInst>(BeforeInst), Inst, FastIS)) { 1084b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // If we succeeded, don't re-select the load. 1085b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner BI = llvm::next(BasicBlock::const_iterator(BeforeInst)); 1086f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier --NumFastIselRemaining; 1087f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier ++NumFastIselSuccess; 1088f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier } 1089a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 1090beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner } 1091f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 109273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#ifndef NDEBUG 1093f2a745efe50dfd57f0e83e5f3ed964611cba6077Chad Rosier if (EnableFastISelVerbose2) 1094f2a745efe50dfd57f0e83e5f3ed964611cba6077Chad Rosier collectFailStats(Inst); 109573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#endif 109673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 1097a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 109884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (isa<CallInst>(Inst)) { 1099f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier 1100a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 11011a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel missed call: "; 110284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Inst->dump(); 1103f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1104f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 110584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) { 110684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned &R = FuncInfo->ValueMap[Inst]; 1107a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 110884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman R = FuncInfo->CreateRegs(Inst->getType()); 1109f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1110a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 1111b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall = false; 1112df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel SelectBasicBlock(Inst, BI, HadTailCall); 1113b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 1114f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier // Recompute NumFastIselRemaining as Selection DAG instruction 1115f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier // selection may have handled the call, input args, etc. 1116f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier unsigned RemainingNow = std::distance(Begin, BI); 1117f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier NumFastIselFailures += NumFastIselRemaining - RemainingNow; 1118f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier 1119b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman // If the call was emitted as a tail call, we're done with the block. 1120b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman if (HadTailCall) { 112184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman --BI; 1122b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman break; 1123b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman } 1124b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 1125f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier NumFastIselRemaining = RemainingNow; 1126a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 1127f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1128a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 11299c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman if (isa<TerminatorInst>(Inst) && !isa<BranchInst>(Inst)) { 11309c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman // Don't abort, and use a different message for terminator misses. 1131f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier NumFastIselFailures += NumFastIselRemaining; 11329c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman if (EnableFastISelVerbose || EnableFastISelAbort) { 11339c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman dbgs() << "FastISel missed terminator: "; 11349c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman Inst->dump(); 11359c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman } 11369c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman } else { 1137f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier NumFastIselFailures += NumFastIselRemaining; 1138a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 11391a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 114084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Inst->dump(); 1141a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 1142a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 1143a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 1144a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 1145c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 1146a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 1147a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 1148f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 114984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 115084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->recomputeInsertPt(); 1151f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1152f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 1153df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel if (Begin != BI) 1154df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel ++NumDAGBlocks; 1155df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel else 1156df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel ++NumFastIselBlocks; 1157df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel 115837d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman if (Begin != BI) { 115937d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman // Run SelectionDAG instruction selection on the remainder of the block 116037d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman // not handled by FastISel. If FastISel is not run, this is the entire 116137d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman // block. 116237d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman bool HadTailCall; 116337d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman SelectBasicBlock(Begin, BI, HadTailCall); 116437d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman } 1165381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 116684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FinishBasicBlock(); 1167620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman FuncInfo->PHINodesToUpdate.clear(); 116839fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 1169a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 1170a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 1171233857537f61a8f4ab93624986676c25b2271bc7Devang Patel SDB->clearDanglingDebugInfo(); 11720e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 11730e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 1174fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 117584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan GohmanSelectionDAGISel::FinishBasicBlock() { 11761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11771a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Total amount of phi nodes to update: " 1178927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman << FuncInfo->PHINodesToUpdate.size() << "\n"; 1179927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) 11801a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Node " << i << " : (" 1181620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << FuncInfo->PHINodesToUpdate[i].first 1182620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n"); 1183a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1184a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 11851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 11862048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (SDB->SwitchCases.empty() && 11872048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.empty() && 11882048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.empty()) { 1189620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 1190620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 1191518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 1192f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 119384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (!FuncInfo->MBB->isSuccessor(PHI->getParent())) 1194580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen continue; 1195620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 1196620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 119784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 1198f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1199f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 12001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 12014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12022048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) { 12034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 12042048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->BitTestCases[i].Emitted) { 12054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 120684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->BitTestCases[i].Parent; 120784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 12084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 120984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB); 12102048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 12112048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 121284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 1213a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 12144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12152048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) { 12164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 121784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB; 121884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 12194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 12204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 1221d08e5b48bc5d9177b1d70a1980a7805420a99085Evan Cheng SDB->visitBitTestCase(SDB->BitTestCases[i], 1222d08e5b48bc5d9177b1d70a1980a7805420a99085Evan Cheng SDB->BitTestCases[i].Cases[j+1].ThisBB, 12232048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 122499be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 122584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 12264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 1227d08e5b48bc5d9177b1d70a1980a7805420a99085Evan Cheng SDB->visitBitTestCase(SDB->BitTestCases[i], 1228d08e5b48bc5d9177b1d70a1980a7805420a99085Evan Cheng SDB->BitTestCases[i].Default, 12292048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 123099be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 123184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 1232a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1233a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12342048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 12352048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 123684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 12374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 1240620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 1241620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 1242620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 12434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 1244518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 12454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 12464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 12474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 12482048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->BitTestCases[i].Default) { 1249f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1250620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1251620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 12522048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); 1253f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1254620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1255620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 12562048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases. 12579ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 12584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 12602048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); 12617c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 12622048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB; 1263dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (cBB->isSuccessor(PHIBB)) { 1264f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1265620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1266620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 12679ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 12684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12722048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.clear(); 12734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12749453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 12759453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 12769453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 12772048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) { 12783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 12792048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->JTCases[i].first.Emitted) { 12803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 128184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB; 128284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 12833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 128499be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first, 128584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 12862048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 12872048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 128884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 12894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 1290a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 129137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 129284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->JTCases[i].second.MBB; 129384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 129437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 12952048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTable(SDB->JTCases[i].second); 12962048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 12972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 129884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 1299a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 130037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 1301620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 1302620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 1303620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 130437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 1305518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 130637efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 13074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 13082048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->JTCases[i].second.Default) { 1309ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 1310620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1311620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 1312ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 13132048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB)); 1314f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 13154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 131684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isSuccessor(PHIBB)) { 1317ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 1318620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1319620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 132084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 132137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 132237efe6764568a3829fee26aba532283131d1a104Nate Begeman } 132337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 13242048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.clear(); 1325a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1326b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 1327b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 1328620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 1329620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 1330518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 1331b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 133284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isSuccessor(PHI->getParent())) { 1333620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 1334620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 133584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 1336b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1337b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1338a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1339f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 1340f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 13412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) { 1342f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 1343ca5f61676956cff088c225c3c166a589410b3101Dan Gohman FuncInfo->MBB = SDB->SwitchCases[i].ThisBB; 134484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 1345a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 134695140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Determine the unique successors. 134795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman SmallVector<MachineBasicBlock *, 2> Succs; 134895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman Succs.push_back(SDB->SwitchCases[i].TrueBB); 134995140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB) 135095140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman Succs.push_back(SDB->SwitchCases[i].FalseBB); 135195140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 1352ca5f61676956cff088c225c3c166a589410b3101Dan Gohman // Emit the code. Note that this could result in FuncInfo->MBB being split. 135384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB); 13542048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 135595140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman SDB->clear(); 135684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 1357ca5f61676956cff088c225c3c166a589410b3101Dan Gohman 1358ca5f61676956cff088c225c3c166a589410b3101Dan Gohman // Remember the last block, now that any splitting is done, for use in 1359ca5f61676956cff088c225c3c166a589410b3101Dan Gohman // populating PHI nodes in successors. 1360ca5f61676956cff088c225c3c166a589410b3101Dan Gohman MachineBasicBlock *ThisBB = FuncInfo->MBB; 1361a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1362d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 1363d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 1364d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1365d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 136695140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman for (unsigned i = 0, e = Succs.size(); i != e; ++i) { 136784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = Succs[i]; 136884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 136984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // FuncInfo->MBB may have been removed from the CFG if a branch was 137084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // constant folded. 137184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (ThisBB->isSuccessor(FuncInfo->MBB)) { 137284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (MachineBasicBlock::iterator Phi = FuncInfo->MBB->begin(); 137384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Phi != FuncInfo->MBB->end() && Phi->isPHI(); 1374dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen ++Phi) { 1375dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // This value for this PHI node is recorded in PHINodesToUpdate. 1376dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (unsigned pn = 0; ; ++pn) { 1377620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman assert(pn != FuncInfo->PHINodesToUpdate.size() && 1378dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen "Didn't find PHI entry!"); 1379620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman if (FuncInfo->PHINodesToUpdate[pn].first == Phi) { 1380dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand:: 1381620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pn].second, 1382dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen false)); 1383dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1384dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen break; 1385dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen } 13868be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1387d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1389f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1390a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 13912048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases.clear(); 13921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1393a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 139413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 13950a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 13960a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 13970a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 13985e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 139947ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1400eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1401a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 140213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1403eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 14049373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 14054ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1406a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1407be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1408a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 14090e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1410755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1411755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1412755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1413755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1414755480681c795d585c73556c028b6143c46bda86Chris Lattner 1415755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1416755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1417755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1418755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1419a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1420dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 14212e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 14222e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1423a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1424755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1425755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1426755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1427a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1428755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 14292e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1430755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1431a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1432755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1433755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 14342e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1435ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1436755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1437a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1438755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1439755480681c795d585c73556c028b6143c46bda86Chris Lattner 1440755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1441755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1442755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1443755480681c795d585c73556c028b6143c46bda86Chris Lattner 1444755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1445755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1446755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1447755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1448a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 14492e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 14502e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 14512e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1452a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1453755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1454755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1455755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1456a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1457755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 14582e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1459755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1460a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1461755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1462755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 14632e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1464a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 14652e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 1466ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 1467a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1468755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1469755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1470755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1471a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1472755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1473a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1474755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1475755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1476755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1477755480681c795d585c73556c028b6143c46bda86Chris Lattner 14789ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 14790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 14800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 14810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1482f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1483475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 14840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 14850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1486decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0 1487decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1 1488decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc 1489c36b7069b42bece963b7e6adf020353ce990ef76Evan Cheng Ops.push_back(InOps[InlineAsm::Op_ExtraInfo]); // 3 (SideEffect, AlignStack) 14900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1491decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size(); 1492f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (InOps[e-1].getValueType() == MVT::Glue) 1493a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner --e; // Don't process a glue operand if it is here. 1494a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 14950e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1496f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 1497decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (!InlineAsm::isMemKind(Flags)) { 14980e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1499697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1500697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1501697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 15020e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1503697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1504697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 15050e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1506475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1507decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) 150875361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error("Could not match memory address. Inline asm" 150987d677c1856bfdcb91d9daeb69dc5f261c73851eChris Lattner " failure!"); 1510a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 15110e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 1512decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned NewFlags = 1513decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size()); 1514decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32)); 15150e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 15160e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 15170e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 15180e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1519a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1520a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Add the glue input back if present. 15210e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 15220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 15230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1524794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1525a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner/// findGlueUse - Return use of MVT::Glue value produced by the specified 1526c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1527c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1528a4359be0328a91971c486b06892c742de1fa0f2bChris Lattnerstatic SDNode *findGlueUse(SDNode *N) { 1529c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1530c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1531c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1532c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1533c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1534c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1535c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1536c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1537c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1538c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1539c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1540c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1541c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1542d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, 1543d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) { 1544da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The NodeID's are given uniques ID's where a node ID is guaranteed to be 1545da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // greater than all of its (recursive) operands. If we scan to a point where 1546da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 'use' is smaller than the node we're scanning for, then we know we will 1547da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // never find it. 1548da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 1549da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The Use may be -1 (unassigned) if it is a newly allocated node. This can 1550a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // happen because we scan down to newly selected nodes in the case of glue 1551da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // uses. 1552da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1)) 1553da244a091dcde022ea4938793d81ee957903ed70Chris Lattner return false; 15546e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1555da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // Don't revisit nodes if we already scanned it and didn't fail, we know we 1556da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // won't fail if we scan it again. 1557da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if (!Visited.insert(Use)) 1558c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1559c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1560c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1561d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Ignore chain uses, they are validated by HandleMergeInputChains. 1562d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains) 1563d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 15646e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1565c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1566c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1567c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1568c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1569c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1570c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1571c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1572c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1573c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1574d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains)) 1575c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1576c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1577c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1578c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1579c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1580014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsProfitableToFold - Returns true if it's profitable to fold the specific 1581014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// operand node N of U during instruction selection that starts at Root. 1582014bf215c3457bb34fee348265e8f63a70b4d503Evan Chengbool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U, 1583014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng SDNode *Root) const { 1584014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng if (OptLevel == CodeGenOpt::None) return false; 1585014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng return N.hasOneUse(); 1586014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng} 1587014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng 1588014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsLegalToFold - Returns true if the specific operand node N of 1589014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// U can be folded during instruction selection that starts at Root. 1590d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattnerbool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 1591d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman CodeGenOpt::Level OptLevel, 1592d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman bool IgnoreChains) { 1593c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1594c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1595c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1596c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1597c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1598c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1599c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1600c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1601c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1602c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1603c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1604c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1605c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1606c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1607c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1608c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1609c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1610c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1611a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If Root produces glue, then it gets (even more) interesting. Since it 1612a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // will be "glued" together with its glue use in the scheduler, we need to 1613c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1614c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1615c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1616c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1617c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1618c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1619c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1620c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1621c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1622c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1623c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1624c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1625c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1626c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1627c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1628c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1629c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1630a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // [GU] // 1631c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1632a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If GU (glue use) indirectly reaches N (the load), and Root folds N 1633a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // (call it Fold), then X is a predecessor of GU and a successor of 1634a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Fold. But since Fold and GU are glued together, this will create 1635c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1636c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1637a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the node has glue, walk down the graph to the "lowest" node in the 1638a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // glueged set. 1639e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1640f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner while (VT == MVT::Glue) { 1641a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDNode *GU = findGlueUse(Root); 1642a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (GU == NULL) 1643c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1644a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner Root = GU; 1645c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 16466e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1647a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If our query node has a glue result with a use, we've walked up it. If 164818fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the user (which has already been selected) has a chain or indirectly uses 164918fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the chain, our WalkChainUsers predicate will not consider it. Because of 165018fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // this, we cannot ignore chains in this predicate. 165118fdabadca110671b436de52fe7bd492ad49e656Chris Lattner IgnoreChains = false; 1652c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 16536e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1654c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 16559bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner SmallPtrSet<SDNode*, 16> Visited; 16569bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains); 1657c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1658c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1659eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) { 1660eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman std::vector<SDValue> Ops(N->op_begin(), N->op_end()); 1661e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SelectInlineAsmMemoryOperands(Ops); 16626e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1663e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::vector<EVT> VTs; 1664e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Other); 1665f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner VTs.push_back(MVT::Glue); 1666eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(), 1667e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs, &Ops[0], Ops.size()); 1668d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner New->setNodeId(-1); 1669e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman return New.getNode(); 1670e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1671e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1672eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) { 1673518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0)); 1674e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1675e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 16762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// GetVBR - decode a vbr encoding whose top bit is set. 167719e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static uint64_t 16782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerGetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) { 16792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(Val >= 128 && "Not a VBR"); 16802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val &= 127; // Remove first vbr bit. 16816e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 16822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned Shift = 7; 16832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner uint64_t NextBits; 16842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner do { 168514df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner NextBits = MatcherTable[Idx++]; 16862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val |= (NextBits&127) << Shift; 16872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Shift += 7; 16882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } while (NextBits & 128); 16896e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 16902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return Val; 16912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 16922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 16932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1694a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner/// UpdateChainsAndGlue - When a match is complete, this method updates uses of 1695a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner/// interior glue and chain results to use the new glue and chain results. 169682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattnervoid SelectionDAGISel:: 1697a4359be0328a91971c486b06892c742de1fa0f2bChris LattnerUpdateChainsAndGlue(SDNode *NodeToMatch, SDValue InputChain, 1698a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner const SmallVectorImpl<SDNode*> &ChainNodesMatched, 1699a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDValue InputGlue, 1700a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner const SmallVectorImpl<SDNode*> &GlueResultNodesMatched, 1701a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner bool isMorphNodeTo) { 170282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SmallVector<SDNode*, 4> NowDeadNodes; 17036e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 170482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner ISelUpdater ISU(ISelPosition); 170582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 17062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Now that all the normal results are replaced, we replace the chain and 1707a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // glue results if present. 17082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!ChainNodesMatched.empty()) { 17092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() != 0 && 17102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Matched input chains but didn't produce a chain"); 17112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Loop over all of the nodes we matched that produced a chain result. 17122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Replace all the chain results with the final chain we ended up with. 17132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 17142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *ChainNode = ChainNodesMatched[i]; 17156e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 171682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 171782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ChainNode->getOpcode() == ISD::DELETED_NODE) 171882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 17196e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 17202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Don't replace the results of the root node if we're doing a 17212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MorphNodeTo. 17222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNode == NodeToMatch && isMorphNodeTo) 17232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 17246e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 17252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); 1726f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (ChainVal.getValueType() == MVT::Glue) 17272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); 17282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainVal.getValueType() == MVT::Other && "Not a chain?"); 172982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU); 17306e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1731856fb395e46a8d485081acbf11928047d852c636Chris Lattner // If the node became dead and we haven't already seen it, delete it. 1732856fb395e46a8d485081acbf11928047d852c636Chris Lattner if (ChainNode->use_empty() && 1733856fb395e46a8d485081acbf11928047d852c636Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode)) 173482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(ChainNode); 17352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 17362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 17376e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1738a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the result produces glue, update any glue results in the matched 1739a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // pattern with the glue result. 1740a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (InputGlue.getNode() != 0) { 17412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Handle any interior nodes explicitly marked. 1742a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner for (unsigned i = 0, e = GlueResultNodesMatched.size(); i != e; ++i) { 1743a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDNode *FRN = GlueResultNodesMatched[i]; 17446e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 174582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 174682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (FRN->getOpcode() == ISD::DELETED_NODE) 174782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 17486e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1749f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue && 1750a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner "Doesn't have a glue result"); 17512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), 1752a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue, &ISU); 17536e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 175419e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner // If the node became dead and we haven't already seen it, delete it. 175519e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner if (FRN->use_empty() && 175619e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN)) 175782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(FRN); 17582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 17592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 17606e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 176182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (!NowDeadNodes.empty()) 176282dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU); 17636e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 17642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Match complete!\n"); 17652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 17662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1767c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerenum ChainResult { 1768c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_Simple, 1769c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_InducesCycle, 1770c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_LeadsToInteriorNode 1771c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner}; 1772c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1773c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// WalkChainUsers - Walk down the users of the specified chained node that is 1774c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// part of the pattern we're matching, looking at all of the users we find. 1775c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// This determines whether something is an interior node, whether we have a 1776c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// non-pattern node in between two pattern nodes (which prevent folding because 1777c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// it would induce a cycle) and whether we have a TokenFactor node sandwiched 1778c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// between pattern nodes (in which case the TF becomes part of the pattern). 1779c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// 1780c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// The walk we do here is guaranteed to be small because we quickly get down to 1781c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// already selected nodes "below" us. 17826e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trickstatic ChainResult 1783c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerWalkChainUsers(SDNode *ChainedNode, 1784c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &ChainedNodesInPattern, 1785c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &InteriorChainedNodes) { 1786c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainResult Result = CR_Simple; 17876e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1788c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (SDNode::use_iterator UI = ChainedNode->use_begin(), 1789c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner E = ChainedNode->use_end(); UI != E; ++UI) { 1790c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Make sure the use is of the chain, not some other value we produce. 1791c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (UI.getUse().getValueType() != MVT::Other) continue; 17926e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1793c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *User = *UI; 1794c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1795c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we see an already-selected machine node, then we've gone beyond the 1796c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that we're selecting down into the already selected chunk of the 1797c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // DAG. 1798c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->isMachineOpcode() || 1799c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner User->getOpcode() == ISD::HANDLENODE) // Root of the graph. 1800c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 18016e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1802d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getOpcode() == ISD::CopyToReg || 1803d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner User->getOpcode() == ISD::CopyFromReg || 18047561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::INLINEASM || 18057561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::EH_LABEL) { 1806d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // If their node ID got reset to -1 then they've already been selected. 1807d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Treat them like a MachineOpcode. 1808d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getNodeId() == -1) 1809d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1810d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner } 1811c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1812c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a TokenFactor, we handle it specially. 1813c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->getOpcode() != ISD::TokenFactor) { 1814c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the node isn't a token factor and isn't part of our pattern, then it 1815c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // must be a random chained node in between two nodes we're selecting. 1816c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This happens when we have something like: 1817c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1818c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // call 1819c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1820c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1821c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Because we structurally match the load/store as a read/modify/write, 1822c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // but the call is chained between them. We cannot fold in this case 1823c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // because it would induce a cycle in the graph. 1824c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainedNodesInPattern.begin(), 1825c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.end(), User)) 1826c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 18276e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1828c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise we found a node that is part of our pattern. For example in: 1829c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1830c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1831c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1832c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This would happen when we're scanning down from the load and see the 1833c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store as a user. Record that there is a use of ChainedNode that is 1834c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // part of the pattern and keep scanning uses. 1835c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1836c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1837c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1838c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 18396e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1840c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we found a TokenFactor, there are two cases to consider: first if the 1841c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // TokenFactor is just hanging "below" the pattern we're matching (i.e. no 1842c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses of the TF are in our pattern) we just want to ignore it. Second, 1843c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the TokenFactor can be sandwiched in between two chained nodes, like so: 1844c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load chain] 1845c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ 1846c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | 1847c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load] 1848c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1849c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | \ DAG's like cheese 1850c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / \ do you? 1851c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / | 1852c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [TokenFactor] [Op] 1853c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1854c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | | 1855c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1856c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1857c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Store] 1858c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1859c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // In this case, the TokenFactor becomes part of our match and we rewrite it 1860c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // as a new TokenFactor. 1861c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1862c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // To distinguish these two cases, do a recursive walk down the uses. 1863c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) { 1864c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_Simple: 1865c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor are just already-selected nodes, ignore 1866c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // it, it is "below" our pattern. 1867c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1868c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_InducesCycle: 1869c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor lead to nodes that are not part of our 1870c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that are not selected, folding would turn this into a cycle, 1871c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // bail out now. 1872c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1873c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_LeadsToInteriorNode: 1874c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner break; // Otherwise, keep processing. 1875c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 18766e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1877c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we know we're in the interesting interior case. The TokenFactor 1878c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // is now going to be considered part of the pattern so that we rewrite its 1879c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses (it may have uses that are not part of the pattern) with the 1880c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ultimate chain result of the generated code. We will also add its chain 1881c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // inputs as inputs to the ultimate TokenFactor we create. 1882c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1883c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.push_back(User); 1884c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1885c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1886c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 18876e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1888c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return Result; 1889c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner} 1890c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 18916b30792d2d7d142b8192241e6232aee004f745fbChris Lattner/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains 189200592ec857b4c3f31b46412e2738924238c59983Chris Lattner/// operation for when the pattern matched at least one node with a chains. The 1893c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// input vector contains a list of all of the chained nodes that we match. We 1894c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// must determine if this is a valid thing to cover (i.e. matching it won't 1895c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will 1896c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// be used as the input node chain for the generated nodes. 18976b30792d2d7d142b8192241e6232aee004f745fbChris Lattnerstatic SDValue 1898c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerHandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched, 18996b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SelectionDAG *CurDAG) { 1900c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Walk all of the chained nodes we've matched, recursively scanning down the 1901c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // users of the chain result. This adds any TokenFactor nodes that are caught 1902c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // in between chained nodes to the chained and interior nodes list. 1903c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVector<SDNode*, 3> InteriorChainedNodes; 1904c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1905c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched, 1906c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes) == CR_InducesCycle) 1907c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return SDValue(); // Would induce a cycle. 1908c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 19096e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1910c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we have walked all the matched nodes and collected TokenFactor nodes 1911c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that we are interested in. Form our input TokenFactor node. 19126b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SmallVector<SDValue, 3> InputChains; 19136b30792d2d7d142b8192241e6232aee004f745fbChris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1914c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Add the input chain of this node to the InputChains list (which will be 1915c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the operands of the generated TokenFactor) if it's not an interior node. 1916c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *N = ChainNodesMatched[i]; 1917c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (N->getOpcode() != ISD::TokenFactor) { 1918c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N)) 1919c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 19206e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1921c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise, add the input chain. 1922c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDValue InChain = ChainNodesMatched[i]->getOperand(0); 1923c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner assert(InChain.getValueType() == MVT::Other && "Not a chain"); 19246b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChains.push_back(InChain); 1925c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1926c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 19276e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1928c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a token factor, we want to add all inputs of the token factor 1929c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that are not part of the pattern we're matching. 1930c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) { 1931c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(), 19326183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner N->getOperand(op).getNode())) 19336183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner InputChains.push_back(N->getOperand(op)); 1934c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 19356b30792d2d7d142b8192241e6232aee004f745fbChris Lattner } 19366e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 19376b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SDValue Res; 19386b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChains.size() == 1) 19396b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return InputChains[0]; 19406b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(), 19416b30792d2d7d142b8192241e6232aee004f745fbChris Lattner MVT::Other, &InputChains[0], InputChains.size()); 19426e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick} 19432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19443ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner/// MorphNode - Handle morphing a node in place for the selector. 19453ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerSDNode *SelectionDAGISel:: 19463ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerMorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList, 19473ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) { 19483ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // It is possible we're using MorphNodeTo to replace a node with no 19493ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // normal results with one that has a normal result (or we could be 1950a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // adding a chain) and the input could have glue and chains as well. 1951caa8870fe09f5526e611434b6bb9f7040c7dfa60Chris Lattner // In this case we need to shift the operands down. 19523ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // FIXME: This is a horrible hack and broken in obscure cases, no worse 1953a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner // than the old isel though. 1954a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner int OldGlueResultNo = -1, OldChainResultNo = -1; 19553ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19563ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned NTMNumResults = Node->getNumValues(); 1957f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (Node->getValueType(NTMNumResults-1) == MVT::Glue) { 1958a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner OldGlueResultNo = NTMNumResults-1; 19593ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (NTMNumResults != 1 && 19603ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Node->getValueType(NTMNumResults-2) == MVT::Other) 19613ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-2; 19623ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } else if (Node->getValueType(NTMNumResults-1) == MVT::Other) 19633ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-1; 19643ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 196561c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // Call the underlying SelectionDAG routine to do the transmogrification. Note 196661c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // that this deletes operands of the old node that become dead. 19673ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps); 19683ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19693ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // MorphNodeTo can operate in two ways: if an existing node with the 19703ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // specified operands exists, it can just return it. Otherwise, it 19713ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // updates the node in place to have the requested operands. 19723ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res == Node) { 19733ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // If we updated the node in place, reset the node ID. To the isel, 19743ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // this should be just like a newly allocated machine node. 19753ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res->setNodeId(-1); 19763ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } 19773ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19783ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned ResNumResults = Res->getNumValues(); 1979a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Move the glue if needed. 1980a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if ((EmitNodeInfo & OPFL_GlueOutput) && OldGlueResultNo != -1 && 1981a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner (unsigned)OldGlueResultNo != ResNumResults-1) 19826e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldGlueResultNo), 19833ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 19843ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 1985a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if ((EmitNodeInfo & OPFL_GlueOutput) != 0) 1986d9cb7ca388c400e3c7a509c00d4cf63031de0ddeBill Wendling --ResNumResults; 19873ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19883ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the chain reference if needed. 19893ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 && 19903ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldChainResultNo != ResNumResults-1) 19916e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo), 19923ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 19933ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19943ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Otherwise, no replacement happened because the node already exists. Replace 19953ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Uses of the old node with the new one. 19963ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res != Node) 19973ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesWith(Node, Res); 19986e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 19993ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner return Res; 20003ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner} 20013ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 2002f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 200319e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2004da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2005d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDValue N, 2006d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) { 2007da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Accept if it is exactly the same as a previously recorded node. 2008da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 2009da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2010d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner return N == RecordedNodes[RecNo].first; 2011da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 20126e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2013da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 201419e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2015f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2016f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel) { 2017f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]); 2018f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2019f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2020f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckNodePredicate - Implements OP_CheckNodePredicate. 202119e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2022f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2023f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel, SDNode *N) { 2024f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]); 2025f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2026f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 202719e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2028f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2029f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDNode *N) { 2030d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2031d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2032d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner return N->getOpcode() == Opc; 2033f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2034f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 203519e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2036f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2037f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N, const TargetLowering &TLI) { 2038f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2039f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (N.getValueType() == VT) return true; 20406e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2041f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Handle the case when VT is iPTR. 2042f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy(); 2043f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2044f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 204519e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2046da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2047da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI, 2048da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned ChildNo) { 2049da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (ChildNo >= N.getNumOperands()) 2050da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return false; // Match fails if out of range child #. 2051da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI); 2052da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2053da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 2054da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 205519e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2056da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2057da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N) { 2058da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return cast<CondCodeSDNode>(N)->get() == 2059da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner (ISD::CondCode)MatcherTable[MatcherIndex++]; 2060da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2061da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 206219e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2063da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2064da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI) { 2065da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2066da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (cast<VTSDNode>(N)->getVT() == VT) 2067da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return true; 20686e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2069da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Handle the case when VT is iPTR. 2070da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy(); 2071da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2072da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 207319e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2074f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2075f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N) { 2076f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 2077f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (Val & 128) 2078f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 20796e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2080f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N); 2081f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return C != 0 && C->getSExtValue() == Val; 2082f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2083f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 208419e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2085da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2086da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 2087da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 2088da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 2089da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 20906e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2091da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::AND) return false; 20926e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2093da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 2094da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val); 2095da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2096da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 209719e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2098da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2099da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 2100da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 2101da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 2102da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 21036e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2104da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::OR) return false; 21056e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2106da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 2107da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val); 2108da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2109da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 2110f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// IsPredicateKnownToFail - If we know how and can do so without pushing a 2111f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// scope, evaluate the current node. If the current predicate is known to 2112f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// fail, set Result=true and return anything. If the current predicate is 2113f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// known to pass, set Result=false and return the MatcherIndex to continue 2114f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// with. If the current predicate is unknown, set Result=false and return the 21156e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick/// MatcherIndex to continue with. 2116f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattnerstatic unsigned IsPredicateKnownToFail(const unsigned char *Table, 2117f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned Index, SDValue N, 2118da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner bool &Result, SelectionDAGISel &SDISel, 2119d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) { 2120f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner switch (Table[Index++]) { 2121f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner default: 2122f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = false; 2123f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index-1; // Could not evaluate this predicate. 2124da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckSame: 2125da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckSame(Table, Index, N, RecordedNodes); 2126da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2127f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPatternPredicate: 2128da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckPatternPredicate(Table, Index, SDISel); 2129f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2130f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPredicate: 2131da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode()); 2132f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2133f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckOpcode: 2134f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckOpcode(Table, Index, N.getNode()); 2135f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2136f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckType: 2137f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckType(Table, Index, N, SDISel.TLI); 2138f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2139f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild0Type: 2140f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild1Type: 2141f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild2Type: 2142f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild3Type: 2143f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild4Type: 2144f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild5Type: 2145f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild6Type: 2146da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckChild7Type: 2147da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckChildType(Table, Index, N, SDISel.TLI, 2148da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type); 2149da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2150da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckCondCode: 2151da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckCondCode(Table, Index, N); 2152da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2153da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckValueType: 2154da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckValueType(Table, Index, N, SDISel.TLI); 2155f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2156f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckInteger: 2157f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckInteger(Table, Index, N); 2158f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2159da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckAndImm: 2160da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckAndImm(Table, Index, N, SDISel); 2161da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2162da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckOrImm: 2163da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckOrImm(Table, Index, N, SDISel); 2164da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2165f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2166f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2167f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2168b35798347ea87b8b6d36155b211016a7769f01abDan Gohmannamespace { 21693ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 21702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattnerstruct MatchScope { 21712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// FailIndex - If this match fails, this is the index to continue with. 21722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FailIndex; 21736e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 21742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NodeStack - The node stack when the scope was formed. 21752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 4> NodeStack; 21766e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 21772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumRecordedNodes - The number of recorded nodes when the scope was formed. 21782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumRecordedNodes; 21796e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 21802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumMatchedMemRefs - The number of matched memref entries. 21812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumMatchedMemRefs; 21826e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 21836e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick /// InputChain/InputGlue - The current chain/glue 2184a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDValue InputChain, InputGlue; 21852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty. 2187a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner bool HasChainNodesMatched, HasGlueResultNodesMatched; 21882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner}; 21892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2190b35798347ea87b8b6d36155b211016a7769f01abDan Gohman} 2191b35798347ea87b8b6d36155b211016a7769f01abDan Gohman 21922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSDNode *SelectionDAGISel:: 21932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable, 21942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned TableSize) { 21952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: Should these even be selected? Handle these cases in the caller? 21962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (NodeToMatch->getOpcode()) { 21972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner default: 21982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 21992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::EntryToken: // These nodes remain the same. 22002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::BasicBlock: 22012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::Register: 22023b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::VALUETYPE: 22033b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::CONDCODE: 22042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::HANDLENODE: 2205decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner case ISD::MDNODE_SDNODE: 22062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstant: 22072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantFP: 22082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantPool: 22092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetFrameIndex: 22102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetExternalSymbol: 22112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetBlockAddress: 22122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetJumpTable: 22132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalTLSAddress: 22142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalAddress: 22152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TokenFactor: 22162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyFromReg: 22172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyToReg: 22187561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner case ISD::EH_LABEL: 2219d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch->setNodeId(-1); // Mark selected. 22202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 22212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertSext: 22222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertZext: 22232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0), 22242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getOperand(0)); 22252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 22262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch); 22272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::UNDEF: return Select_UNDEF(NodeToMatch); 22282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22296e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeToMatch->isMachineOpcode() && "Node already selected!"); 22312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Set up the node stack with NodeToMatch as the only node on the stack. 22332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> NodeStack; 22342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue N = SDValue(NodeToMatch, 0); 22352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 22362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchScopes - Scopes used when matching, if a match failure happens, this 22382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // indicates where to continue checking. 22392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MatchScope, 8> MatchScopes; 22406e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // RecordedNodes - This is the set of nodes that have been recorded by the 2242d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner // state machine. The second value is the parent of the node, or null if the 2243d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner // root is recorded. 2244d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SmallVector<std::pair<SDValue, SDNode*>, 8> RecordedNodes; 22456e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchedMemRefs - This is the set of MemRef's we've seen in the input 22472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern. 22482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MachineMemOperand*, 2> MatchedMemRefs; 22496e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2250a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // These are the current input chain and glue for use when generating nodes. 22512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Various Emit operations change these. For example, emitting a copytoreg 22522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // uses and updates these. 2253a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDValue InputChain, InputGlue; 22546e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // ChainNodesMatched - If a pattern matches nodes that have input/output 22562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains, the OPC_EmitMergeInputChains operation is emitted which indicates 22572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // which ones they are. The result is captured into this list so that we can 22582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // update the chain results when the pattern is complete. 22592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> ChainNodesMatched; 2260a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SmallVector<SDNode*, 3> GlueResultNodesMatched; 22616e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Starting pattern match on root node: "; 22632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->dump(CurDAG); 22642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner errs() << '\n'); 22656e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22667390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Determine where to start the interpreter. Normally we start at opcode #0, 22677390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // but if the state machine starts with an OPC_SwitchOpcode, then we 22687390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // accelerate the first lookup (which is guaranteed to be hot) with the 22697390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // OpcodeOffset table. 22702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned MatcherIndex = 0; 22716e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22727390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (!OpcodeOffset.empty()) { 22737390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Already computed the OpcodeOffset table, just index into it. 22747390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 22757390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 22767390eebd49b786f3293d24f76fedb02fe183468cChris Lattner DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n"); 22777390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 22787390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } else if (MatcherTable[0] == OPC_SwitchOpcode) { 22797390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Otherwise, the table isn't computed, but the state machine does start 22807390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // with an OPC_SwitchOpcode instruction. Populate the table now, since this 22817390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // is the first time we're selecting an instruction. 22827390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned Idx = 1; 22837390eebd49b786f3293d24f76fedb02fe183468cChris Lattner while (1) { 22847390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the size of this case. 22857390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned CaseSize = MatcherTable[Idx++]; 22867390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize & 128) 22877390eebd49b786f3293d24f76fedb02fe183468cChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, Idx); 22887390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize == 0) break; 22897390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 22907390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the opcode, add the index to the table. 2291d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[Idx++]; 2292d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[Idx++] << 8; 22937390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (Opc >= OpcodeOffset.size()) 22947390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset.resize((Opc+1)*2); 22957390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset[Opc] = Idx; 22967390eebd49b786f3293d24f76fedb02fe183468cChris Lattner Idx += CaseSize; 22977390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 22987390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 22997390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Okay, do the lookup for the first opcode. 23007390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 23017390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 23027390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 23036e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 23042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 23052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(MatcherIndex < TableSize && "Invalid index"); 230619b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#ifndef NDEBUG 230719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman unsigned CurrentOpcodeIndex = MatcherIndex; 230819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#endif 23092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++]; 23102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (Opcode) { 23112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_Scope: { 2312f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Okay, the semantics of this operation are that we should push a scope 2313f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // then evaluate the first child. However, pushing a scope only to have 2314f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // the first check fail (which then pops it) is inefficient. If we can 2315f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // determine immediately that the first check (or first several) will 2316f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // immediately fail, don't even bother pushing a scope for them. 2317f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned FailIndex; 23186e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2319f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner while (1) { 2320f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 2321f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip & 128) 2322f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 2323f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Found the end of the scope with no match. 2324f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip == 0) { 2325f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = 0; 2326f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 2327f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 23286e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2329f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = MatcherIndex+NumToSkip; 23306e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2331a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner unsigned MatcherIndexOfPredicate = MatcherIndex; 2332a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner (void)MatcherIndexOfPredicate; // silence warning. 23336e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2334f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If we can't evaluate this predicate without pushing a scope (e.g. if 2335f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // it is a 'MoveParent') or if the predicate succeeds on this node, we 2336f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // push the scope and evaluate the full predicate chain. 2337f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner bool Result; 2338f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N, 2339da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result, *this, RecordedNodes); 2340f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!Result) 2341f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 23426e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2343a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner DEBUG(errs() << " Skipped scope entry (due to false predicate) at " 2344a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << "index " << MatcherIndexOfPredicate 2345a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << ", continuing at " << FailIndex << "\n"); 2346bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 23476e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2348f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Otherwise, we know that this case of the Scope is guaranteed to fail, 2349f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // move to the next case. 2350f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = FailIndex; 2351f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 23526e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2353f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If the whole scope failed to match, bail. 2354f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (FailIndex == 0) break; 23556e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 23562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Push a MatchScope which indicates where to go if the first child fails 23572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // to match. 23582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope NewEntry; 2359f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NewEntry.FailIndex = FailIndex; 23602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); 23612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumRecordedNodes = RecordedNodes.size(); 23622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumMatchedMemRefs = MatchedMemRefs.size(); 23632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputChain = InputChain; 2364a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner NewEntry.InputGlue = InputGlue; 23652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty(); 2366a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner NewEntry.HasGlueResultNodesMatched = !GlueResultNodesMatched.empty(); 23672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.push_back(NewEntry); 23682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 2370d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner case OPC_RecordNode: { 23712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Remember this node, it may end up being an operand in the pattern. 2372d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDNode *Parent = 0; 2373d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner if (NodeStack.size() > 1) 2374d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner Parent = NodeStack[NodeStack.size()-2].getNode(); 2375d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::make_pair(N, Parent)); 23762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2377d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner } 23786e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 23792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild0: case OPC_RecordChild1: 23802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild2: case OPC_RecordChild3: 23812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild4: case OPC_RecordChild5: 23822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild6: case OPC_RecordChild7: { 23832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = Opcode-OPC_RecordChild0; 23842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 23852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 23862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2387d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::make_pair(N->getOperand(ChildNo), 2388d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner N.getNode())); 23892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordMemRef: 23922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand()); 23932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23946e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 239529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner case OPC_CaptureGlueInput: 2396a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the current node has an input glue, capture it in InputGlue. 23972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (N->getNumOperands() != 0 && 2398f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue) 2399a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue = N->getOperand(N->getNumOperands()-1); 24002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24016e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 24022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveChild: { 24032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = MatcherTable[MatcherIndex++]; 24042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 24052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 24062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = N.getOperand(ChildNo); 24072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 24082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 24106e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 24112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveParent: 24122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Pop the current node off the NodeStack. 24132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.pop_back(); 24142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeStack.empty() && "Node stack imbalance!"); 24156e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick N = NodeStack.back(); 24162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24176e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2418da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckSame: 2419da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break; 24202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPatternPredicate: 2422f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break; 24232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPredicate: 2425f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this, 2426f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner N.getNode())) 2427f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 24282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 242957bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner case OPC_CheckComplexPat: { 243057bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned CPNum = MatcherTable[MatcherIndex++]; 243157bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 243257bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat"); 2433d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second, 2434d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes[RecNo].first, CPNum, 243557bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner RecordedNodes)) 24362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 24372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 243857bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner } 24392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckOpcode: 2440f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break; 2441f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner continue; 24426e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2443f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckType: 2444f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break; 24452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24466e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2447eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner case OPC_SwitchOpcode: { 2448eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CurNodeOpcode = N.getOpcode(); 24497d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2450eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CaseSize; 2451eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner while (1) { 2452eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Get the size of this case. 2453eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2454eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize & 128) 2455eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2456eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2457eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2458d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2459d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2460d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner 2461eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // If the opcode matches, then we will execute this case. 2462d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner if (CurNodeOpcode == Opc) 2463eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner break; 24646e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2465eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, skip over this case. 2466eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner MatcherIndex += CaseSize; 2467eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 24686e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2469cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2470eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 24716e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2472eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, execute the case we found. 2473eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner DEBUG(errs() << " OpcodeSwitch from " << SwitchStart 2474eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner << " to " << MatcherIndex << "\n"); 2475eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner continue; 2476eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 24776e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2478cfe2eab7446dedc471592fe702fefef783383171Chris Lattner case OPC_SwitchType: { 2479cdfad36b401be6fc709ea4051f9de58e1a30bcc9Duncan Sands MVT CurNodeVT = N.getValueType().getSimpleVT(); 2480cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2481cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned CaseSize; 2482cfe2eab7446dedc471592fe702fefef783383171Chris Lattner while (1) { 2483cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Get the size of this case. 2484cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2485cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize & 128) 2486cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2487cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 24886e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2489cdfad36b401be6fc709ea4051f9de58e1a30bcc9Duncan Sands MVT CaseVT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2490cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseVT == MVT::iPTR) 2491cdfad36b401be6fc709ea4051f9de58e1a30bcc9Duncan Sands CaseVT = TLI.getPointerTy(); 24926e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2493cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If the VT matches, then we will execute this case. 2494cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CurNodeVT == CaseVT) 2495cfe2eab7446dedc471592fe702fefef783383171Chris Lattner break; 24966e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2497cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, skip over this case. 2498cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MatcherIndex += CaseSize; 2499cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 25006e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2501cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2502cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 25036e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2504cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, execute the case we found. 2505cfe2eab7446dedc471592fe702fefef783383171Chris Lattner DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString() 2506cfe2eab7446dedc471592fe702fefef783383171Chris Lattner << "] from " << SwitchStart << " to " << MatcherIndex<<'\n'); 2507cfe2eab7446dedc471592fe702fefef783383171Chris Lattner continue; 2508cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 25092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild0Type: case OPC_CheckChild1Type: 25102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild2Type: case OPC_CheckChild3Type: 25112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild4Type: case OPC_CheckChild5Type: 2512da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckChild6Type: case OPC_CheckChild7Type: 2513da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI, 2514da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Opcode-OPC_CheckChild0Type)) 2515f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 25162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckCondCode: 2518da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break; 25192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2520da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckValueType: 2521da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break; 25222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2523f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckInteger: 2524f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break; 25252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2526da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckAndImm: 2527da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break; 25282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2529da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckOrImm: 2530da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break; 25312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25326e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 25332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckFoldableChainNode: { 25342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeStack.size() != 1 && "No parent node"); 25352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Verify that all intermediate nodes between the root and this one have 25362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // a single use. 25372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasMultipleUses = false; 25382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) 25392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!NodeStack[i].hasOneUse()) { 25402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner HasMultipleUses = true; 25412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 25422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (HasMultipleUses) break; 25442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see that the target thinks this is profitable to fold and that 25462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we can fold it without inducing cycles in the graph. 25472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(), 25482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch) || 25492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(), 2550d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman NodeToMatch, OptLevel, 2551d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman true/*We validate our own chains*/)) 25522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 25536e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 25542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitInteger: { 25572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 25582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 25592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 25602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Val & 128) 25612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 2562d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::pair<SDValue, SDNode*>( 2563df30bdb3a735a81b4182d80b870bc39846824396Oscar Fuentes CurDAG->getTargetConstant(Val, VT), (SDNode*)0)); 25642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitRegister: { 25672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 25682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 25692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RegNo = MatcherTable[MatcherIndex++]; 2570d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::pair<SDValue, SDNode*>( 2571df30bdb3a735a81b4182d80b870bc39846824396Oscar Fuentes CurDAG->getRegister(RegNo, VT), (SDNode*)0)); 25722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25742d76c84514216f51526f2be123315f585995d860Jim Grosbach case OPC_EmitRegister2: { 25752d76c84514216f51526f2be123315f585995d860Jim Grosbach // For targets w/ more than 256 register names, the register enum 25762d76c84514216f51526f2be123315f585995d860Jim Grosbach // values are stored in two bytes in the matcher table (just like 25772d76c84514216f51526f2be123315f585995d860Jim Grosbach // opcodes). 25782d76c84514216f51526f2be123315f585995d860Jim Grosbach MVT::SimpleValueType VT = 25792d76c84514216f51526f2be123315f585995d860Jim Grosbach (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 25802d76c84514216f51526f2be123315f585995d860Jim Grosbach unsigned RegNo = MatcherTable[MatcherIndex++]; 25812d76c84514216f51526f2be123315f585995d860Jim Grosbach RegNo |= MatcherTable[MatcherIndex++] << 8; 25822d76c84514216f51526f2be123315f585995d860Jim Grosbach RecordedNodes.push_back(std::pair<SDValue, SDNode*>( 25832d76c84514216f51526f2be123315f585995d860Jim Grosbach CurDAG->getRegister(RegNo, VT), (SDNode*)0)); 25842d76c84514216f51526f2be123315f585995d860Jim Grosbach continue; 25852d76c84514216f51526f2be123315f585995d860Jim Grosbach } 25866e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 25872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitConvertToTarget: { 25882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Convert from IMM/FPIMM to target version. 25892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 25902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2591d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDValue Imm = RecordedNodes[RecNo].first; 25922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Imm->getOpcode() == ISD::Constant) { 25942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue(); 25952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstant(Val, Imm.getValueType()); 25962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (Imm->getOpcode() == ISD::ConstantFP) { 25972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue(); 25982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType()); 25992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26006e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2601d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second)); 26022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 26032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26046e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2605aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0 2606aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1 2607aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // These are space-optimized forms of OPC_EmitMergeInputChains. 2608aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(InputChain.getNode() == 0 && 2609aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 2610aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(ChainNodesMatched.empty() && 2611aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "Should only have one EmitMergeInputChains per match"); 26126e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2613aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Read all of the chained nodes. 2614aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1; 2615aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2616d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode()); 26176e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2618aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // FIXME: What if other value results of the node have uses not matched 2619aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // by this pattern? 2620aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2621d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner !RecordedNodes[RecNo].first.hasOneUse()) { 2622aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.clear(); 2623aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; 2624aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 26256e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2626aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Merge the input chains if they are not intra-pattern references. 2627aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 26286e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2629aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (InputChain.getNode() == 0) 2630aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; // Failed to merge. 2631aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner continue; 2632aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 26336e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitMergeInputChains: { 26352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() == 0 && 26362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 26372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // This node gets a list of nodes we matched in the input that have 26382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains. We want to token factor all of the input chains to these nodes 26392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // together. However, if any of the input chains is actually one of the 26402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // nodes matched in this pattern, then we have an intra-match reference. 26412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Ignore these because the newly token factored chain should not refer to 26422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // the old nodes. 26432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumChains = MatcherTable[MatcherIndex++]; 26442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NumChains != 0 && "Can't TF zero chains"); 26452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainNodesMatched.empty() && 26472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Should only have one EmitMergeInputChains per match"); 26482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read all of the chained nodes. 265000592ec857b4c3f31b46412e2738924238c59983Chris Lattner for (unsigned i = 0; i != NumChains; ++i) { 265100592ec857b4c3f31b46412e2738924238c59983Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 26522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2653d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode()); 26546e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: What if other value results of the node have uses not matched 26562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // by this pattern? 26572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2658d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner !RecordedNodes[RecNo].first.hasOneUse()) { 26592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 26602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 26612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26636e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26646b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // If the inner loop broke out, the match fails. 26656b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (ChainNodesMatched.empty()) 26666b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; 26672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26686b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // Merge the input chains if they are not intra-pattern references. 26696b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 26706e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26716b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChain.getNode() == 0) 26726b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; // Failed to merge. 26732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 26752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26766e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitCopyToReg: { 26782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 26792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 26802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned DestPhysReg = MatcherTable[MatcherIndex++]; 26816e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputChain.getNode() == 0) 26832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getEntryNode(); 26846e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(), 2686d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner DestPhysReg, RecordedNodes[RecNo].first, 2687a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue); 26886e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2689a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue = InputChain.getValue(1); 26902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 26912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26926e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNodeXForm: { 26942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned XFormNo = MatcherTable[MatcherIndex++]; 26952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 26962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2697d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo); 2698df30bdb3a735a81b4182d80b870bc39846824396Oscar Fuentes RecordedNodes.push_back(std::pair<SDValue,SDNode*>(Res, (SDNode*) 0)); 26992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 27002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27016e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNode: 27032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MorphNodeTo: { 270414df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner uint16_t TargetOpc = MatcherTable[MatcherIndex++]; 270514df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 27062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned EmitNodeInfo = MatcherTable[MatcherIndex++]; 27072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the result VT list. 27082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumVTs = MatcherTable[MatcherIndex++]; 27092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<EVT, 4> VTs; 27102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumVTs; ++i) { 27112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 27122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 27132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy; 27142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(VT); 27152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27166e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 27182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Other); 2719a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (EmitNodeInfo & OPFL_GlueOutput) 2720f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner VTs.push_back(MVT::Glue); 27216e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27227d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // This is hot code, so optimize the two most common cases of 1 and 2 27237d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // results. 27247d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner SDVTList VTList; 27257d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner if (VTs.size() == 1) 27267d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0]); 27277d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else if (VTs.size() == 2) 27287d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0], VTs[1]); 27297d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else 27307d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs.data(), VTs.size()); 27312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the operand list. 27332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumOps = MatcherTable[MatcherIndex++]; 27342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> Ops; 27352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumOps; ++i) { 27362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 27372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 27382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 27396e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid EmitNode"); 2741d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner Ops.push_back(RecordedNodes[RecNo].first); 27422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27436e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If there are variadic operands to add, handle them now. 27452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_VariadicInfo) { 27462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Determine the start index to copy from. 27472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo); 27482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0; 27492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->getNumOperands() >= FirstOpToCopy && 27502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Invalid variadic node"); 2751a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Copy all of the variadic operands, not including a potential glue 27522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // input. 27532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands(); 27542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner i != e; ++i) { 27552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue V = NodeToMatch->getOperand(i); 2756f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (V.getValueType() == MVT::Glue) break; 27572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(V); 27582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27606e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2761a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If this has chain/glue inputs, add them. 27622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 27632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputChain); 2764a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if ((EmitNodeInfo & OPFL_GlueInput) && InputGlue.getNode() != 0) 2765a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner Ops.push_back(InputGlue); 27666e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Create the node. 27682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *Res = 0; 27692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode != OPC_MorphNodeTo) { 27702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this is a normal EmitNode command, just create the new node and 27712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // add the results to the RecordedNodes list. 27722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(), 27732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTList, Ops.data(), Ops.size()); 27746e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2775a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Add all the non-glue/non-chain results to the RecordedNodes list. 27762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = VTs.size(); i != e; ++i) { 2777f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (VTs[i] == MVT::Other || VTs[i] == MVT::Glue) break; 2778d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::pair<SDValue,SDNode*>(SDValue(Res, i), 2779df30bdb3a735a81b4182d80b870bc39846824396Oscar Fuentes (SDNode*) 0)); 27802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27816e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else { 27833ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(), 27843ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner EmitNodeInfo); 27852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27866e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2787a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the node had chain/glue results, update our notion of the current 2788a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // chain and glue. 2789a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (EmitNodeInfo & OPFL_GlueOutput) { 2790a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue = SDValue(Res, VTs.size()-1); 27912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 27922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-2); 27932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (EmitNodeInfo & OPFL_Chain) 27942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-1); 27952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2796a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the OPFL_MemRefs glue is set on this node, slap all of the 27972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // accumulated memrefs onto it. 27982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // 27992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: This is vastly incorrect for patterns with multiple outputs 28002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // instructions that access memory and for ComplexPatterns that match 28012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // loads. 28022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_MemRefs) { 28035a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich // Only attach load or store memory operands if the generated 28045a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich // instruction may load or store. 2805e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &MCID = TM.getInstrInfo()->get(TargetOpc); 2806e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng bool mayLoad = MCID.mayLoad(); 2807e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng bool mayStore = MCID.mayStore(); 28085a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich 28095a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich unsigned NumMemRefs = 0; 28105a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich for (SmallVector<MachineMemOperand*, 2>::const_iterator I = 28115a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) { 28125a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if ((*I)->isLoad()) { 28135a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if (mayLoad) 28145a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich ++NumMemRefs; 28155a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } else if ((*I)->isStore()) { 28165a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if (mayStore) 28175a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich ++NumMemRefs; 28185a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } else { 28195a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich ++NumMemRefs; 28205a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } 28215a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } 28225a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich 28232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MachineSDNode::mmo_iterator MemRefs = 28245a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich MF->allocateMemRefsArray(NumMemRefs); 28255a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich 28265a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich MachineSDNode::mmo_iterator MemRefsPos = MemRefs; 28275a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich for (SmallVector<MachineMemOperand*, 2>::const_iterator I = 28285a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) { 28295a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if ((*I)->isLoad()) { 28305a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if (mayLoad) 28315a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich *MemRefsPos++ = *I; 28325a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } else if ((*I)->isStore()) { 28335a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if (mayStore) 28345a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich *MemRefsPos++ = *I; 28355a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } else { 28365a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich *MemRefsPos++ = *I; 28375a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } 28385a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } 28395a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich 28402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner cast<MachineSDNode>(Res) 28415a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich ->setMemRefs(MemRefs, MemRefs + NumMemRefs); 28422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28436e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << " " 28452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created") 28462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << " node: "; Res->dump(CurDAG); errs() << "\n"); 28476e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this was a MorphNodeTo then we're completely done! 28492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode == OPC_MorphNodeTo) { 2850a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Update chain and glue uses. 2851a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched, 2852a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue, GlueResultNodesMatched, true); 285382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner return Res; 28542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28556e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 28572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28586e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 285929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner case OPC_MarkGlueResults: { 28602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumNodes = MatcherTable[MatcherIndex++]; 28616e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2862a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Read and remember all the glue-result nodes. 28632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumNodes; ++i) { 28642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 28652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 28662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 28672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 28682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2869a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner GlueResultNodesMatched.push_back(RecordedNodes[RecNo].first.getNode()); 28702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 28722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28736e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CompleteMatch: { 28752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // The match has been completed, and any new nodes (if any) have been 28762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created. Patch up references to the matched dag to use the newly 28772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created nodes. 28782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumResults = MatcherTable[MatcherIndex++]; 28792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 28802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumResults; ++i) { 28812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ResSlot = MatcherTable[MatcherIndex++]; 28822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ResSlot & 128) 28832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex); 28846e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame"); 2886d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDValue Res = RecordedNodes[ResSlot].first; 28876e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2888b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner assert(i < NodeToMatch->getNumValues() && 2889b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Other && 2890f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner NodeToMatch->getValueType(i) != MVT::Glue && 2891b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner "Invalid number of results to complete!"); 28922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert((NodeToMatch->getValueType(i) == Res.getValueType() || 28932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i) == MVT::iPTR || 28942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType() == MVT::iPTR || 28952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i).getSizeInBits() == 28962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType().getSizeInBits()) && 28972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "invalid replacement"); 28982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res); 28992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 290129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // If the root node defines glue, add it to the glue nodes to update list. 2902f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Glue) 2903a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner GlueResultNodesMatched.push_back(NodeToMatch); 29046e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2905a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Update chain and glue uses. 2906a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched, 2907a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue, GlueResultNodesMatched, false); 29086e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->use_empty() && 29102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Didn't replace all uses of the node?"); 29116e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: We just return here, which interacts correctly with SelectRoot 29132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // above. We should fix this to not return an SDNode* anymore. 29142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 29152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29176e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the code reached this point, then the match failed. See if there is 29192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // another child to try in the current 'Scope', otherwise pop it until we 29202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // find a case to check. 292119b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n"); 2922bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 29232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 29242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (MatchScopes.empty()) { 29252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CannotYetSelect(NodeToMatch); 29262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 29272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Restore the interpreter state back to the point where the scope was 29302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // formed. 29312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope &LastScope = MatchScopes.back(); 29322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.resize(LastScope.NumRecordedNodes); 29332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.clear(); 29342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end()); 29352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 29362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size()) 29382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.resize(LastScope.NumMatchedMemRefs); 29392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatcherIndex = LastScope.FailIndex; 29406e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 294119b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Continuing at " << MatcherIndex << "\n"); 29426e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = LastScope.InputChain; 2944a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue = LastScope.InputGlue; 29452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasChainNodesMatched) 29462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 2947a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (!LastScope.HasGlueResultNodesMatched) 2948a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner GlueResultNodesMatched.clear(); 29492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see what the offset is at the new MatcherIndex. If it is zero 29512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we have reached the end of this scope, otherwise we have another child 29522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // in the current scope to try. 29532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 29542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip & 128) 29552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 29562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If we have another child in this scope to match, update FailIndex and 29582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // try it. 29592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip != 0) { 29602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner LastScope.FailIndex = MatcherIndex+NumToSkip; 29612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 29622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29636e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // End of this scope, pop it and try the next child in the containing 29652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // scope. 29662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.pop_back(); 29672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 29706e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2973eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelect(SDNode *N) { 2974e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::string msg; 2975e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman raw_string_ostream Msg(msg); 29765df1578decc8b05ffaec0e7f5d1532234bc1be19Chris Lattner Msg << "Cannot select: "; 29776e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29782c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN && 29792c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_WO_CHAIN && 29802c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_VOID) { 29812c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->printrFull(Msg, CurDAG); 29822c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } else { 29832c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other; 29842c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner unsigned iid = 29852c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue(); 29862c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (iid < Intrinsic::num_intrinsics) 29872c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid); 29882c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo()) 29892c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "target intrinsic %" << TII->getName(iid); 29902c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else 29912c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "unknown intrinsic #" << iid; 29922c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } 299375361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error(Msg.str()); 2994e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 2995e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 29961997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 2997