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(NumFastIselFailUnreachable,"Fast isel fails on Unreachable"); 7873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 7973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Standard binary operators... 8073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAdd,"Fast isel fails on Add"); 8173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFAdd,"Fast isel fails on FAdd"); 8273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSub,"Fast isel fails on Sub"); 8373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFSub,"Fast isel fails on FSub"); 8473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailMul,"Fast isel fails on Mul"); 8573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFMul,"Fast isel fails on FMul"); 8673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailUDiv,"Fast isel fails on UDiv"); 8773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSDiv,"Fast isel fails on SDiv"); 8873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFDiv,"Fast isel fails on FDiv"); 8973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailURem,"Fast isel fails on URem"); 9073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSRem,"Fast isel fails on SRem"); 9173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFRem,"Fast isel fails on FRem"); 9273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 9373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Logical operators... 9473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAnd,"Fast isel fails on And"); 9573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailOr,"Fast isel fails on Or"); 9673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailXor,"Fast isel fails on Xor"); 9773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 9873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Memory instructions... 9973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAlloca,"Fast isel fails on Alloca"); 10073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailLoad,"Fast isel fails on Load"); 10173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailStore,"Fast isel fails on Store"); 10273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAtomicCmpXchg,"Fast isel fails on AtomicCmpXchg"); 10373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAtomicRMW,"Fast isel fails on AtomicRWM"); 10473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFence,"Fast isel fails on Frence"); 10573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailGetElementPtr,"Fast isel fails on GetElementPtr"); 10673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 10773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Convert instructions... 10873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailTrunc,"Fast isel fails on Trunc"); 10973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailZExt,"Fast isel fails on ZExt"); 11073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSExt,"Fast isel fails on SExt"); 11173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFPTrunc,"Fast isel fails on FPTrunc"); 11273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFPExt,"Fast isel fails on FPExt"); 11373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFPToUI,"Fast isel fails on FPToUI"); 11473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFPToSI,"Fast isel fails on FPToSI"); 11573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailUIToFP,"Fast isel fails on UIToFP"); 11673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSIToFP,"Fast isel fails on SIToFP"); 11773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailIntToPtr,"Fast isel fails on IntToPtr"); 11873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailPtrToInt,"Fast isel fails on PtrToInt"); 11973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailBitCast,"Fast isel fails on BitCast"); 12073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 12173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Other instructions... 12273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailICmp,"Fast isel fails on ICmp"); 12373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailFCmp,"Fast isel fails on FCmp"); 12473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailPHI,"Fast isel fails on PHI"); 12573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailSelect,"Fast isel fails on Select"); 12673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailCall,"Fast isel fails on Call"); 12773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailShl,"Fast isel fails on Shl"); 12873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailLShr,"Fast isel fails on LShr"); 12973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailAShr,"Fast isel fails on AShr"); 13073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailVAArg,"Fast isel fails on VAArg"); 13173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailExtractElement,"Fast isel fails on ExtractElement"); 13273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailInsertElement,"Fast isel fails on InsertElement"); 13373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailShuffleVector,"Fast isel fails on ShuffleVector"); 13473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailExtractValue,"Fast isel fails on ExtractValue"); 13573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailInsertValue,"Fast isel fails on InsertValue"); 13673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad RosierSTATISTIC(NumFastIselFailLandingPad,"Fast isel fails on LandingPad"); 13773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#endif 13873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 139ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 140293d5f8bc02a9148238b2c79484637f56de65b9cDan GohmanEnableFastISelVerbose("fast-isel-verbose", cl::Hidden, 141d659d50482e2f9edf8f436e4a1aa30c68c6d020bDan Gohman cl::desc("Enable verbose messages in the \"fast\" " 142293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohman "instruction selector")); 143293d5f8bc02a9148238b2c79484637f56de65b9cDan Gohmanstatic cl::opt<bool> 1444344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan GohmanEnableFastISelAbort("fast-isel-abort", cl::Hidden, 1454344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman cl::desc("Enable abort calls when \"fast\" instruction fails")); 146ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 1477cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszakstatic cl::opt<bool> 1487cc2b07437a1243c33324549a1904fefc5f1845eJakub StaszakUseMBPI("use-mbpi", 1497cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak cl::desc("use Machine Branch Probability Info"), 1507cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak cl::init(true), cl::Hidden); 1517cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak 152da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 1537944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 154462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 155462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 156462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 157462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 158462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 159462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 160462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 161462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 162462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 163462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 164462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 165462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 166462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 167462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 16825cf2275ff7de3de3bc0e508abaf457413d74725Duncan SandsViewDAGCombineLT("view-dag-combine-lt-dags", cl::Hidden, 16925cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands cl::desc("Pop up a window to show dags before the post legalize types" 17025cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands " dag combine pass")); 17125cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sandsstatic cl::opt<bool> 172a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 173a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 174a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 175a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 176a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 1773e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 1783e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 1795bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 1807944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 181462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 182462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 183462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 18425cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombineLT = false, 185462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 186462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 1877944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 1887944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 189eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 190eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 191eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 192eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 193eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 194eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 195eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 196eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 197eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 198eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 199eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 200eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 201844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 202844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 203844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 204844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 205844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 206844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 20713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 208844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 209b8cab9227a0f6ffbdaae33e3c64268e265008a6aDan GohmandefaultListDAGScheduler("default", "Best scheduler for the target", 210844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 2114ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 212f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohmannamespace llvm { 213f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman //===--------------------------------------------------------------------===// 214f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// createDefaultScheduler - This creates an instruction scheduler appropriate 215f0cbcd48804961b05359ee41859bbd7774f41fe0Dan Gohman /// for the target. 21647ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes* createDefaultScheduler(SelectionDAGISel *IS, 21798a366d547772010e94609e4584489b3e5ce0043Bill Wendling CodeGenOpt::Level OptLevel) { 218e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman const TargetLowering &TLI = IS->getTargetLowering(); 219e9530ecae4897fe8157bd4d7616043bd8c0484e2Dan Gohman 220f0a95356d649dc0fb65691c4acebee450f3529b4Evan Cheng if (OptLevel == CodeGenOpt::None || 221f0a95356d649dc0fb65691c4acebee450f3529b4Evan Cheng TLI.getSchedulingPreference() == Sched::Source) 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); 227ee498d3254b86bceb4f441741e9f442990647ce6Andrew Trick if (TLI.getSchedulingPreference() == Sched::VLIW) 228ee498d3254b86bceb4f441741e9f442990647ce6Andrew Trick return createVLIWDAGScheduler(IS, OptLevel); 22970017e44cdba1946cc478ce1856a3e855a767e28Evan Cheng assert(TLI.getSchedulingPreference() == Sched::ILP && 230211ffa13519cadfb7f9baf4c8447fa055bf38fe8Evan Cheng "Unknown sched type!"); 23170017e44cdba1946cc478ce1856a3e855a767e28Evan Cheng return createILPListDAGScheduler(IS, OptLevel); 2323a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 2331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 235ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 236533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// that mark instructions with the 'usesCustomInserter' flag. These 237025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 238025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 239533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// basic blocks, and this method is called to expand it into a sequence of 240533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// instructions, potentially also creating new basic blocks and control flow. 241533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// When new basic blocks are inserted and the edges from MBB to its successors 242533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// are modified, the method should insert pairs of <OldSucc, NewSucc> into the 243533297b58da8c74bec65551e1aface9801fc2259Dan Gohman// DenseMap. 244af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanMachineBasicBlock * 245af1d8ca44a18f304f207e209b3bdb94b590f86ffDan GohmanTargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 246af1d8ca44a18f304f207e209b3bdb94b590f86ffDan Gohman MachineBasicBlock *MBB) const { 247f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#ifndef NDEBUG 2481a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "If a target marks an instruction with " 249533297b58da8c74bec65551e1aface9801fc2259Dan Gohman "'usesCustomInserter', it must implement " 250f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin "TargetLowering::EmitInstrWithCustomInserter!"; 251f36892335b4919b9120e48a792e6b3630b9de978Torok Edwin#endif 252c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable(0); 253025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 254025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 25537fefc20d3a1e3934a377567d54a141f67752227Evan Chengvoid TargetLowering::AdjustInstrPostInstrSelection(MachineInstr *MI, 25637fefc20d3a1e3934a377567d54a141f67752227Evan Cheng SDNode *Node) const { 2575a96b3dad2f634c9081c8b2b6c2575441dc5a2bdEvan Cheng assert(!MI->hasPostISelHook() && 2583be654f8082dcbdff011a6716a7c90486e28fc9eAndrew Trick "If a target marks an instruction with 'hasPostISelHook', " 2593be654f8082dcbdff011a6716a7c90486e28fc9eAndrew Trick "it must implement TargetLowering::AdjustInstrPostInstrSelection!"); 26037fefc20d3a1e3934a377567d54a141f67752227Evan Cheng} 26137fefc20d3a1e3934a377567d54a141f67752227Evan Cheng 2627041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2637041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 2647041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 2651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2662d24e2a396a1d211baaeedf32148a3b657240170David Blaikievoid SelectionDAGISel::ISelUpdater::anchor() { } 2672d24e2a396a1d211baaeedf32148a3b657240170David Blaikie 268762a17a040f2e5c7f76b6b85d853cca454289e71Eric ChristopherSelectionDAGISel::SelectionDAGISel(const TargetMachine &tm, 269762a17a040f2e5c7f76b6b85d853cca454289e71Eric Christopher CodeGenOpt::Level OL) : 27090c579de5a383cee278acc3f7e7b9d0a656e6a35Owen Anderson MachineFunctionPass(ID), TM(tm), TLI(*tm.getTargetLowering()), 2717c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 2720508d047fefef36d4f943ee13c82c18cf3a943abDevang Patel CurDAG(new SelectionDAG(tm, OL)), 27355e59c186303ff02c0be7429da3b1b36c347f164Dan Gohman SDB(new SelectionDAGBuilder(*CurDAG, *FuncInfo, OL)), 2747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 275be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling OptLevel(OL), 276081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson DAGSize(0) { 277081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson initializeGCModuleInfoPass(*PassRegistry::getPassRegistry()); 278081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson initializeAliasAnalysisAnalysisGroup(*PassRegistry::getPassRegistry()); 2797cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak initializeBranchProbabilityInfoPass(*PassRegistry::getPassRegistry()); 280243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson initializeTargetLibraryInfoPass(*PassRegistry::getPassRegistry()); 281081c34b725980f995be9080eaec24cd3dfaaf065Owen Anderson } 2827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 2837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 2842048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman delete SDB; 2857c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 2867c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 2877c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 2887c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 289495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 290c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 291a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<AliasAnalysis>(); 2925eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 293a3477fe06df794e0eae26ea243f25912c619a6c4Dan Gohman AU.addPreserved<GCModuleInfo>(); 294243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson AU.addRequired<TargetLibraryInfo>(); 2957cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak if (UseMBPI && OptLevel != CodeGenOpt::None) 2967cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak AU.addRequired<BranchProbabilityInfo>(); 297ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohman MachineFunctionPass::getAnalysisUsage(AU); 298495a0b51915eb763576874f29192820b731edc22Chris Lattner} 2991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 30096ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// SplitCriticalSideEffectEdges - Look for critical edges with a PHI value that 30196ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// may trap on it. In this case we have to split the edge so that the path 30296ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// through the predecessor block that doesn't go to the phi block doesn't 30396ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// execute the possibly trapping instruction. 30496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// 30596ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// This is required for correctness, so it must be done at -O0. 30696ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner/// 30796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattnerstatic void SplitCriticalSideEffectEdges(Function &Fn, Pass *SDISel) { 30896ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // Loop for blocks with phi nodes. 30996ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) { 31096ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner PHINode *PN = dyn_cast<PHINode>(BB->begin()); 31196ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner if (PN == 0) continue; 3126e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 31396ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner ReprocessBlock: 31496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // For each block with a PHI node, check to see if any of the input values 31596ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // are potentially trapping constant expressions. Constant expressions are 31696ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // the only potentially trapping value that can occur as the argument to a 31796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // PHI. 31896ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner for (BasicBlock::iterator I = BB->begin(); (PN = dyn_cast<PHINode>(I)); ++I) 31996ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i) { 32096ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner ConstantExpr *CE = dyn_cast<ConstantExpr>(PN->getIncomingValue(i)); 32196ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner if (CE == 0 || !CE->canTrap()) continue; 3226e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 32396ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // The only case we have to worry about is when the edge is critical. 32496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // Since this block has a PHI Node, we assume it has multiple input 32596ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // edges: check to see if the pred has multiple successors. 32696ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner BasicBlock *Pred = PN->getIncomingBlock(i); 32796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner if (Pred->getTerminator()->getNumSuccessors() == 1) 32896ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner continue; 3296e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 33096ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner // Okay, we have to split this edge. 33196ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner SplitCriticalEdge(Pred->getTerminator(), 33296ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner GetSuccessorNumber(Pred, BB), SDISel, true); 33396ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner goto ReprocessBlock; 33496ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner } 33596ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner } 33696ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner} 33796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner 338ad2afc2a421a0e41603d5eee412d4d8c77e9bc1cDan Gohmanbool SelectionDAGISel::runOnMachineFunction(MachineFunction &mf) { 3394344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman // Do some sanity-checking on the command-line options. 3408a8d479214745c82ef00f08d4e4f1c173b5f9ce2Nick Lewycky assert((!EnableFastISelVerbose || TM.Options.EnableFastISel) && 3414344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-verbose requires -fast-isel"); 3428a8d479214745c82ef00f08d4e4f1c173b5f9ce2Nick Lewycky assert((!EnableFastISelAbort || TM.Options.EnableFastISel) && 3434344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman "-fast-isel-abort requires -fast-isel"); 3444344a5d0d7b280f0b891e0e6a4413b059d9080b3Dan Gohman 345ae541aad5c36cb3e4256514447d1f81e253079c7Dan Gohman const Function &Fn = *mf.getFunction(); 3468a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetInstrInfo &TII = *TM.getInstrInfo(); 3478a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman const TargetRegisterInfo &TRI = *TM.getRegisterInfo(); 3488a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 349c0fb65da040668df543db514f05e4be571edf700Dan Gohman MF = &mf; 35079ce276083ced01256a0eb7d80731e4948ca6e87Dan Gohman RegInfo = &MF->getRegInfo(); 351c0fb65da040668df543db514f05e4be571edf700Dan Gohman AA = &getAnalysis<AliasAnalysis>(); 352243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson LibInfo = &getAnalysis<TargetLibraryInfo>(); 353c0fb65da040668df543db514f05e4be571edf700Dan Gohman GFI = Fn.hasGC() ? &getAnalysis<GCModuleInfo>().getFunctionInfo(Fn) : 0; 354c0fb65da040668df543db514f05e4be571edf700Dan Gohman 3551a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "\n\n\n=== " << Fn.getName() << "\n"); 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 35796ba57fddac5999ef6d4009d8baef24607da6221Chris Lattner SplitCriticalSideEffectEdges(const_cast<Function&>(Fn), this); 3586e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 359de6e783b2490447866b592cd39855e6f4d25efffChris Lattner CurDAG->init(*MF); 3607451d3e09d26115195280ba36f686a0a90815089Dan Gohman FuncInfo->set(Fn, *MF); 3617cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak 3627cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak if (UseMBPI && OptLevel != CodeGenOpt::None) 3637cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak FuncInfo->BPI = &getAnalysis<BranchProbabilityInfo>(); 3647cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak else 3657cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak FuncInfo->BPI = 0; 3667cc2b07437a1243c33324549a1904fefc5f1845eJakub Staszak 367243eb9ecbbc6775e346e94025bd255bbceac9fcaOwen Anderson SDB->init(GFI, *AA, LibInfo); 3681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3696a732b5a669c85505a5785ee7ccb72eb9d1a4e6dDan Gohman SelectAllBasicBlocks(Fn); 370edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3711b79a2ff547a5ead0eef933bb02f51b3a2f4cc1cDan Gohman // If the first basic block in the function has live ins that need to be 3728a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // copied into vregs, emit the copies into the top of the block before 3738a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman // emitting the code for the block. 3742ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock *EntryMBB = MF->begin(); 3752ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng RegInfo->EmitLiveInCopies(EntryMBB, TRI, TII); 3762ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 377394427b014a7126e56f3ee411993f08677d93c83Devang Patel DenseMap<unsigned, unsigned> LiveInMap; 378394427b014a7126e56f3ee411993f08677d93c83Devang Patel if (!FuncInfo->ArgDbgValues.empty()) 379394427b014a7126e56f3ee411993f08677d93c83Devang Patel for (MachineRegisterInfo::livein_iterator LI = RegInfo->livein_begin(), 380394427b014a7126e56f3ee411993f08677d93c83Devang Patel E = RegInfo->livein_end(); LI != E; ++LI) 3816e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick if (LI->second) 382394427b014a7126e56f3ee411993f08677d93c83Devang Patel LiveInMap.insert(std::make_pair(LI->first, LI->second)); 383394427b014a7126e56f3ee411993f08677d93c83Devang Patel 3842ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Insert DBG_VALUE instructions for function arguments to the entry block. 3852ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng for (unsigned i = 0, e = FuncInfo->ArgDbgValues.size(); i != e; ++i) { 3862ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *MI = FuncInfo->ArgDbgValues[e-i-1]; 3872ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng unsigned Reg = MI->getOperand(0).getReg(); 3882ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng if (TargetRegisterInfo::isPhysicalRegister(Reg)) 3892ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng EntryMBB->insert(EntryMBB->begin(), MI); 3902ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng else { 3912ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineInstr *Def = RegInfo->getVRegDef(Reg); 3922ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng MachineBasicBlock::iterator InsertPos = Def; 393f1ced259b5617e9c15fcafd47e090c22e2702062Evan Cheng // FIXME: VR def may not be in entry block. 394f1ced259b5617e9c15fcafd47e090c22e2702062Evan Cheng Def->getParent()->insert(llvm::next(InsertPos), MI); 3952ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 396394427b014a7126e56f3ee411993f08677d93c83Devang Patel 397394427b014a7126e56f3ee411993f08677d93c83Devang Patel // If Reg is live-in then update debug info to track its copy in a vreg. 398394427b014a7126e56f3ee411993f08677d93c83Devang Patel DenseMap<unsigned, unsigned>::iterator LDI = LiveInMap.find(Reg); 399394427b014a7126e56f3ee411993f08677d93c83Devang Patel if (LDI != LiveInMap.end()) { 400394427b014a7126e56f3ee411993f08677d93c83Devang Patel MachineInstr *Def = RegInfo->getVRegDef(LDI->second); 401394427b014a7126e56f3ee411993f08677d93c83Devang Patel MachineBasicBlock::iterator InsertPos = Def; 4026e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick const MDNode *Variable = 403394427b014a7126e56f3ee411993f08677d93c83Devang Patel MI->getOperand(MI->getNumOperands()-1).getMetadata(); 404394427b014a7126e56f3ee411993f08677d93c83Devang Patel unsigned Offset = MI->getOperand(1).getImm(); 405394427b014a7126e56f3ee411993f08677d93c83Devang Patel // Def is never a terminator here, so it is ok to increment InsertPos. 4066e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick BuildMI(*EntryMBB, ++InsertPos, MI->getDebugLoc(), 407394427b014a7126e56f3ee411993f08677d93c83Devang Patel TII.get(TargetOpcode::DBG_VALUE)) 408394427b014a7126e56f3ee411993f08677d93c83Devang Patel .addReg(LDI->second, RegState::Debug) 409394427b014a7126e56f3ee411993f08677d93c83Devang Patel .addImm(Offset).addMetadata(Variable); 41044cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel 41144cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel // If this vreg is directly copied into an exported register then 41244cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel // that COPY instructions also need DBG_VALUE, if it is the only 41344cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel // user of LDI->second. 41444cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel MachineInstr *CopyUseMI = NULL; 4156e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick for (MachineRegisterInfo::use_iterator 4166e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick UI = RegInfo->use_begin(LDI->second); 41744cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel MachineInstr *UseMI = UI.skipInstruction();) { 41844cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel if (UseMI->isDebugValue()) continue; 41944cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel if (UseMI->isCopy() && !CopyUseMI && UseMI->getParent() == EntryMBB) { 42044cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel CopyUseMI = UseMI; continue; 42144cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel } 42244cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel // Otherwise this is another use or second copy use. 42344cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel CopyUseMI = NULL; break; 42444cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel } 42544cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel if (CopyUseMI) { 42644cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel MachineInstr *NewMI = 4276e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick BuildMI(*MF, CopyUseMI->getDebugLoc(), 42844cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel TII.get(TargetOpcode::DBG_VALUE)) 42944cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel .addReg(CopyUseMI->getOperand(0).getReg(), RegState::Debug) 43044cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel .addImm(Offset).addMetadata(Variable); 4317c2a4a30e0e16762c75adacebd05ec9fcbccf16bEvan Cheng MachineBasicBlock::iterator Pos = CopyUseMI; 4327c2a4a30e0e16762c75adacebd05ec9fcbccf16bEvan Cheng EntryMBB->insertAfter(Pos, NewMI); 43344cfe14445bcdd591d4f2ed59fe73582360bd8c9Devang Patel } 434394427b014a7126e56f3ee411993f08677d93c83Devang Patel } 4352ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng } 4362ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng 43753f7602b61157ed56ccbf91379c188c55235f619Bill Wendling // Determine if there are any calls in this machine function. 43853f7602b61157ed56ccbf91379c188c55235f619Bill Wendling MachineFrameInfo *MFI = MF->getFrameInfo(); 43953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling if (!MFI->hasCalls()) { 44053f7602b61157ed56ccbf91379c188c55235f619Bill Wendling for (MachineFunction::const_iterator 44153f7602b61157ed56ccbf91379c188c55235f619Bill Wendling I = MF->begin(), E = MF->end(); I != E; ++I) { 44253f7602b61157ed56ccbf91379c188c55235f619Bill Wendling const MachineBasicBlock *MBB = I; 44353f7602b61157ed56ccbf91379c188c55235f619Bill Wendling for (MachineBasicBlock::const_iterator 44453f7602b61157ed56ccbf91379c188c55235f619Bill Wendling II = MBB->begin(), IE = MBB->end(); II != IE; ++II) { 445e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &MCID = TM.getInstrInfo()->get(II->getOpcode()); 4468886c495a33703d8bd8319d16b62645cee4dd546Bill Wendling 447e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng if ((MCID.isCall() && !MCID.isReturn()) || 448c36b7069b42bece963b7e6adf020353ce990ef76Evan Cheng II->isStackAligningInlineAsm()) { 44953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling MFI->setHasCalls(true); 45053f7602b61157ed56ccbf91379c188c55235f619Bill Wendling goto done; 45153f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 45253f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 45353f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 45453f7602b61157ed56ccbf91379c188c55235f619Bill Wendling done:; 45553f7602b61157ed56ccbf91379c188c55235f619Bill Wendling } 45653f7602b61157ed56ccbf91379c188c55235f619Bill Wendling 4579af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling // Determine if there is a call to setjmp in the machine function. 45834706936412b9e9ff73511fed58e97bf6e100e69Joerg Sonnenberger MF->setExposesReturnsTwice(Fn.callsFunctionThatReturnsTwice()); 4599af7e9a1b5fb04ba677059ada9290cd3864523b2Bill Wendling 46084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Replace forward-declared registers with the registers containing 46184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // the desired value. 46284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MachineRegisterInfo &MRI = MF->getRegInfo(); 46384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (DenseMap<unsigned, unsigned>::iterator 46484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman I = FuncInfo->RegFixups.begin(), E = FuncInfo->RegFixups.end(); 46584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman I != E; ++I) { 46684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned From = I->first; 46784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned To = I->second; 46884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If To is also scheduled to be replaced, find what its ultimate 46984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // replacement is. 47084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (;;) { 47184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman DenseMap<unsigned, unsigned>::iterator J = 47284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->RegFixups.find(To); 47384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (J == E) break; 47484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman To = J->second; 47584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman } 47684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Replace it. 47784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman MRI.replaceRegWith(From, To); 47884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman } 47984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 4802ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // Release function-specific state. SDB and CurDAG are already cleared 4812ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng // at this point. 4822ad0fcf794924f618a7240741cc14a39be99d0f2Evan Cheng FuncInfo->clear(); 4838a11053f3ca7efb29312c4293c4fdb5d2ca3e20fDan Gohman 4841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 4851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 487685090f5988a03da1a515493bad1e592d26b9956Chris Lattnervoid SelectionDAGISel::SelectBasicBlock(BasicBlock::const_iterator Begin, 488685090f5988a03da1a515493bad1e592d26b9956Chris Lattner BasicBlock::const_iterator End, 489685090f5988a03da1a515493bad1e592d26b9956Chris Lattner bool &HadTailCall) { 49098ca4f2a325f72374a477f9deba7d09e8999c29bDan Gohman // Lower all of the non-terminator instructions. If a call is emitted 491f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // as a tail call, cease emitting nodes for this block. Terminators 492f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman // are handled below. 493c105a2b5b7d8969e78bd4b203e980dced8a1c689Dan Gohman for (BasicBlock::const_iterator I = Begin; I != End && !SDB->HasTailCall; ++I) 494f89d1dc9b77ee006324653f70496d29ac3d3bc6cDan Gohman SDB->visit(*I); 495f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 496a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 4972048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getControlRoot()); 4982048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman HadTailCall = SDB->HasTailCall; 4992048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 50095140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 50195140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Final step, emit the lowered DAG as machine code. 50284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 505f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 506ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 507ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 508a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 509ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 510a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 511ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 512ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 513a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5147b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer do { 5157b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer SDNode *N = Worklist.pop_back_val(); 516a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 517ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 518ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 519ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 520a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 521ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 522ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 523825b72b0571821bf2d378749f69d6c4cfb52d2f9Owen Anderson if (N->getOperand(i).getValueType() == MVT::Other) 524ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 525a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 526ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 527ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 528ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 529a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 530ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 531ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 532ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 533a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 534ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 535475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 536e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT SrcVT = Src.getValueType(); 537ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 538ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 539a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 540f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 54126c8dcc692fb2addd475446cfff24d6a4e958bcaRafael Espindola CurDAG->ComputeMaskedBits(Src, KnownZero, KnownOne); 542e1497b979166765d97c91813a8e830a1ab8fbe12Cameron Zwarich FuncInfo->AddLiveOutRegInfo(DestReg, NumSignBits, KnownZero, KnownOne); 5437b1e2a50a51793428a792a15d2777a4c48e0db49Benjamin Kramer } while (!Worklist.empty()); 544ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 545ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 54684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 547462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 548462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 549462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 550462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 551a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick int BlockNumber = -1; 5521f6a329f79b3568d379142f921f59c4143ddaa14Duncan Sands (void)BlockNumber; 553a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick#ifdef NDEBUG 554462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 55525cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewDAGCombine2 || ViewDAGCombineLT || ViewISelDAGs || ViewSchedDAGs || 55625cf2275ff7de3de3bc0e508abaf457413d74725Duncan Sands ViewSUnitDAGs) 557a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick#endif 558a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick { 559a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick BlockNumber = FuncInfo->MBB->getNumber(); 560a7b0cb759433c715065440ee2a963a04db7f2b0bBenjamin Kramer BlockName = MF->getFunction()->getName().str() + ":" + 561a7b0cb759433c715065440ee2a963a04db7f2b0bBenjamin Kramer FuncInfo->MBB->getBasicBlock()->getName().str(); 562a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick } 563a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Initial selection DAG: BB#" << BlockNumber 564a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 565462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 566f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 567417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 568af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 56903c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 57003c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName, TimePassesIsEnabled); 571501852423d34578bc41a745681783b04124dd0dbEli Friedman CurDAG->Combine(BeforeLegalizeTypes, *AA, OptLevel); 572ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 573a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 574a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Optimized lowered selection DAG: BB#" << BlockNumber 575a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 576a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 5771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 5781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 579714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 580714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman BlockName); 581714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 582714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman bool Changed; 58303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 58403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Type Legalization", GroupName, TimePassesIsEnabled); 585714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeTypes(); 586714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 587714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 588a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Type-legalized selection DAG: BB#" << BlockNumber 589a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 590462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 591714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 592714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 593714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lt input for " + BlockName); 594714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 595714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 59603c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 59703c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining after legalize types", GroupName, 59803c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 599501852423d34578bc41a745681783b04124dd0dbEli Friedman CurDAG->Combine(AfterLegalizeTypes, *AA, OptLevel); 600462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 601462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 602a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Optimized type-legalized selection DAG: BB#" << BlockNumber 603a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 604714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 605462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 60603c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 60703c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Vector Legalization", GroupName, TimePassesIsEnabled); 608714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman Changed = CurDAG->LegalizeVectors(); 609714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman } 6105c22c8074404797f1313b1334757254fb5c6487aEli Friedman 611714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (Changed) { 61203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 61303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Type Legalization 2", GroupName, TimePassesIsEnabled); 6149882007003b12466df717cdf66824120ede405beBill Wendling CurDAG->LegalizeTypes(); 6155c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 6165c22c8074404797f1313b1334757254fb5c6487aEli Friedman 617714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman if (ViewDAGCombineLT) 618714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman CurDAG->viewGraph("dag-combine-lv input for " + BlockName); 6195c22c8074404797f1313b1334757254fb5c6487aEli Friedman 620714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman // Run the DAG combiner in post-type-legalize mode. 62103c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 62203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining after legalize vectors", GroupName, 62303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 624501852423d34578bc41a745681783b04124dd0dbEli Friedman CurDAG->Combine(AfterLegalizeVectorOps, *AA, OptLevel); 6255c22c8074404797f1313b1334757254fb5c6487aEli Friedman } 626714efc63d4319b771d89a95aa7a42d400f03d8c9Dan Gohman 627a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Optimized vector-legalized selection DAG: BB#" 628a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << BlockNumber << " '" << BlockName << "'\n"; CurDAG->dump()); 62970587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 630a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 631f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 632462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 63303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 63403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName, TimePassesIsEnabled); 635975716af1b9a09274df6c2d92683449015bd8564Dan Gohman CurDAG->Legalize(); 636ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 637a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 638a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Legalized selection DAG: BB#" << BlockNumber 639a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 640a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 641f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 642462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 643af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 64403c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 64503c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName, TimePassesIsEnabled); 646501852423d34578bc41a745681783b04124dd0dbEli Friedman CurDAG->Combine(AfterLegalizeDAG, *AA, OptLevel); 647ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 648a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 649a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Optimized legalized selection DAG: BB#" << BlockNumber 650a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 651417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 6524e39e9da0f3a435445261d0f796bb0913f3c2bf0Dan Gohman if (OptLevel != CodeGenOpt::None) 653f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 654552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 655552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 656552186dfd3238a43655ffda1b5adadec461c9886Chris Lattner 657a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 658a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 65903c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 66003c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName, TimePassesIsEnabled); 6617c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DoInstructionSelection(); 662ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 663db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 664a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(dbgs() << "Selected selection DAG: BB#" << BlockNumber 665a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << BlockName << "'\n"; CurDAG->dump()); 666462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 667f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 668462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 6695e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 67047ac0f0c7c39289f5970688154e385be22b7f293Dan Gohman ScheduleDAGSDNodes *Scheduler = CreateScheduler(); 67103c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 67203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName, 67303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 67447c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick Scheduler->Run(CurDAG, FuncInfo->MBB); 6755e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6765e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 677462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 678462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 679a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar // Emit machine code to BB. This can change 'BB' to the last block being 680db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 6812622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen MachineBasicBlock *FirstMBB = FuncInfo->MBB, *LastMBB; 68203c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 68303c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName, TimePassesIsEnabled); 68484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 68547c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick // FuncInfo->InsertPt is passed by reference and set to the end of the 68647c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick // scheduled instructions. 68747c144505b9be28ed22c626b3a407c11dba2fec5Andrew Trick LastMBB = FuncInfo->MBB = Scheduler->EmitSchedule(FuncInfo->InsertPt); 6885e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 6895e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 6902622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen // If the block was split, make sure we update any references that are used to 6912622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen // update PHI nodes later on. 6922622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen if (FirstMBB != LastMBB) 6932622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen SDB->UpdateSplitBlock(FirstMBB, LastMBB); 6942622f4622c36ec9924fb908085154ffdd7174affJakob Stoklund Olesen 6955e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 69603c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman { 69703c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName, 69803c3dc7b6828d48a9f3be50896b3390a696caa64Dan Gohman TimePassesIsEnabled); 6995e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 700ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 701db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 70295140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Free the SelectionDAG state, now that we're finished with it. 70395140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman CurDAG->clear(); 704a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar} 705f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 7067c306da505e2d7f64e160890b274a47fa0740962Chris Lattnervoid SelectionDAGISel::DoInstructionSelection() { 707a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick DEBUG(errs() << "===== Instruction selection begins: BB#" 708a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << FuncInfo->MBB->getNumber() 709a2f45291e1a50a571a15bbf4da38a5f42a2424efAndrew Trick << " '" << FuncInfo->MBB->getName() << "'\n"); 7107c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7117c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PreprocessISelDAG(); 7126e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7137c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Select target instructions for the DAG. 7147c306da505e2d7f64e160890b274a47fa0740962Chris Lattner { 7157c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Number all nodes with a topological order and set DAGSize. 7167c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DAGSize = CurDAG->AssignTopologicalOrder(); 7176e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7187c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Create a dummy node (which is not added to allnodes), that adds 7197c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // a reference to the root node, preventing it from being deleted, 7207c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // and tracking any changes of the root. 7217c306da505e2d7f64e160890b274a47fa0740962Chris Lattner HandleSDNode Dummy(CurDAG->getRoot()); 7227c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelPosition = SelectionDAG::allnodes_iterator(CurDAG->getRoot().getNode()); 7237c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ++ISelPosition; 7246e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7257c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // The AllNodes list is now topological-sorted. Visit the 7267c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // nodes by starting at the end of the list (the root of the 7277c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // graph) and preceding back toward the beginning (the entry 7287c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // node). 7297c306da505e2d7f64e160890b274a47fa0740962Chris Lattner while (ISelPosition != CurDAG->allnodes_begin()) { 7307c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *Node = --ISelPosition; 7317c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Skip dead nodes. DAGCombiner is expected to eliminate all dead nodes, 7327c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // but there are currently some corner cases that it misses. Also, this 7337c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // makes it theoretically possible to disable the DAGCombiner. 7347c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) 7357c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 7366e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7377c306da505e2d7f64e160890b274a47fa0740962Chris Lattner SDNode *ResNode = Select(Node); 7386e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 73982dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // FIXME: This is pretty gross. 'Select' should be changed to not return 74082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // anything at all and this code should be nuked with a tactical strike. 7416e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7427c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If node should not be replaced, continue with the next one. 74382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ResNode == Node || Node->getOpcode() == ISD::DELETED_NODE) 7447c306da505e2d7f64e160890b274a47fa0740962Chris Lattner continue; 7457c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // Replace node. 7467c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (ResNode) 7477c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ReplaceUses(Node, ResNode); 7486e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7497c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // If after the replacement this node is not used any more, 7507c306da505e2d7f64e160890b274a47fa0740962Chris Lattner // remove this dead node. 7517c306da505e2d7f64e160890b274a47fa0740962Chris Lattner if (Node->use_empty()) { // Don't delete EntryToken, etc. 7527c306da505e2d7f64e160890b274a47fa0740962Chris Lattner ISelUpdater ISU(ISelPosition); 7537c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->RemoveDeadNode(Node, &ISU); 7547c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 7557c306da505e2d7f64e160890b274a47fa0740962Chris Lattner } 7566e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 7577c306da505e2d7f64e160890b274a47fa0740962Chris Lattner CurDAG->setRoot(Dummy.getValue()); 7586e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick } 75953f7602b61157ed56ccbf91379c188c55235f619Bill Wendling 7607c306da505e2d7f64e160890b274a47fa0740962Chris Lattner DEBUG(errs() << "===== Instruction selection ends:\n"); 7617c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7627c306da505e2d7f64e160890b274a47fa0740962Chris Lattner PostprocessISelDAG(); 7637c306da505e2d7f64e160890b274a47fa0740962Chris Lattner} 7647c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 7652520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// PrepareEHLandingPad - Emit an EH_LABEL, set up live-in registers, and 7662520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman/// do other setup for EH landing-pad blocks. 76784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohmanvoid SelectionDAGISel::PrepareEHLandingPad() { 7686f500541eac11413364f1d79320a2307079d3bbdBill Wendling MachineBasicBlock *MBB = FuncInfo->MBB; 7696f500541eac11413364f1d79320a2307079d3bbdBill Wendling 7702520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 7712520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 7726f500541eac11413364f1d79320a2307079d3bbdBill Wendling MCSymbol *Label = MF->getMMI().addLandingPad(MBB); 7732520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 77430e6740f2e3d518ce1cfcd484ef728ac5764a645Bill Wendling // Assign the call site to the landing pad's begin label. 77530e6740f2e3d518ce1cfcd484ef728ac5764a645Bill Wendling MF->getMMI().setCallSiteLandingPad(Label, SDB->LPadToCallSiteMap[MBB]); 776acddd4963d2f3b5fd94ab872b4fd393b34c80e5fAndrew Trick 777e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &II = TM.getInstrInfo()->get(TargetOpcode::EH_LABEL); 7786f500541eac11413364f1d79320a2307079d3bbdBill Wendling BuildMI(*MBB, FuncInfo->InsertPt, SDB->getCurDebugLoc(), II) 77984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman .addSym(Label); 7802520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7812520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception register as live in. 7820796134bde31f6d58d077f556fd08ca3734a9e6eLang Hames unsigned Reg = TLI.getExceptionPointerRegister(); 7836f500541eac11413364f1d79320a2307079d3bbdBill Wendling if (Reg) MBB->addLiveIn(Reg); 7842520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman 7852520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman // Mark exception selector register as live in. 7862520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 7876f500541eac11413364f1d79320a2307079d3bbdBill Wendling if (Reg) MBB->addLiveIn(Reg); 7882520864773dcb73d76d297605f4bc41c0cf3fa39Dan Gohman} 7897c306da505e2d7f64e160890b274a47fa0740962Chris Lattner 790b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// TryToFoldFastISelLoad - We're checking to see if we can fold the specified 791b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// load into the specified FoldInst. Note that we could have a sequence where 792b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// multiple LLVM IR instructions are folded into the same machineinstr. For 793b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// example we could have: 794b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// A: x = load i32 *P 795b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// B: y = icmp A, 42 796b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// C: br y, ... 797b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// 798b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// In this scenario, LI is "A", and FoldInst is "C". We know about "B" (and 799b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// any other folded instructions) because it is between A and C. 800b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// 801b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// If we succeed in folding the load into the operation, return true. 802b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner/// 803beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattnerbool SelectionDAGISel::TryToFoldFastISelLoad(const LoadInst *LI, 804b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner const Instruction *FoldInst, 805beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner FastISel *FastIS) { 806b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // We know that the load has a single use, but don't know what it is. If it 807b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // isn't one of the folded instructions, then we can't succeed here. Handle 808b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // this by scanning the single-use users of the load until we get to FoldInst. 809b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner unsigned MaxUsers = 6; // Don't scan down huge single-use chains of instrs. 8103af7a67629292840f0dbae8fad4e333b009e69ddAndrew Trick 811b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner const Instruction *TheUser = LI->use_back(); 812b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner while (TheUser != FoldInst && // Scan up until we find FoldInst. 813b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // Stay in the right block. 814b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner TheUser->getParent() == FoldInst->getParent() && 815b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner --MaxUsers) { // Don't scan too far. 816b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // If there are multiple or no uses of this instruction, then bail out. 817b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner if (!TheUser->hasOneUse()) 818b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner return false; 8193af7a67629292840f0dbae8fad4e333b009e69ddAndrew Trick 820b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner TheUser = TheUser->use_back(); 821b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner } 8223af7a67629292840f0dbae8fad4e333b009e69ddAndrew Trick 823f4ea68fa5a85d3e883cf35075133e64de4dfc046Chris Lattner // If we didn't find the fold instruction, then we failed to collapse the 824f4ea68fa5a85d3e883cf35075133e64de4dfc046Chris Lattner // sequence. 825f4ea68fa5a85d3e883cf35075133e64de4dfc046Chris Lattner if (TheUser != FoldInst) 826f4ea68fa5a85d3e883cf35075133e64de4dfc046Chris Lattner return false; 8273af7a67629292840f0dbae8fad4e333b009e69ddAndrew Trick 828beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // Don't try to fold volatile loads. Target has to deal with alignment 829beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // constraints. 830beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner if (LI->isVolatile()) return false; 8316e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 832b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // Figure out which vreg this is going into. If there is no assigned vreg yet 833b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // then there actually was no reference to it. Perhaps the load is referenced 834b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // by a dead instruction. 835beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner unsigned LoadReg = FastIS->getRegForValue(LI); 836b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner if (LoadReg == 0) 837b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner return false; 838beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner 839beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // Check to see what the uses of this vreg are. If it has no uses, or more 840beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // than one use (at the machine instr level) then we can't fold it. 841beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner MachineRegisterInfo::reg_iterator RI = RegInfo->reg_begin(LoadReg); 842beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner if (RI == RegInfo->reg_end()) 843beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner return false; 8446e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 845beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // See if there is exactly one use of the vreg. If there are multiple uses, 846beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // then the instruction got lowered to multiple machine instructions or the 847beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // use of the loaded value ended up being multiple operands of the result, in 848beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // either case, we can't fold this. 849beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner MachineRegisterInfo::reg_iterator PostRI = RI; ++PostRI; 850beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner if (PostRI != RegInfo->reg_end()) 851beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner return false; 8526e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 853beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner assert(RI.getOperand().isUse() && 854beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner "The only use of the vreg must be a use, we haven't emitted the def!"); 855beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner 856b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner MachineInstr *User = &*RI; 8579d40193d79052fb4ddd0f667f0fe47f07922c72aJim Grosbach 858b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner // Set the insertion point properly. Folding the load can cause generation of 859b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner // other random instructions (like sign extends) for addressing modes, make 860b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner // sure they get inserted in a logical place before the new instruction. 861b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner FuncInfo->InsertPt = User; 862b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner FuncInfo->MBB = User->getParent(); 863b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner 864beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner // Ask the target to try folding the load. 865b99fdee325fe677081dc27bb7d719518452f3256Chris Lattner return FastIS->TryToFoldLoad(User, RI.getOperandNo(), LI); 866beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner} 867beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner 8688bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner/// isFoldedOrDeadInstruction - Return true if the specified instruction is 8698bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner/// side-effect free and is either dead or folded into a generated instruction. 8708bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner/// Return false if it needs to be emitted. 8718bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattnerstatic bool isFoldedOrDeadInstruction(const Instruction *I, 8728bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner FunctionLoweringInfo *FuncInfo) { 873b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner return !I->mayWriteToMemory() && // Side-effecting instructions aren't folded. 874b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner !isa<TerminatorInst>(I) && // Terminators aren't folded. 875b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner !isa<DbgInfoIntrinsic>(I) && // Debug instructions aren't folded. 8764477d691ed9fa63f051986dcb98e358054c8281fBill Wendling !isa<LandingPadInst>(I) && // Landingpad instructions aren't folded. 877b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner !FuncInfo->isExportedInst(I); // Exported instrs must be computed. 8788bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner} 8798bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner 88073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#ifndef NDEBUG 8814bf76e0e28c2cc358e1106b64cad2fa59714df53Chad Rosier// Collect per Instruction statistics for fast-isel misses. Only those 8824bf76e0e28c2cc358e1106b64cad2fa59714df53Chad Rosier// instructions that cause the bail are accounted for. It does not account for 8834bf76e0e28c2cc358e1106b64cad2fa59714df53Chad Rosier// instructions higher in the block. Thus, summing the per instructions stats 8844bf76e0e28c2cc358e1106b64cad2fa59714df53Chad Rosier// will not add up to what is reported by NumFastIselFailures. 88573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosierstatic void collectFailStats(const Instruction *I) { 88673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier switch (I->getOpcode()) { 88773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier default: assert (0 && "<Invalid operator> "); 88873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 88973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Terminators 89073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Ret: NumFastIselFailRet++; return; 89173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Br: NumFastIselFailBr++; return; 89273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Switch: NumFastIselFailSwitch++; return; 89373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::IndirectBr: NumFastIselFailIndirectBr++; return; 89473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Invoke: NumFastIselFailInvoke++; return; 89573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Resume: NumFastIselFailResume++; return; 89673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Unreachable: NumFastIselFailUnreachable++; return; 89773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 89873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Standard binary operators... 89973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Add: NumFastIselFailAdd++; return; 90073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FAdd: NumFastIselFailFAdd++; return; 90173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Sub: NumFastIselFailSub++; return; 90273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FSub: NumFastIselFailFSub++; return; 90373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Mul: NumFastIselFailMul++; return; 90473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FMul: NumFastIselFailFMul++; return; 90573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::UDiv: NumFastIselFailUDiv++; return; 90673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::SDiv: NumFastIselFailSDiv++; return; 90773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FDiv: NumFastIselFailFDiv++; return; 90873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::URem: NumFastIselFailURem++; return; 90973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::SRem: NumFastIselFailSRem++; return; 91073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FRem: NumFastIselFailFRem++; return; 91173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 91273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Logical operators... 91373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::And: NumFastIselFailAnd++; return; 91473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Or: NumFastIselFailOr++; return; 91573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Xor: NumFastIselFailXor++; return; 91673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 91773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Memory instructions... 91873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Alloca: NumFastIselFailAlloca++; return; 91973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Load: NumFastIselFailLoad++; return; 92073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Store: NumFastIselFailStore++; return; 92173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::AtomicCmpXchg: NumFastIselFailAtomicCmpXchg++; return; 92273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::AtomicRMW: NumFastIselFailAtomicRMW++; return; 92373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Fence: NumFastIselFailFence++; return; 92473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::GetElementPtr: NumFastIselFailGetElementPtr++; return; 92573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 92673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Convert instructions... 92773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Trunc: NumFastIselFailTrunc++; return; 92873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ZExt: NumFastIselFailZExt++; return; 92973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::SExt: NumFastIselFailSExt++; return; 93073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FPTrunc: NumFastIselFailFPTrunc++; return; 93173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FPExt: NumFastIselFailFPExt++; return; 93273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FPToUI: NumFastIselFailFPToUI++; return; 93373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FPToSI: NumFastIselFailFPToSI++; return; 93473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::UIToFP: NumFastIselFailUIToFP++; return; 93573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::SIToFP: NumFastIselFailSIToFP++; return; 936acddd4963d2f3b5fd94ab872b4fd393b34c80e5fAndrew Trick case Instruction::IntToPtr: NumFastIselFailIntToPtr++; return; 93773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::PtrToInt: NumFastIselFailPtrToInt++; return; 938acddd4963d2f3b5fd94ab872b4fd393b34c80e5fAndrew Trick case Instruction::BitCast: NumFastIselFailBitCast++; return; 93973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 94073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier // Other instructions... 94173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ICmp: NumFastIselFailICmp++; return; 94273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::FCmp: NumFastIselFailFCmp++; return; 94373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::PHI: NumFastIselFailPHI++; return; 94473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Select: NumFastIselFailSelect++; return; 94573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Call: NumFastIselFailCall++; return; 94673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::Shl: NumFastIselFailShl++; return; 94773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::LShr: NumFastIselFailLShr++; return; 94873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::AShr: NumFastIselFailAShr++; return; 94973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::VAArg: NumFastIselFailVAArg++; return; 95073e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ExtractElement: NumFastIselFailExtractElement++; return; 95173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::InsertElement: NumFastIselFailInsertElement++; return; 95273e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ShuffleVector: NumFastIselFailShuffleVector++; return; 95373e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::ExtractValue: NumFastIselFailExtractValue++; return; 95473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::InsertValue: NumFastIselFailInsertValue++; return; 95573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier case Instruction::LandingPad: NumFastIselFailLandingPad++; return; 95673e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier } 95773e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier} 95873e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#endif 95973e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 96046510a73e977273ec67747eb34cbdb43f815e451Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(const Function &Fn) { 961a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Initialize the Fast-ISel state, if needed. 962a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman FastISel *FastIS = 0; 9638a8d479214745c82ef00f08d4e4f1c173b5f9ce2Nick Lewycky if (TM.Options.EnableFastISel) 964a4160c3434b08288d1f79f1acbe453d1b9610b22Dan Gohman FastIS = TLI.createFastISel(*FuncInfo); 965a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 966a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Iterate over all basic blocks in the function. 9672dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich ReversePostOrderTraversal<const Function*> RPOT(&Fn); 9682dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich for (ReversePostOrderTraversal<const Function*>::rpo_iterator 9692dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich I = RPOT.begin(), E = RPOT.end(); I != E; ++I) { 9702dbe2850d019d3d25ec760f34de70ef6c9ac5747Cameron Zwarich const BasicBlock *LLVMBB = *I; 971a46cd97818ac6fa336b093adecf2006fb041ca1cCameron Zwarich 972324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich if (OptLevel != CodeGenOpt::None) { 973324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich bool AllPredsVisited = true; 974324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich for (const_pred_iterator PI = pred_begin(LLVMBB), PE = pred_end(LLVMBB); 975324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich PI != PE; ++PI) { 976324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich if (!FuncInfo->VisitedBBs.count(*PI)) { 977324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich AllPredsVisited = false; 978324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich break; 979324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich } 980324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich } 981324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich 9828ca814c4e0a39e1fcac023f0fb014917da07a796Cameron Zwarich if (AllPredsVisited) { 9838bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner for (BasicBlock::const_iterator I = LLVMBB->begin(); 9848bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner isa<PHINode>(I); ++I) 9858ca814c4e0a39e1fcac023f0fb014917da07a796Cameron Zwarich FuncInfo->ComputePHILiveOutRegInfo(cast<PHINode>(I)); 9868ca814c4e0a39e1fcac023f0fb014917da07a796Cameron Zwarich } else { 9878bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner for (BasicBlock::const_iterator I = LLVMBB->begin(); 9888bdc251dc5392fdf4854dcf588d73927d6ef64b3Chris Lattner isa<PHINode>(I); ++I) 989324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich FuncInfo->InvalidatePHILiveOutRegInfo(cast<PHINode>(I)); 990324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich } 991324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich 992a46cd97818ac6fa336b093adecf2006fb041ca1cCameron Zwarich FuncInfo->VisitedBBs.insert(LLVMBB); 993324a24f6aa5d6752c57c39e1e19f00b8c8a4ceecCameron Zwarich } 994a46cd97818ac6fa336b093adecf2006fb041ca1cCameron Zwarich 99584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = FuncInfo->MBBMap[LLVMBB]; 99684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI(); 997f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 998ba5be5c07bb19dcf484e3aa40cd139dd07c10407Dan Gohman BasicBlock::const_iterator const Begin = LLVMBB->getFirstNonPHI(); 99946510a73e977273ec67747eb34cbdb43f815e451Dan Gohman BasicBlock::const_iterator const End = LLVMBB->end(); 100084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman BasicBlock::const_iterator BI = End; 10015edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 100284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->getFirstNonPHI(); 100384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 100484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Setup an EH landing-pad block. 100584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isLandingPad()) 100684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PrepareEHLandingPad(); 10076e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1008f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // Lower any arguments needed in this block if this is the entry block. 100968e6beeccc0b9ac2e8d3687a8a5b7d4b172edca1Devang Patel if (LLVMBB == &Fn.getEntryBlock()) 1010f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman LowerArguments(LLVMBB); 1011f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman 1012f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 1013d725f04ff81db0e61baa153bf21ca2dd08838244Dan Gohman if (FastIS) { 101484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->startNewBlock(); 101584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 1016f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // Emit code for any incoming arguments. This must happen before 1017f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman // beginning FastISel on the entry block. 1018f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 1019f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman CurDAG->setRoot(SDB->getControlRoot()); 1020f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman SDB->clear(); 102184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 102284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 102384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If we inserted any instructions at the beginning, make a note of 102484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // where they are, so we can be sure to emit subsequent instructions 102584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // after them. 102684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->InsertPt != FuncInfo->MBB->begin()) 102784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->setLastLocalValue(llvm::prior(FuncInfo->InsertPt)); 102884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman else 102984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->setLastLocalValue(0); 1030f59514152511694d46ca8b8d2db466d256ab5759Dan Gohman } 103184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 1032f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier unsigned NumFastIselRemaining = std::distance(Begin, End); 1033a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Do FastISel on as many instructions as possible. 103484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (; BI != Begin; --BI) { 103584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman const Instruction *Inst = llvm::prior(BI); 103684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 103784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // If we no longer require this instruction, skip it. 1038f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier if (isFoldedOrDeadInstruction(Inst, FuncInfo)) { 1039f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier --NumFastIselRemaining; 104020d4be151b54feb18aa1e5cc04033a4aa64137aeDan Gohman continue; 1041f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier } 104284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 104384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // Bottom-up: reset the insert pos at the top, after any local-value 104484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // instructions. 104584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->recomputeInsertPt(); 104620d4be151b54feb18aa1e5cc04033a4aa64137aeDan Gohman 104721c14e3649b3e2a70ac36ebb148f17648f10a2a9Dan Gohman // Try to select the instruction with FastISel. 1048beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner if (FastIS->SelectInstruction(Inst)) { 1049f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier --NumFastIselRemaining; 105062427ae8d311d3dda8f5257ddf34d13c19c214bbJim Grosbach ++NumFastIselSuccess; 1051b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // If fast isel succeeded, skip over all the folded instructions, and 1052b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // then see if there is a load right before the selected instructions. 1053b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // Try to fold the load if so. 1054b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner const Instruction *BeforeInst = Inst; 1055b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner while (BeforeInst != Begin) { 1056b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner BeforeInst = llvm::prior(BasicBlock::const_iterator(BeforeInst)); 1057b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner if (!isFoldedOrDeadInstruction(BeforeInst, FuncInfo)) 1058b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner break; 1059b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner } 1060b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner if (BeforeInst != Inst && isa<LoadInst>(BeforeInst) && 1061b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner BeforeInst->hasOneUse() && 1062f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier TryToFoldFastISelLoad(cast<LoadInst>(BeforeInst), Inst, FastIS)) { 1063b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner // If we succeeded, don't re-select the load. 1064b686af053e6544191420978f6a3adc7e74ab0192Chris Lattner BI = llvm::next(BasicBlock::const_iterator(BeforeInst)); 1065f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier --NumFastIselRemaining; 1066f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier ++NumFastIselSuccess; 1067f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier } 1068a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 1069beac75da3784929aee9f0357fc5cd76d49d6c3d7Chris Lattner } 1070f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 107173e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#ifndef NDEBUG 1072f2a745efe50dfd57f0e83e5f3ed964611cba6077Chad Rosier if (EnableFastISelVerbose2) 1073f2a745efe50dfd57f0e83e5f3ed964611cba6077Chad Rosier collectFailStats(Inst); 107473e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier#endif 107573e08d3507d9ca22d89886a7d7e1e4e9278bee98Chad Rosier 1076a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // Then handle certain instructions as single-LLVM-Instruction blocks. 107784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (isa<CallInst>(Inst)) { 1078f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier 1079a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 10801a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel missed call: "; 108184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Inst->dump(); 1082f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1083f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 108484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (!Inst->getType()->isVoidTy() && !Inst->use_empty()) { 108584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman unsigned &R = FuncInfo->ValueMap[Inst]; 1086a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (!R) 108784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman R = FuncInfo->CreateRegs(Inst->getType()); 1088f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1089a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 1090b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman bool HadTailCall = false; 1091df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel SelectBasicBlock(Inst, BI, HadTailCall); 1092b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 1093f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier // Recompute NumFastIselRemaining as Selection DAG instruction 1094f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier // selection may have handled the call, input args, etc. 1095f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier unsigned RemainingNow = std::distance(Begin, BI); 1096f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier NumFastIselFailures += NumFastIselRemaining - RemainingNow; 1097f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier 1098b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman // If the call was emitted as a tail call, we're done with the block. 1099b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman if (HadTailCall) { 110084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman --BI; 1101b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman break; 1102b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman } 1103b4afb137efbc38462707bab9f5e8bc5c2d07cd2dDan Gohman 1104f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier NumFastIselRemaining = RemainingNow; 1105a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman continue; 1106f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1107a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 11089c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman if (isa<TerminatorInst>(Inst) && !isa<BranchInst>(Inst)) { 11099c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman // Don't abort, and use a different message for terminator misses. 1110f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier NumFastIselFailures += NumFastIselRemaining; 11119c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman if (EnableFastISelVerbose || EnableFastISelAbort) { 11129c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman dbgs() << "FastISel missed terminator: "; 11139c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman Inst->dump(); 11149c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman } 11159c4dae6b0bd1b4667b7a6ce5d804f60615bac639Eli Friedman } else { 1116f91488cc1027267fa21665818d3c90bb8b2a25ceChad Rosier NumFastIselFailures += NumFastIselRemaining; 1117a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelVerbose || EnableFastISelAbort) { 11181a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "FastISel miss: "; 111984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Inst->dump(); 1120a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 1121a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman if (EnableFastISelAbort) 1122a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // The "fast" selector couldn't handle something and bailed. 1123a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman // For the purpose of debugging, just abort. 1124c23197a26f34f559ea9797de51e187087c039c42Torok Edwin llvm_unreachable("FastISel didn't select the entire block"); 1125a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman } 1126a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman break; 1127f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 112884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman 112984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FastIS->recomputeInsertPt(); 1130f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 1131f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 1132df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel if (Begin != BI) 1133df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel ++NumDAGBlocks; 1134df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel else 1135df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel ++NumFastIselBlocks; 1136df8370bd70c228036f887a3f500ad3e79bc657b9Devang Patel 113737d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman if (Begin != BI) { 113837d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman // Run SelectionDAG instruction selection on the remainder of the block 113937d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman // not handled by FastISel. If FastISel is not run, this is the entire 114037d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman // block. 114137d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman bool HadTailCall; 114237d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman SelectBasicBlock(Begin, BI, HadTailCall); 114337d38bfbbf2b8db2c75b2edbd8cd30c51746fd5dEli Friedman } 1144381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 114584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FinishBasicBlock(); 1146620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman FuncInfo->PHINodesToUpdate.clear(); 114739fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 1148a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman 1149a43abd102f123f6d3bd9ad92045f8119e3fb6153Dan Gohman delete FastIS; 1150233857537f61a8f4ab93624986676c25b2271bc7Devang Patel SDB->clearDanglingDebugInfo(); 11510e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 11520e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 1153fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 115484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan GohmanSelectionDAGISel::FinishBasicBlock() { 11551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 11561a053236f165ac60ee88edca370a732d278aa2c1David Greene DEBUG(dbgs() << "Total amount of phi nodes to update: " 1157927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman << FuncInfo->PHINodesToUpdate.size() << "\n"; 1158927f866105fa29feb32c050ee823d60c2509ec76Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) 11591a053236f165ac60ee88edca370a732d278aa2c1David Greene dbgs() << "Node " << i << " : (" 1160620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << FuncInfo->PHINodesToUpdate[i].first 1161620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman << ", " << FuncInfo->PHINodesToUpdate[i].second << ")\n"); 1162a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1163a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 11641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 11652048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (SDB->SwitchCases.empty() && 11662048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.empty() && 11672048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.empty()) { 1168620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 1169620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 1170518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 1171f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 117284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (!FuncInfo->MBB->isSuccessor(PHI->getParent())) 1173580bba2b0dd2173c899699a87e109bfd1482c001Jakob Stoklund Olesen continue; 1174620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 1175620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 117684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 1177f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1178f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 11791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 11804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11812048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->BitTestCases.size(); i != e; ++i) { 11824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 11832048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->BitTestCases[i].Emitted) { 11844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 118584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->BitTestCases[i].Parent; 118684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 11874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 118884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman SDB->visitBitTestHeader(SDB->BitTestCases[i], FuncInfo->MBB); 11892048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 11902048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 119184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 1192a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar } 11934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 11942048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); j != ej; ++j) { 11954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 119684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->BitTestCases[i].Cases[j].ThisBB; 119784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 11984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 11994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 1200d08e5b48bc5d9177b1d70a1980a7805420a99085Evan Cheng SDB->visitBitTestCase(SDB->BitTestCases[i], 1201d08e5b48bc5d9177b1d70a1980a7805420a99085Evan Cheng SDB->BitTestCases[i].Cases[j+1].ThisBB, 12022048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 120399be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 120484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 12054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 1206d08e5b48bc5d9177b1d70a1980a7805420a99085Evan Cheng SDB->visitBitTestCase(SDB->BitTestCases[i], 1207d08e5b48bc5d9177b1d70a1980a7805420a99085Evan Cheng SDB->BitTestCases[i].Default, 12082048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases[i].Reg, 120999be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->BitTestCases[i].Cases[j], 121084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 1211a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1212a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 12132048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 12142048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 121584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 12164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 1219620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 1220620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 1221620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 12224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 1223518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 12244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 12254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 12264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 12272048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->BitTestCases[i].Default) { 1228f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1229620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1230620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 12312048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Parent)); 1232f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1233620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1234620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 12352048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDB->BitTestCases[i].Cases. 12369ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 12374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 12392048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned j = 0, ej = SDB->BitTestCases[i].Cases.size(); 12407c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 12412048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman MachineBasicBlock* cBB = SDB->BitTestCases[i].Cases[j].ThisBB; 1242dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen if (cBB->isSuccessor(PHIBB)) { 1243f4549b02a7d9907d06e7fb8afefd129452d1f7c5Jim Grosbach PHI->addOperand(MachineOperand:: 1244620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1245620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 12469ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 12474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 12512048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->BitTestCases.clear(); 12524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 12539453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 12549453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 12559453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 12562048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->JTCases.size(); i != e; ++i) { 12573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 12582048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (!SDB->JTCases[i].first.Emitted) { 12593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 126084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->JTCases[i].first.HeaderBB; 126184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 12623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 126399be8ae3898d87373ef0c8f1159b287e28a8d81bDan Gohman SDB->visitJumpTableHeader(SDB->JTCases[i].second, SDB->JTCases[i].first, 126484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB); 12652048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 12662048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 126784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 12684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 1269a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 127037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 127184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = SDB->JTCases[i].second.MBB; 127284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 127337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 12742048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->visitJumpTable(SDB->JTCases[i].second); 12752048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 12762048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->clear(); 127784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 1278a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 127937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 1280620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned pi = 0, pe = FuncInfo->PHINodesToUpdate.size(); 1281620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman pi != pe; ++pi) { 1282620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[pi].first; 128337efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 1284518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 128537efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 12864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 12872048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman if (PHIBB == SDB->JTCases[i].second.Default) { 1288ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 1289620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1290620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 1291ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 12922048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman (MachineOperand::CreateMBB(SDB->JTCases[i].first.HeaderBB)); 1293f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 12944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 129584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isSuccessor(PHIBB)) { 1296ce31910eae5bd4896fa6c27798e7b26885691d3bEvan Cheng PHI->addOperand 1297620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman (MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[pi].second, 1298620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman false)); 129984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 130037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 130137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 130237efe6764568a3829fee26aba532283131d1a104Nate Begeman } 13032048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->JTCases.clear(); 1304a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1305b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 1306b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 1307620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman for (unsigned i = 0, e = FuncInfo->PHINodesToUpdate.size(); i != e; ++i) { 1308620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineInstr *PHI = FuncInfo->PHINodesToUpdate[i].first; 1309518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner assert(PHI->isPHI() && 1310b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 131184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (FuncInfo->MBB->isSuccessor(PHI->getParent())) { 1312620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman PHI->addOperand( 1313620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman MachineOperand::CreateReg(FuncInfo->PHINodesToUpdate[i].second, false)); 131484023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(FuncInfo->MBB)); 1315b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1316b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 1317a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1318f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 1319f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 13202048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman for (unsigned i = 0, e = SDB->SwitchCases.size(); i != e; ++i) { 1321f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 1322ca5f61676956cff088c225c3c166a589410b3101Dan Gohman FuncInfo->MBB = SDB->SwitchCases[i].ThisBB; 132384023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 1324a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 132595140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman // Determine the unique successors. 132695140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman SmallVector<MachineBasicBlock *, 2> Succs; 132795140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman Succs.push_back(SDB->SwitchCases[i].TrueBB); 132895140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman if (SDB->SwitchCases[i].TrueBB != SDB->SwitchCases[i].FalseBB) 132995140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman Succs.push_back(SDB->SwitchCases[i].FalseBB); 133095140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman 1331ca5f61676956cff088c225c3c166a589410b3101Dan Gohman // Emit the code. Note that this could result in FuncInfo->MBB being split. 133284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman SDB->visitSwitchCase(SDB->SwitchCases[i], FuncInfo->MBB); 13332048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman CurDAG->setRoot(SDB->getRoot()); 133495140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman SDB->clear(); 133584023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman CodeGenAndEmitDAG(); 1336ca5f61676956cff088c225c3c166a589410b3101Dan Gohman 1337ca5f61676956cff088c225c3c166a589410b3101Dan Gohman // Remember the last block, now that any splitting is done, for use in 1338ca5f61676956cff088c225c3c166a589410b3101Dan Gohman // populating PHI nodes in successors. 1339ca5f61676956cff088c225c3c166a589410b3101Dan Gohman MachineBasicBlock *ThisBB = FuncInfo->MBB; 1340a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1341d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 1342d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 1343d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 1344d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 134595140a4cc168bb75a54a434e3e53f9060742dc41Dan Gohman for (unsigned i = 0, e = Succs.size(); i != e; ++i) { 134684023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->MBB = Succs[i]; 134784023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman FuncInfo->InsertPt = FuncInfo->MBB->end(); 134884023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // FuncInfo->MBB may have been removed from the CFG if a branch was 134984023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman // constant folded. 135084023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman if (ThisBB->isSuccessor(FuncInfo->MBB)) { 135184023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman for (MachineBasicBlock::iterator Phi = FuncInfo->MBB->begin(); 135284023e0fbefc406a4c611d3d64a10df5d3a97dd7Dan Gohman Phi != FuncInfo->MBB->end() && Phi->isPHI(); 1353dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen ++Phi) { 1354dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen // This value for this PHI node is recorded in PHINodesToUpdate. 1355dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen for (unsigned pn = 0; ; ++pn) { 1356620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman assert(pn != FuncInfo->PHINodesToUpdate.size() && 1357dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen "Didn't find PHI entry!"); 1358620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman if (FuncInfo->PHINodesToUpdate[pn].first == Phi) { 1359dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand:: 1360620427d5a165d98d33ad6a5be2d01c3e8525c2f6Dan Gohman CreateReg(FuncInfo->PHINodesToUpdate[pn].second, 1361dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen false)); 1362dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen Phi->addOperand(MachineOperand::CreateMBB(ThisBB)); 1363dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen break; 1364dd437ba15e00d1a137e0c6e3ca1ff213ed6a2aa0Jakob Stoklund Olesen } 13658be58a11868ae081c195c107cd39a07f1f523877Evan Cheng } 1366d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 1367f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1369a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 13702048b85c7c2c987874b9423e682ec8e60b60574bDan Gohman SDB->SwitchCases.clear(); 13711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 1372a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 137313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 13740a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// Create the scheduler. If a specific scheduler was specified 13750a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// via the SchedulerRegistry, use it, otherwise select the 13760a3776dc6f702d4e3f4a189df7f43d8f99957773Dan Gohman/// one preferred by the target. 13775e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 137847ac0f0c7c39289f5970688154e385be22b7f293Dan GohmanScheduleDAGSDNodes *SelectionDAGISel::CreateScheduler() { 1379eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 1380a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 138113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 1382eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 13839373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 13844ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 1385a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1386be8cc2a3dedeb7685f07e68cdc4b9502eb97eb2bBill Wendling return Ctor(this, OptLevel); 1387a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 13880e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1389755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1390755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 1391755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 1392755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 1393755480681c795d585c73556c028b6143c46bda86Chris Lattner 1394755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 1395755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1396755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 1397755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1398a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 1399dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 14002e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 14012e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1402a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1403755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1404755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1405755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1406a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1407755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 14082e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1409755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1410a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1411755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1412755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 14132e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1414ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 1415755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1416a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1417755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1418755480681c795d585c73556c028b6143c46bda86Chris Lattner 1419755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1420755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1421755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1422755480681c795d585c73556c028b6143c46bda86Chris Lattner 1423755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 1424755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 1425755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 1426755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 1427a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbarbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 14282e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 14292e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 14302e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 1431a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1432755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 1433755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 1434755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1435a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1436755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 14372e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 1438755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1439a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1440755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 1441755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 14422e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 1443a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 14442e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 144526c8dcc692fb2addd475446cfff24d6a4e958bcaRafael Espindola CurDAG->ComputeMaskedBits(LHS, KnownZero, KnownOne); 1446a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1447755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 1448755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 1449755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 1450a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1451755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 1452a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1453755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 1454755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 1455755480681c795d585c73556c028b6143c46bda86Chris Lattner} 1456755480681c795d585c73556c028b6143c46bda86Chris Lattner 14579ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 14580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 14590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 14600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 1461f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 1462475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 14630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 14640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1465decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_InputChain]); // 0 1466decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_AsmString]); // 1 1467decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(InOps[InlineAsm::Op_MDNode]); // 2, !srcloc 1468c36b7069b42bece963b7e6adf020353ce990ef76Evan Cheng Ops.push_back(InOps[InlineAsm::Op_ExtraInfo]); // 3 (SideEffect, AlignStack) 14690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 1470decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned i = InlineAsm::Op_FirstOperand, e = InOps.size(); 1471f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (InOps[e-1].getValueType() == MVT::Glue) 1472a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner --e; // Don't process a glue operand if it is here. 1473a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 14740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 1475f5aeb1a8e4cf272c7348376d185ef8d8267653e0Dan Gohman unsigned Flags = cast<ConstantSDNode>(InOps[i])->getZExtValue(); 1476decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (!InlineAsm::isMemKind(Flags)) { 14770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 1478697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng Ops.insert(Ops.end(), InOps.begin()+i, 1479697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng InOps.begin()+i+InlineAsm::getNumOperandRegisters(Flags) + 1); 1480697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng i += InlineAsm::getNumOperandRegisters(Flags) + 1; 14810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 1482697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng assert(InlineAsm::getNumOperandRegisters(Flags) == 1 && 1483697cbbfb00c318f98d6eb51945f077e2bfe8781eEvan Cheng "Memory operand with multiple values?"); 14840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 1485475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 1486decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) 148775361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error("Could not match memory address. Inline asm" 148887d677c1856bfdcb91d9daeb69dc5f261c73851eChris Lattner " failure!"); 1489a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 14900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 1491decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner unsigned NewFlags = 1492decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner InlineAsm::getFlagWord(InlineAsm::Kind_Mem, SelOps.size()); 1493decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner Ops.push_back(CurDAG->getTargetConstant(NewFlags, MVT::i32)); 14940e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 14950e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 14960e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 14970e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 1498a279bc3da55691784064cb47200a1c584408b8abDaniel Dunbar 1499a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Add the glue input back if present. 15000e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 15010e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 15020e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 1503794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 1504a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner/// findGlueUse - Return use of MVT::Glue value produced by the specified 1505c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// SDNode. 1506c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// 1507a4359be0328a91971c486b06892c742de1fa0f2bChris Lattnerstatic SDNode *findGlueUse(SDNode *N) { 1508c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov unsigned FlagResNo = N->getNumValues()-1; 1509c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) { 1510c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDUse &Use = I.getUse(); 1511c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use.getResNo() == FlagResNo) 1512c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return Use.getUser(); 1513c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1514c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return NULL; 1515c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1516c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1517c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// findNonImmUse - Return true if "Use" is a non-immediate use of "Def". 1518c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// This function recursively traverses up the operand chain, ignoring 1519c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov/// certain nodes. 1520c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikovstatic bool findNonImmUse(SDNode *Use, SDNode* Def, SDNode *ImmedUse, 1521d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner SDNode *Root, SmallPtrSet<SDNode*, 16> &Visited, 1522d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner bool IgnoreChains) { 1523da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The NodeID's are given uniques ID's where a node ID is guaranteed to be 1524da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // greater than all of its (recursive) operands. If we scan to a point where 1525da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 'use' is smaller than the node we're scanning for, then we know we will 1526da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // never find it. 1527da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // 1528da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // The Use may be -1 (unassigned) if it is a newly allocated node. This can 1529a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // happen because we scan down to newly selected nodes in the case of glue 1530da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // uses. 1531da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if ((Use->getNodeId() < Def->getNodeId() && Use->getNodeId() != -1)) 1532da244a091dcde022ea4938793d81ee957903ed70Chris Lattner return false; 15336e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1534da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // Don't revisit nodes if we already scanned it and didn't fail, we know we 1535da244a091dcde022ea4938793d81ee957903ed70Chris Lattner // won't fail if we scan it again. 1536da244a091dcde022ea4938793d81ee957903ed70Chris Lattner if (!Visited.insert(Use)) 1537c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1538c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1539c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov for (unsigned i = 0, e = Use->getNumOperands(); i != e; ++i) { 1540d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Ignore chain uses, they are validated by HandleMergeInputChains. 1541d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (Use->getOperand(i).getValueType() == MVT::Other && IgnoreChains) 1542d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 15436e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1544c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov SDNode *N = Use->getOperand(i).getNode(); 1545c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (N == Def) { 1546c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (Use == ImmedUse || Use == Root) 1547c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov continue; // We are not looking for immediate use. 1548c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov assert(N != Root); 1549c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1550c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1551c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1552c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // Traverse up the operand chain. 1553d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (findNonImmUse(N, Def, ImmedUse, Root, Visited, IgnoreChains)) 1554c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return true; 1555c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 1556c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov return false; 1557c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1558c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1559014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsProfitableToFold - Returns true if it's profitable to fold the specific 1560014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// operand node N of U during instruction selection that starts at Root. 1561014bf215c3457bb34fee348265e8f63a70b4d503Evan Chengbool SelectionDAGISel::IsProfitableToFold(SDValue N, SDNode *U, 1562014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng SDNode *Root) const { 1563014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng if (OptLevel == CodeGenOpt::None) return false; 1564014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng return N.hasOneUse(); 1565014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng} 1566014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng 1567014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// IsLegalToFold - Returns true if the specific operand node N of 1568014bf215c3457bb34fee348265e8f63a70b4d503Evan Cheng/// U can be folded during instruction selection that starts at Root. 1569d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattnerbool SelectionDAGISel::IsLegalToFold(SDValue N, SDNode *U, SDNode *Root, 1570d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman CodeGenOpt::Level OptLevel, 1571d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman bool IgnoreChains) { 1572c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov if (OptLevel == CodeGenOpt::None) return false; 1573c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1574c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // If Root use can somehow reach N through a path that that doesn't contain 1575c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // U then folding N would create a cycle. e.g. In the following 1576c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // diagram, Root can reach N through X. If N is folded into into Root, then 1577c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // X is both a predecessor and a successor of U. 1578c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1579c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1580c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1581c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1582c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1583c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1584c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1585c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ / // 1586c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] // 1587c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1588c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // * indicates nodes to be folded together. 1589c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1590a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If Root produces glue, then it gets (even more) interesting. Since it 1591a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // will be "glued" together with its glue use in the scheduler, we need to 1592c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // check if it might reach N. 1593c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1594c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [N*] // 1595c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1596c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // / \ // 1597c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [U*] [X]? // 1598c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ ^ // 1599c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ \ // 1600c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // \ | // 1601c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Root*] | // 1602c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ | // 1603c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f | // 1604c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1605c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // [Y] / // 1606c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // ^ / // 1607c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // f / // 1608c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // | / // 1609a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // [GU] // 1610c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // 1611a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If GU (glue use) indirectly reaches N (the load), and Root folds N 1612a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // (call it Fold), then X is a predecessor of GU and a successor of 1613a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Fold. But since Fold and GU are glued together, this will create 1614c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov // a cycle in the scheduling graph. 1615c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1616a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the node has glue, walk down the graph to the "lowest" node in the 1617a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // glueged set. 1618e50ed30282bb5b4a9ed952580523f2dda16215acOwen Anderson EVT VT = Root->getValueType(Root->getNumValues()-1); 1619f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner while (VT == MVT::Glue) { 1620a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDNode *GU = findGlueUse(Root); 1621a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (GU == NULL) 1622c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov break; 1623a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner Root = GU; 1624c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov VT = Root->getValueType(Root->getNumValues()-1); 16256e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1626a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If our query node has a glue result with a use, we've walked up it. If 162718fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the user (which has already been selected) has a chain or indirectly uses 162818fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // the chain, our WalkChainUsers predicate will not consider it. Because of 162918fdabadca110671b436de52fe7bd492ad49e656Chris Lattner // this, we cannot ignore chains in this predicate. 163018fdabadca110671b436de52fe7bd492ad49e656Chris Lattner IgnoreChains = false; 1631c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov } 16326e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1633c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 16349bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner SmallPtrSet<SDNode*, 16> Visited; 16359bbcd5ee5b9a34f82d7d0570256ff4b4f53fabe9Chris Lattner return !findNonImmUse(Root, N.getNode(), U, Root, Visited, IgnoreChains); 1636c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov} 1637c1c6ef8f74fc550f29cfec1f2fb699dd8c2fb94eAnton Korobeynikov 1638eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_INLINEASM(SDNode *N) { 1639eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman std::vector<SDValue> Ops(N->op_begin(), N->op_end()); 1640e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman SelectInlineAsmMemoryOperands(Ops); 16416e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1642e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::vector<EVT> VTs; 1643e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs.push_back(MVT::Other); 1644f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner VTs.push_back(MVT::Glue); 1645eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohman SDValue New = CurDAG->getNode(ISD::INLINEASM, N->getDebugLoc(), 1646e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman VTs, &Ops[0], Ops.size()); 1647d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner New->setNodeId(-1); 1648e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman return New.getNode(); 1649e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1650e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 1651eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan GohmanSDNode *SelectionDAGISel::Select_UNDEF(SDNode *N) { 1652518bb53485df640d7b7e3f6b0544099020c42aa7Chris Lattner return CurDAG->SelectNodeTo(N, TargetOpcode::IMPLICIT_DEF,N->getValueType(0)); 1653e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 1654e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 16552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner/// GetVBR - decode a vbr encoding whose top bit is set. 165619e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static uint64_t 16572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerGetVBR(uint64_t Val, const unsigned char *MatcherTable, unsigned &Idx) { 16582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(Val >= 128 && "Not a VBR"); 16592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val &= 127; // Remove first vbr bit. 16606e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 16612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned Shift = 7; 16622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner uint64_t NextBits; 16632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner do { 166414df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner NextBits = MatcherTable[Idx++]; 16652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val |= (NextBits&127) << Shift; 16662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Shift += 7; 16672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } while (NextBits & 128); 16686e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 16692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return Val; 16702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 16712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 16722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1673a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner/// UpdateChainsAndGlue - When a match is complete, this method updates uses of 1674a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner/// interior glue and chain results to use the new glue and chain results. 167582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattnervoid SelectionDAGISel:: 1676a4359be0328a91971c486b06892c742de1fa0f2bChris LattnerUpdateChainsAndGlue(SDNode *NodeToMatch, SDValue InputChain, 1677a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner const SmallVectorImpl<SDNode*> &ChainNodesMatched, 1678a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDValue InputGlue, 1679a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner const SmallVectorImpl<SDNode*> &GlueResultNodesMatched, 1680a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner bool isMorphNodeTo) { 168182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner SmallVector<SDNode*, 4> NowDeadNodes; 16826e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 168382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner ISelUpdater ISU(ISelPosition); 168482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner 16852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Now that all the normal results are replaced, we replace the chain and 1686a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // glue results if present. 16872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!ChainNodesMatched.empty()) { 16882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() != 0 && 16892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Matched input chains but didn't produce a chain"); 16902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Loop over all of the nodes we matched that produced a chain result. 16912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Replace all the chain results with the final chain we ended up with. 16922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 16932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *ChainNode = ChainNodesMatched[i]; 16946e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 169582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 169682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (ChainNode->getOpcode() == ISD::DELETED_NODE) 169782dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 16986e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 16992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Don't replace the results of the root node if we're doing a 17002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MorphNodeTo. 17012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNode == NodeToMatch && isMorphNodeTo) 17022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 17036e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 17042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue ChainVal = SDValue(ChainNode, ChainNode->getNumValues()-1); 1705f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (ChainVal.getValueType() == MVT::Glue) 17062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainVal = ChainVal.getValue(ChainVal->getNumValues()-2); 17072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainVal.getValueType() == MVT::Other && "Not a chain?"); 170882dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(ChainVal, InputChain, &ISU); 17096e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1710856fb395e46a8d485081acbf11928047d852c636Chris Lattner // If the node became dead and we haven't already seen it, delete it. 1711856fb395e46a8d485081acbf11928047d852c636Chris Lattner if (ChainNode->use_empty() && 1712856fb395e46a8d485081acbf11928047d852c636Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), ChainNode)) 171382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(ChainNode); 17142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 17152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 17166e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1717a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the result produces glue, update any glue results in the matched 1718a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // pattern with the glue result. 1719a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (InputGlue.getNode() != 0) { 17202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Handle any interior nodes explicitly marked. 1721a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner for (unsigned i = 0, e = GlueResultNodesMatched.size(); i != e; ++i) { 1722a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDNode *FRN = GlueResultNodesMatched[i]; 17236e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 172482dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner // If this node was already deleted, don't look at it. 172582dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (FRN->getOpcode() == ISD::DELETED_NODE) 172682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner continue; 17276e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1728f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner assert(FRN->getValueType(FRN->getNumValues()-1) == MVT::Glue && 1729a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner "Doesn't have a glue result"); 17302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(FRN, FRN->getNumValues()-1), 1731a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue, &ISU); 17326e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 173319e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner // If the node became dead and we haven't already seen it, delete it. 173419e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner if (FRN->use_empty() && 173519e37cbf4fa202fc7ca1d769e5ce476f83290dd5Chris Lattner !std::count(NowDeadNodes.begin(), NowDeadNodes.end(), FRN)) 173682dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner NowDeadNodes.push_back(FRN); 17372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 17382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 17396e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 174082dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner if (!NowDeadNodes.empty()) 174182dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner CurDAG->RemoveDeadNodes(NowDeadNodes, &ISU); 17426e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 17432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Match complete!\n"); 17442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 17452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 1746c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattnerenum ChainResult { 1747c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_Simple, 1748c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_InducesCycle, 1749c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner CR_LeadsToInteriorNode 1750c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner}; 1751c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1752c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// WalkChainUsers - Walk down the users of the specified chained node that is 1753c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// part of the pattern we're matching, looking at all of the users we find. 1754c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// This determines whether something is an interior node, whether we have a 1755c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// non-pattern node in between two pattern nodes (which prevent folding because 1756c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// it would induce a cycle) and whether we have a TokenFactor node sandwiched 1757c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// between pattern nodes (in which case the TF becomes part of the pattern). 1758c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// 1759c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// The walk we do here is guaranteed to be small because we quickly get down to 1760c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// already selected nodes "below" us. 17616e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trickstatic ChainResult 1762c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerWalkChainUsers(SDNode *ChainedNode, 1763c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &ChainedNodesInPattern, 1764c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVectorImpl<SDNode*> &InteriorChainedNodes) { 1765c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainResult Result = CR_Simple; 17666e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1767c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (SDNode::use_iterator UI = ChainedNode->use_begin(), 1768c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner E = ChainedNode->use_end(); UI != E; ++UI) { 1769c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Make sure the use is of the chain, not some other value we produce. 1770c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (UI.getUse().getValueType() != MVT::Other) continue; 17716e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1772c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *User = *UI; 1773c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1774c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we see an already-selected machine node, then we've gone beyond the 1775c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that we're selecting down into the already selected chunk of the 1776c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // DAG. 1777c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->isMachineOpcode() || 1778c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner User->getOpcode() == ISD::HANDLENODE) // Root of the graph. 1779c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 17806e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1781d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getOpcode() == ISD::CopyToReg || 1782d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner User->getOpcode() == ISD::CopyFromReg || 17837561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::INLINEASM || 17847561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner User->getOpcode() == ISD::EH_LABEL) { 1785d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // If their node ID got reset to -1 then they've already been selected. 1786d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner // Treat them like a MachineOpcode. 1787d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner if (User->getNodeId() == -1) 1788d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner continue; 1789d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner } 1790c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 1791c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a TokenFactor, we handle it specially. 1792c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (User->getOpcode() != ISD::TokenFactor) { 1793c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the node isn't a token factor and isn't part of our pattern, then it 1794c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // must be a random chained node in between two nodes we're selecting. 1795c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This happens when we have something like: 1796c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1797c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // call 1798c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1799c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1800c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Because we structurally match the load/store as a read/modify/write, 1801c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // but the call is chained between them. We cannot fold in this case 1802c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // because it would induce a cycle in the graph. 1803c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainedNodesInPattern.begin(), 1804c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.end(), User)) 1805c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 18066e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1807c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise we found a node that is part of our pattern. For example in: 1808c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // x = load ptr 1809c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // y = x+4 1810c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store y -> ptr 1811c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // This would happen when we're scanning down from the load and see the 1812c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // store as a user. Record that there is a use of ChainedNode that is 1813c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // part of the pattern and keep scanning uses. 1814c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1815c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1816c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1817c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 18186e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1819c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we found a TokenFactor, there are two cases to consider: first if the 1820c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // TokenFactor is just hanging "below" the pattern we're matching (i.e. no 1821c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses of the TF are in our pattern) we just want to ignore it. Second, 1822c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the TokenFactor can be sandwiched in between two chained nodes, like so: 1823c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load chain] 1824c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ 1825c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | 1826c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Load] 1827c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1828c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | \ DAG's like cheese 1829c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / \ do you? 1830c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // / | 1831c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [TokenFactor] [Op] 1832c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ^ ^ 1833c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // | | 1834c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1835c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // \ / 1836c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // [Store] 1837c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1838c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // In this case, the TokenFactor becomes part of our match and we rewrite it 1839c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // as a new TokenFactor. 1840c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // 1841c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // To distinguish these two cases, do a recursive walk down the uses. 1842c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner switch (WalkChainUsers(User, ChainedNodesInPattern, InteriorChainedNodes)) { 1843c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_Simple: 1844c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor are just already-selected nodes, ignore 1845c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // it, it is "below" our pattern. 1846c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1847c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_InducesCycle: 1848c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If the uses of the TokenFactor lead to nodes that are not part of our 1849c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // pattern that are not selected, folding would turn this into a cycle, 1850c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // bail out now. 1851c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return CR_InducesCycle; 1852c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner case CR_LeadsToInteriorNode: 1853c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner break; // Otherwise, keep processing. 1854c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 18556e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1856c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we know we're in the interesting interior case. The TokenFactor 1857c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // is now going to be considered part of the pattern so that we rewrite its 1858c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // uses (it may have uses that are not part of the pattern) with the 1859c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // ultimate chain result of the generated code. We will also add its chain 1860c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // inputs as inputs to the ultimate TokenFactor we create. 1861c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner Result = CR_LeadsToInteriorNode; 1862c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner ChainedNodesInPattern.push_back(User); 1863c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes.push_back(User); 1864c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1865c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 18666e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1867c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return Result; 1868c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner} 1869c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner 18706b30792d2d7d142b8192241e6232aee004f745fbChris Lattner/// HandleMergeInputChains - This implements the OPC_EmitMergeInputChains 187100592ec857b4c3f31b46412e2738924238c59983Chris Lattner/// operation for when the pattern matched at least one node with a chains. The 1872c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// input vector contains a list of all of the chained nodes that we match. We 1873c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// must determine if this is a valid thing to cover (i.e. matching it won't 1874c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// induce cycles in the DAG) and if so, creating a TokenFactor node. that will 1875c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner/// be used as the input node chain for the generated nodes. 18766b30792d2d7d142b8192241e6232aee004f745fbChris Lattnerstatic SDValue 1877c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris LattnerHandleMergeInputChains(SmallVectorImpl<SDNode*> &ChainNodesMatched, 18786b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SelectionDAG *CurDAG) { 1879c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Walk all of the chained nodes we've matched, recursively scanning down the 1880c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // users of the chain result. This adds any TokenFactor nodes that are caught 1881c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // in between chained nodes to the chained and interior nodes list. 1882c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SmallVector<SDNode*, 3> InteriorChainedNodes; 1883c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1884c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (WalkChainUsers(ChainNodesMatched[i], ChainNodesMatched, 1885c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner InteriorChainedNodes) == CR_InducesCycle) 1886c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner return SDValue(); // Would induce a cycle. 1887c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 18886e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1889c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Okay, we have walked all the matched nodes and collected TokenFactor nodes 1890c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that we are interested in. Form our input TokenFactor node. 18916b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SmallVector<SDValue, 3> InputChains; 18926b30792d2d7d142b8192241e6232aee004f745fbChris Lattner for (unsigned i = 0, e = ChainNodesMatched.size(); i != e; ++i) { 1893c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Add the input chain of this node to the InputChains list (which will be 1894c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // the operands of the generated TokenFactor) if it's not an interior node. 1895c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDNode *N = ChainNodesMatched[i]; 1896c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (N->getOpcode() != ISD::TokenFactor) { 1897c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (std::count(InteriorChainedNodes.begin(),InteriorChainedNodes.end(),N)) 1898c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 18996e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1900c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // Otherwise, add the input chain. 1901c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner SDValue InChain = ChainNodesMatched[i]->getOperand(0); 1902c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner assert(InChain.getValueType() == MVT::Other && "Not a chain"); 19036b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChains.push_back(InChain); 1904c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner continue; 1905c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 19066e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1907c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // If we have a token factor, we want to add all inputs of the token factor 1908c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner // that are not part of the pattern we're matching. 1909c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner for (unsigned op = 0, e = N->getNumOperands(); op != e; ++op) { 1910c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner if (!std::count(ChainNodesMatched.begin(), ChainNodesMatched.end(), 19116183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner N->getOperand(op).getNode())) 19126183fbd7267a7de857e32a2106cfb46a219728f1Chris Lattner InputChains.push_back(N->getOperand(op)); 1913c6d7ad3c7d83e9af29bf3ba3bf3280e72a952f98Chris Lattner } 19146b30792d2d7d142b8192241e6232aee004f745fbChris Lattner } 19156e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 19166b30792d2d7d142b8192241e6232aee004f745fbChris Lattner SDValue Res; 19176b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChains.size() == 1) 19186b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return InputChains[0]; 19196b30792d2d7d142b8192241e6232aee004f745fbChris Lattner return CurDAG->getNode(ISD::TokenFactor, ChainNodesMatched[0]->getDebugLoc(), 19206b30792d2d7d142b8192241e6232aee004f745fbChris Lattner MVT::Other, &InputChains[0], InputChains.size()); 19216e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick} 19222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 19233ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner/// MorphNode - Handle morphing a node in place for the selector. 19243ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerSDNode *SelectionDAGISel:: 19253ff1e4db7896a8ccec74800d52a926118d025260Chris LattnerMorphNode(SDNode *Node, unsigned TargetOpc, SDVTList VTList, 19263ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner const SDValue *Ops, unsigned NumOps, unsigned EmitNodeInfo) { 19273ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // It is possible we're using MorphNodeTo to replace a node with no 19283ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // normal results with one that has a normal result (or we could be 1929a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // adding a chain) and the input could have glue and chains as well. 1930caa8870fe09f5526e611434b6bb9f7040c7dfa60Chris Lattner // In this case we need to shift the operands down. 19313ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // FIXME: This is a horrible hack and broken in obscure cases, no worse 1932a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner // than the old isel though. 1933a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner int OldGlueResultNo = -1, OldChainResultNo = -1; 19343ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19353ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned NTMNumResults = Node->getNumValues(); 1936f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (Node->getValueType(NTMNumResults-1) == MVT::Glue) { 1937a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner OldGlueResultNo = NTMNumResults-1; 19383ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (NTMNumResults != 1 && 19393ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Node->getValueType(NTMNumResults-2) == MVT::Other) 19403ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-2; 19413ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } else if (Node->getValueType(NTMNumResults-1) == MVT::Other) 19423ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner OldChainResultNo = NTMNumResults-1; 19433ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 194461c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // Call the underlying SelectionDAG routine to do the transmogrification. Note 194561c97f693216670cda554d287cd871fdea1b36f9Chris Lattner // that this deletes operands of the old node that become dead. 19463ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDNode *Res = CurDAG->MorphNodeTo(Node, ~TargetOpc, VTList, Ops, NumOps); 19473ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19483ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // MorphNodeTo can operate in two ways: if an existing node with the 19493ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // specified operands exists, it can just return it. Otherwise, it 19503ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // updates the node in place to have the requested operands. 19513ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res == Node) { 19523ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // If we updated the node in place, reset the node ID. To the isel, 19533ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // this should be just like a newly allocated machine node. 19543ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res->setNodeId(-1); 19553ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner } 19563ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19573ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner unsigned ResNumResults = Res->getNumValues(); 1958a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Move the glue if needed. 1959a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if ((EmitNodeInfo & OPFL_GlueOutput) && OldGlueResultNo != -1 && 1960a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner (unsigned)OldGlueResultNo != ResNumResults-1) 19616e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldGlueResultNo), 19623ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 19633ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 1964a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if ((EmitNodeInfo & OPFL_GlueOutput) != 0) 1965d9cb7ca388c400e3c7a509c00d4cf63031de0ddeBill Wendling --ResNumResults; 19663ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19673ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Move the chain reference if needed. 19683ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if ((EmitNodeInfo & OPFL_Chain) && OldChainResultNo != -1 && 19693ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner (unsigned)OldChainResultNo != ResNumResults-1) 19706e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick CurDAG->ReplaceAllUsesOfValueWith(SDValue(Node, OldChainResultNo), 19713ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner SDValue(Res, ResNumResults-1)); 19723ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 19733ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Otherwise, no replacement happened because the node already exists. Replace 19743ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner // Uses of the old node with the new one. 19753ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner if (Res != Node) 19763ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner CurDAG->ReplaceAllUsesWith(Node, Res); 19776e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 19783ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner return Res; 19793ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner} 19803ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 1981f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 198219e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 1983da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckSame(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1984d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDValue N, 1985d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner const SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) { 1986da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Accept if it is exactly the same as a previously recorded node. 1987da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 1988da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 1989d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner return N == RecordedNodes[RecNo].first; 1990da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 19916e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 1992da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner/// CheckPatternPredicate - Implements OP_CheckPatternPredicate. 199319e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 1994f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckPatternPredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 1995f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel) { 1996f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckPatternPredicate(MatcherTable[MatcherIndex++]); 1997f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 1998f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 1999f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// CheckNodePredicate - Implements OP_CheckNodePredicate. 200019e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2001f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckNodePredicate(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2002f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SelectionDAGISel &SDISel, SDNode *N) { 2003f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return SDISel.CheckNodePredicate(N, MatcherTable[MatcherIndex++]); 2004f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2005f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 200619e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2007f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckOpcode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2008f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDNode *N) { 2009d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2010d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2011d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner return N->getOpcode() == Opc; 2012f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2013f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 201419e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2015f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2016f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N, const TargetLowering &TLI) { 2017f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2018f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (N.getValueType() == VT) return true; 20196e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2020f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Handle the case when VT is iPTR. 2021f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return VT == MVT::iPTR && N.getValueType() == TLI.getPointerTy(); 2022f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2023f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 202419e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2025da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckChildType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2026da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI, 2027da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner unsigned ChildNo) { 2028da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (ChildNo >= N.getNumOperands()) 2029da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return false; // Match fails if out of range child #. 2030da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return ::CheckType(MatcherTable, MatcherIndex, N.getOperand(ChildNo), TLI); 2031da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2032da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 2033da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 203419e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2035da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckCondCode(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2036da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N) { 2037da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return cast<CondCodeSDNode>(N)->get() == 2038da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner (ISD::CondCode)MatcherTable[MatcherIndex++]; 2039da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2040da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 204119e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2042da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckValueType(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2043da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, const TargetLowering &TLI) { 2044da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner MVT::SimpleValueType VT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2045da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (cast<VTSDNode>(N)->getVT() == VT) 2046da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return true; 20476e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2048da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner // Handle the case when VT is iPTR. 2049da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return VT == MVT::iPTR && cast<VTSDNode>(N)->getVT() == TLI.getPointerTy(); 2050da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2051da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 205219e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2053f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris LattnerCheckInteger(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2054f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner SDValue N) { 2055f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 2056f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (Val & 128) 2057f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 20586e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2059f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N); 2060f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return C != 0 && C->getSExtValue() == Val; 2061f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2062f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 206319e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2064da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckAndImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2065da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 2066da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 2067da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 2068da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 20696e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2070da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::AND) return false; 20716e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2072da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 2073da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckAndMask(N.getOperand(0), C, Val); 2074da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2075da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 207619e57025d458d3cb50804fd821fd89b868a819bdChandler CarruthLLVM_ATTRIBUTE_ALWAYS_INLINE static bool 2077da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris LattnerCheckOrImm(const unsigned char *MatcherTable, unsigned &MatcherIndex, 2078da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner SDValue N, SelectionDAGISel &SDISel) { 2079da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 2080da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (Val & 128) 2081da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 20826e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2083da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (N->getOpcode() != ISD::OR) return false; 20846e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2085da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner ConstantSDNode *C = dyn_cast<ConstantSDNode>(N->getOperand(1)); 2086da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return C != 0 && SDISel.CheckOrMask(N.getOperand(0), C, Val); 2087da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner} 2088da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner 2089f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// IsPredicateKnownToFail - If we know how and can do so without pushing a 2090f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// scope, evaluate the current node. If the current predicate is known to 2091f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// fail, set Result=true and return anything. If the current predicate is 2092f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// known to pass, set Result=false and return the MatcherIndex to continue 2093f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner/// with. If the current predicate is unknown, set Result=false and return the 20946e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick/// MatcherIndex to continue with. 2095f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattnerstatic unsigned IsPredicateKnownToFail(const unsigned char *Table, 2096f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned Index, SDValue N, 2097da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner bool &Result, SelectionDAGISel &SDISel, 2098d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SmallVectorImpl<std::pair<SDValue, SDNode*> > &RecordedNodes) { 2099f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner switch (Table[Index++]) { 2100f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner default: 2101f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = false; 2102f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index-1; // Could not evaluate this predicate. 2103da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckSame: 2104da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckSame(Table, Index, N, RecordedNodes); 2105da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2106f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPatternPredicate: 2107da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckPatternPredicate(Table, Index, SDISel); 2108f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2109f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckPredicate: 2110da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckNodePredicate(Table, Index, SDISel, N.getNode()); 2111f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2112f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckOpcode: 2113f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckOpcode(Table, Index, N.getNode()); 2114f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2115f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckType: 2116f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckType(Table, Index, N, SDISel.TLI); 2117f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2118f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild0Type: 2119f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild1Type: 2120f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild2Type: 2121f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild3Type: 2122f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild4Type: 2123f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild5Type: 2124f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckChild6Type: 2125da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckChild7Type: 2126da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckChildType(Table, Index, N, SDISel.TLI, 2127da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Table[Index-1] - SelectionDAGISel::OPC_CheckChild0Type); 2128da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2129da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckCondCode: 2130da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckCondCode(Table, Index, N); 2131da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2132da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckValueType: 2133da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckValueType(Table, Index, N, SDISel.TLI); 2134f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2135f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case SelectionDAGISel::OPC_CheckInteger: 2136f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner Result = !::CheckInteger(Table, Index, N); 2137f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner return Index; 2138da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckAndImm: 2139da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckAndImm(Table, Index, N, SDISel); 2140da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2141da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case SelectionDAGISel::OPC_CheckOrImm: 2142da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result = !::CheckOrImm(Table, Index, N, SDISel); 2143da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner return Index; 2144f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 2145f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner} 2146f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner 2147b35798347ea87b8b6d36155b211016a7769f01abDan Gohmannamespace { 21483ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner 21492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattnerstruct MatchScope { 21502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// FailIndex - If this match fails, this is the index to continue with. 21512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FailIndex; 21526e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 21532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NodeStack - The node stack when the scope was formed. 21542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 4> NodeStack; 21556e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 21562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumRecordedNodes - The number of recorded nodes when the scope was formed. 21572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumRecordedNodes; 21586e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 21592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// NumMatchedMemRefs - The number of matched memref entries. 21602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumMatchedMemRefs; 21616e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 21626e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick /// InputChain/InputGlue - The current chain/glue 2163a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDValue InputChain, InputGlue; 21642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 21652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner /// HasChainNodesMatched - True if the ChainNodesMatched list is non-empty. 2166a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner bool HasChainNodesMatched, HasGlueResultNodesMatched; 21672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner}; 21682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2169b35798347ea87b8b6d36155b211016a7769f01abDan Gohman} 2170b35798347ea87b8b6d36155b211016a7769f01abDan Gohman 21712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSDNode *SelectionDAGISel:: 21722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris LattnerSelectCodeCommon(SDNode *NodeToMatch, const unsigned char *MatcherTable, 21732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned TableSize) { 21742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: Should these even be selected? Handle these cases in the caller? 21752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (NodeToMatch->getOpcode()) { 21762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner default: 21772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 21782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::EntryToken: // These nodes remain the same. 21792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::BasicBlock: 21802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::Register: 21819cf37e8b48732fccd4c301ed51aafed7074bd84eJakob Stoklund Olesen case ISD::RegisterMask: 21823b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::VALUETYPE: 21833b9d6216a41cfd43759e787db26d797e1f0ba0a8Chris Lattner //case ISD::CONDCODE: 21842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::HANDLENODE: 2185decc2671516e6c52ee2f29f7746f8d02753845eaChris Lattner case ISD::MDNODE_SDNODE: 21862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstant: 21872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantFP: 21882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetConstantPool: 21892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetFrameIndex: 21902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetExternalSymbol: 21912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetBlockAddress: 21922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetJumpTable: 21932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalTLSAddress: 21942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TargetGlobalAddress: 21952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::TokenFactor: 21962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyFromReg: 21972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::CopyToReg: 21987561d480953e0a2faa4af9be0a00b1180097c4bdChris Lattner case ISD::EH_LABEL: 2199d1b738298359846b9cccaa0931e6ec1fc59a6d87Chris Lattner NodeToMatch->setNodeId(-1); // Mark selected. 22002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 22012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertSext: 22022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::AssertZext: 22032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, 0), 22042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getOperand(0)); 22052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 22062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::INLINEASM: return Select_INLINEASM(NodeToMatch); 22072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case ISD::UNDEF: return Select_UNDEF(NodeToMatch); 22082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 22096e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeToMatch->isMachineOpcode() && "Node already selected!"); 22112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Set up the node stack with NodeToMatch as the only node on the stack. 22132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> NodeStack; 22142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue N = SDValue(NodeToMatch, 0); 22152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 22162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 22172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchScopes - Scopes used when matching, if a match failure happens, this 22182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // indicates where to continue checking. 22192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MatchScope, 8> MatchScopes; 22206e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // RecordedNodes - This is the set of nodes that have been recorded by the 2222d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner // state machine. The second value is the parent of the node, or null if the 2223d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner // root is recorded. 2224d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SmallVector<std::pair<SDValue, SDNode*>, 8> RecordedNodes; 22256e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // MatchedMemRefs - This is the set of MemRef's we've seen in the input 22272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // pattern. 22282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<MachineMemOperand*, 2> MatchedMemRefs; 22296e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2230a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // These are the current input chain and glue for use when generating nodes. 22312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Various Emit operations change these. For example, emitting a copytoreg 22322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // uses and updates these. 2233a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SDValue InputChain, InputGlue; 22346e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // ChainNodesMatched - If a pattern matches nodes that have input/output 22362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains, the OPC_EmitMergeInputChains operation is emitted which indicates 22372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // which ones they are. The result is captured into this list so that we can 22382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // update the chain results when the pattern is complete. 22392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDNode*, 3> ChainNodesMatched; 2240a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner SmallVector<SDNode*, 3> GlueResultNodesMatched; 22416e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << "ISEL: Starting pattern match on root node: "; 22432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->dump(CurDAG); 22442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner errs() << '\n'); 22456e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22467390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Determine where to start the interpreter. Normally we start at opcode #0, 22477390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // but if the state machine starts with an OPC_SwitchOpcode, then we 22487390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // accelerate the first lookup (which is guaranteed to be hot) with the 22497390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // OpcodeOffset table. 22502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned MatcherIndex = 0; 22516e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22527390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (!OpcodeOffset.empty()) { 22537390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Already computed the OpcodeOffset table, just index into it. 22547390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 22557390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 22567390eebd49b786f3293d24f76fedb02fe183468cChris Lattner DEBUG(errs() << " Initial Opcode index to " << MatcherIndex << "\n"); 22577390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 22587390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } else if (MatcherTable[0] == OPC_SwitchOpcode) { 22597390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Otherwise, the table isn't computed, but the state machine does start 22607390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // with an OPC_SwitchOpcode instruction. Populate the table now, since this 22617390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // is the first time we're selecting an instruction. 22627390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned Idx = 1; 22637390eebd49b786f3293d24f76fedb02fe183468cChris Lattner while (1) { 22647390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the size of this case. 22657390eebd49b786f3293d24f76fedb02fe183468cChris Lattner unsigned CaseSize = MatcherTable[Idx++]; 22667390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize & 128) 22677390eebd49b786f3293d24f76fedb02fe183468cChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, Idx); 22687390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (CaseSize == 0) break; 22697390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 22707390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Get the opcode, add the index to the table. 2271d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[Idx++]; 2272d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[Idx++] << 8; 22737390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (Opc >= OpcodeOffset.size()) 22747390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset.resize((Opc+1)*2); 22757390eebd49b786f3293d24f76fedb02fe183468cChris Lattner OpcodeOffset[Opc] = Idx; 22767390eebd49b786f3293d24f76fedb02fe183468cChris Lattner Idx += CaseSize; 22777390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 22787390eebd49b786f3293d24f76fedb02fe183468cChris Lattner 22797390eebd49b786f3293d24f76fedb02fe183468cChris Lattner // Okay, do the lookup for the first opcode. 22807390eebd49b786f3293d24f76fedb02fe183468cChris Lattner if (N.getOpcode() < OpcodeOffset.size()) 22817390eebd49b786f3293d24f76fedb02fe183468cChris Lattner MatcherIndex = OpcodeOffset[N.getOpcode()]; 22827390eebd49b786f3293d24f76fedb02fe183468cChris Lattner } 22836e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 22842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 22852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(MatcherIndex < TableSize && "Invalid index"); 228619b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#ifndef NDEBUG 228719b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman unsigned CurrentOpcodeIndex = MatcherIndex; 228819b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman#endif 22892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner BuiltinOpcodes Opcode = (BuiltinOpcodes)MatcherTable[MatcherIndex++]; 22902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner switch (Opcode) { 22912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_Scope: { 2292f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Okay, the semantics of this operation are that we should push a scope 2293f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // then evaluate the first child. However, pushing a scope only to have 2294f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // the first check fail (which then pops it) is inefficient. If we can 2295f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // determine immediately that the first check (or first several) will 2296f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // immediately fail, don't even bother pushing a scope for them. 2297f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned FailIndex; 22986e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2299f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner while (1) { 2300f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 2301f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip & 128) 2302f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 2303f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Found the end of the scope with no match. 2304f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (NumToSkip == 0) { 2305f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = 0; 2306f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 2307f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 23086e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2309f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner FailIndex = MatcherIndex+NumToSkip; 23106e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2311a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner unsigned MatcherIndexOfPredicate = MatcherIndex; 2312a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner (void)MatcherIndexOfPredicate; // silence warning. 23136e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2314f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If we can't evaluate this predicate without pushing a scope (e.g. if 2315f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // it is a 'MoveParent') or if the predicate succeeds on this node, we 2316f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // push the scope and evaluate the full predicate chain. 2317f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner bool Result; 2318f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = IsPredicateKnownToFail(MatcherTable, MatcherIndex, N, 2319da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Result, *this, RecordedNodes); 2320f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!Result) 2321f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 23226e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2323a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner DEBUG(errs() << " Skipped scope entry (due to false predicate) at " 2324a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << "index " << MatcherIndexOfPredicate 2325a6f8693385636b18ae05e30f5017393ad1309bb2Chris Lattner << ", continuing at " << FailIndex << "\n"); 2326bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 23276e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2328f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // Otherwise, we know that this case of the Scope is guaranteed to fail, 2329f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // move to the next case. 2330f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner MatcherIndex = FailIndex; 2331f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner } 23326e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2333f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner // If the whole scope failed to match, bail. 2334f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (FailIndex == 0) break; 23356e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 23362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Push a MatchScope which indicates where to go if the first child fails 23372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // to match. 23382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope NewEntry; 2339f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner NewEntry.FailIndex = FailIndex; 23402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NodeStack.append(NodeStack.begin(), NodeStack.end()); 23412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumRecordedNodes = RecordedNodes.size(); 23422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.NumMatchedMemRefs = MatchedMemRefs.size(); 23432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.InputChain = InputChain; 2344a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner NewEntry.InputGlue = InputGlue; 23452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NewEntry.HasChainNodesMatched = !ChainNodesMatched.empty(); 2346a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner NewEntry.HasGlueResultNodesMatched = !GlueResultNodesMatched.empty(); 23472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.push_back(NewEntry); 23482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 2350d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner case OPC_RecordNode: { 23512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Remember this node, it may end up being an operand in the pattern. 2352d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDNode *Parent = 0; 2353d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner if (NodeStack.size() > 1) 2354d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner Parent = NodeStack[NodeStack.size()-2].getNode(); 2355d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::make_pair(N, Parent)); 23562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2357d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner } 23586e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 23592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild0: case OPC_RecordChild1: 23602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild2: case OPC_RecordChild3: 23612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild4: case OPC_RecordChild5: 23622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordChild6: case OPC_RecordChild7: { 23632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = Opcode-OPC_RecordChild0; 23642a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 23652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 23662a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2367d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::make_pair(N->getOperand(ChildNo), 2368d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner N.getNode())); 23692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_RecordMemRef: 23722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.push_back(cast<MemSDNode>(N)->getMemOperand()); 23732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23746e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 237529d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner case OPC_CaptureGlueInput: 2376a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the current node has an input glue, capture it in InputGlue. 23772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (N->getNumOperands() != 0 && 2378f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner N->getOperand(N->getNumOperands()-1).getValueType() == MVT::Glue) 2379a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue = N->getOperand(N->getNumOperands()-1); 23802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23816e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 23822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveChild: { 23832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ChildNo = MatcherTable[MatcherIndex++]; 23842a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChildNo >= N.getNumOperands()) 23852a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; // Match fails if out of range child #. 23862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = N.getOperand(ChildNo); 23872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.push_back(N); 23882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 23906e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 23912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MoveParent: 23922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Pop the current node off the NodeStack. 23932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.pop_back(); 23942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(!NodeStack.empty() && "Node stack imbalance!"); 23956e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick N = NodeStack.back(); 23962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 23976e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2398da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckSame: 2399da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckSame(MatcherTable, MatcherIndex, N, RecordedNodes)) break; 24002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24012a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPatternPredicate: 2402f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckPatternPredicate(MatcherTable, MatcherIndex, *this)) break; 24032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckPredicate: 2405f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckNodePredicate(MatcherTable, MatcherIndex, *this, 2406f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner N.getNode())) 2407f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 24082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 240957bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner case OPC_CheckComplexPat: { 241057bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned CPNum = MatcherTable[MatcherIndex++]; 241157bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 241257bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckComplexPat"); 2413d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner if (!CheckComplexPattern(NodeToMatch, RecordedNodes[RecNo].second, 2414d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes[RecNo].first, CPNum, 241557bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner RecordedNodes)) 24162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 24172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 241857bf8a483edf97589c3e6085721e72fc187677a8Chris Lattner } 24192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckOpcode: 2420f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckOpcode(MatcherTable, MatcherIndex, N.getNode())) break; 2421f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner continue; 24226e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2423f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckType: 2424f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckType(MatcherTable, MatcherIndex, N, TLI)) break; 24252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24266e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2427eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner case OPC_SwitchOpcode: { 2428eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CurNodeOpcode = N.getOpcode(); 24297d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2430eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner unsigned CaseSize; 2431eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner while (1) { 2432eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Get the size of this case. 2433eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2434eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize & 128) 2435eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2436eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 2437eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner 2438d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner uint16_t Opc = MatcherTable[MatcherIndex++]; 2439d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner Opc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 2440d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner 2441eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // If the opcode matches, then we will execute this case. 2442d5d5a3dcbaa4e7f394ba045e2d7d0ec3aa76f50cChris Lattner if (CurNodeOpcode == Opc) 2443eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner break; 24446e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2445eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, skip over this case. 2446eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner MatcherIndex += CaseSize; 2447eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 24486e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2449cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2450eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner if (CaseSize == 0) break; 24516e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2452eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner // Otherwise, execute the case we found. 2453eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner DEBUG(errs() << " OpcodeSwitch from " << SwitchStart 2454eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner << " to " << MatcherIndex << "\n"); 2455eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner continue; 2456eb66921adb943ea841e72c8eee4777607c48b70eChris Lattner } 24576e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2458cfe2eab7446dedc471592fe702fefef783383171Chris Lattner case OPC_SwitchType: { 2459cdfad36b401be6fc709ea4051f9de58e1a30bcc9Duncan Sands MVT CurNodeVT = N.getValueType().getSimpleVT(); 2460cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned SwitchStart = MatcherIndex-1; (void)SwitchStart; 2461cfe2eab7446dedc471592fe702fefef783383171Chris Lattner unsigned CaseSize; 2462cfe2eab7446dedc471592fe702fefef783383171Chris Lattner while (1) { 2463cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Get the size of this case. 2464cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = MatcherTable[MatcherIndex++]; 2465cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize & 128) 2466cfe2eab7446dedc471592fe702fefef783383171Chris Lattner CaseSize = GetVBR(CaseSize, MatcherTable, MatcherIndex); 2467cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 24686e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2469cdfad36b401be6fc709ea4051f9de58e1a30bcc9Duncan Sands MVT CaseVT = (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 2470cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseVT == MVT::iPTR) 2471cdfad36b401be6fc709ea4051f9de58e1a30bcc9Duncan Sands CaseVT = TLI.getPointerTy(); 24726e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2473cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If the VT matches, then we will execute this case. 2474cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CurNodeVT == CaseVT) 2475cfe2eab7446dedc471592fe702fefef783383171Chris Lattner break; 24766e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2477cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, skip over this case. 2478cfe2eab7446dedc471592fe702fefef783383171Chris Lattner MatcherIndex += CaseSize; 2479cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 24806e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2481cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // If no cases matched, bail out. 2482cfe2eab7446dedc471592fe702fefef783383171Chris Lattner if (CaseSize == 0) break; 24836e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2484cfe2eab7446dedc471592fe702fefef783383171Chris Lattner // Otherwise, execute the case we found. 2485cfe2eab7446dedc471592fe702fefef783383171Chris Lattner DEBUG(errs() << " TypeSwitch[" << EVT(CurNodeVT).getEVTString() 2486cfe2eab7446dedc471592fe702fefef783383171Chris Lattner << "] from " << SwitchStart << " to " << MatcherIndex<<'\n'); 2487cfe2eab7446dedc471592fe702fefef783383171Chris Lattner continue; 2488cfe2eab7446dedc471592fe702fefef783383171Chris Lattner } 24892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild0Type: case OPC_CheckChild1Type: 24902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild2Type: case OPC_CheckChild3Type: 24912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckChild4Type: case OPC_CheckChild5Type: 2492da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckChild6Type: case OPC_CheckChild7Type: 2493da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckChildType(MatcherTable, MatcherIndex, N, TLI, 2494da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner Opcode-OPC_CheckChild0Type)) 2495f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner break; 24962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 24972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckCondCode: 2498da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckCondCode(MatcherTable, MatcherIndex, N)) break; 24992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2500da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckValueType: 2501da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckValueType(MatcherTable, MatcherIndex, N, TLI)) break; 25022a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2503f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner case OPC_CheckInteger: 2504f1b7c7d476a2f30f035c527cfe8e14c6c6255f07Chris Lattner if (!::CheckInteger(MatcherTable, MatcherIndex, N)) break; 25052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2506da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckAndImm: 2507da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckAndImm(MatcherTable, MatcherIndex, N, *this)) break; 25082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 2509da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner case OPC_CheckOrImm: 2510da828e3c8c869c0a62fefbd4c14811ca6fb4913dChris Lattner if (!::CheckOrImm(MatcherTable, MatcherIndex, N, *this)) break; 25112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25126e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 25132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CheckFoldableChainNode: { 25142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeStack.size() != 1 && "No parent node"); 25152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Verify that all intermediate nodes between the root and this one have 25162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // a single use. 25172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner bool HasMultipleUses = false; 25182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 1, e = NodeStack.size()-1; i != e; ++i) 25192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!NodeStack[i].hasOneUse()) { 25202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner HasMultipleUses = true; 25212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 25222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (HasMultipleUses) break; 25242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see that the target thinks this is profitable to fold and that 25262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we can fold it without inducing cycles in the graph. 25272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!IsProfitableToFold(N, NodeStack[NodeStack.size()-2].getNode(), 25282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch) || 25292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner !IsLegalToFold(N, NodeStack[NodeStack.size()-2].getNode(), 2530d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman NodeToMatch, OptLevel, 2531d858e90f039f5fcdc2fa93035e911a5a9505cc50Dan Gohman true/*We validate our own chains*/)) 25322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 25336e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 25342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitInteger: { 25372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 25382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 25392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = MatcherTable[MatcherIndex++]; 25402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Val & 128) 25412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Val = GetVBR(Val, MatcherTable, MatcherIndex); 2542d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::pair<SDValue, SDNode*>( 2543df30bdb3a735a81b4182d80b870bc39846824396Oscar Fuentes CurDAG->getTargetConstant(Val, VT), (SDNode*)0)); 25442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitRegister: { 25472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 25482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 25492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RegNo = MatcherTable[MatcherIndex++]; 2550d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::pair<SDValue, SDNode*>( 2551df30bdb3a735a81b4182d80b870bc39846824396Oscar Fuentes CurDAG->getRegister(RegNo, VT), (SDNode*)0)); 25522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25542d76c84514216f51526f2be123315f585995d860Jim Grosbach case OPC_EmitRegister2: { 25552d76c84514216f51526f2be123315f585995d860Jim Grosbach // For targets w/ more than 256 register names, the register enum 25562d76c84514216f51526f2be123315f585995d860Jim Grosbach // values are stored in two bytes in the matcher table (just like 25572d76c84514216f51526f2be123315f585995d860Jim Grosbach // opcodes). 25582d76c84514216f51526f2be123315f585995d860Jim Grosbach MVT::SimpleValueType VT = 25592d76c84514216f51526f2be123315f585995d860Jim Grosbach (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 25602d76c84514216f51526f2be123315f585995d860Jim Grosbach unsigned RegNo = MatcherTable[MatcherIndex++]; 25612d76c84514216f51526f2be123315f585995d860Jim Grosbach RegNo |= MatcherTable[MatcherIndex++] << 8; 25622d76c84514216f51526f2be123315f585995d860Jim Grosbach RecordedNodes.push_back(std::pair<SDValue, SDNode*>( 25632d76c84514216f51526f2be123315f585995d860Jim Grosbach CurDAG->getRegister(RegNo, VT), (SDNode*)0)); 25642d76c84514216f51526f2be123315f585995d860Jim Grosbach continue; 25652d76c84514216f51526f2be123315f585995d860Jim Grosbach } 25666e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 25672a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitConvertToTarget: { 25682a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Convert from IMM/FPIMM to target version. 25692a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 25702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2571d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDValue Imm = RecordedNodes[RecNo].first; 25722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 25732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Imm->getOpcode() == ISD::Constant) { 25742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner int64_t Val = cast<ConstantSDNode>(Imm)->getZExtValue(); 25752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstant(Val, Imm.getValueType()); 25762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (Imm->getOpcode() == ISD::ConstantFP) { 25772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner const ConstantFP *Val=cast<ConstantFPSDNode>(Imm)->getConstantFPValue(); 25782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Imm = CurDAG->getTargetConstantFP(*Val, Imm.getValueType()); 25792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25806e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2581d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::make_pair(Imm, RecordedNodes[RecNo].second)); 25822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 25832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 25846e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2585aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_0: // OPC_EmitMergeInputChains, 1, 0 2586aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner case OPC_EmitMergeInputChains1_1: { // OPC_EmitMergeInputChains, 1, 1 2587aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // These are space-optimized forms of OPC_EmitMergeInputChains. 2588aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(InputChain.getNode() == 0 && 2589aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 2590aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(ChainNodesMatched.empty() && 2591aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner "Should only have one EmitMergeInputChains per match"); 25926e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2593aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Read all of the chained nodes. 2594aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner unsigned RecNo = Opcode == OPC_EmitMergeInputChains1_1; 2595aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2596d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode()); 25976e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2598aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // FIXME: What if other value results of the node have uses not matched 2599aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // by this pattern? 2600aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2601d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner !RecordedNodes[RecNo].first.hasOneUse()) { 2602aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner ChainNodesMatched.clear(); 2603aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; 2604aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 26056e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2606aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner // Merge the input chains if they are not intra-pattern references. 2607aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 26086e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2609aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner if (InputChain.getNode() == 0) 2610aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner break; // Failed to merge. 2611aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner continue; 2612aa4e3391c8814c6ce0bbc530ea4d5905414b2763Chris Lattner } 26136e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitMergeInputChains: { 26152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(InputChain.getNode() == 0 && 26162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "EmitMergeInputChains should be the first chain producing node"); 26172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // This node gets a list of nodes we matched in the input that have 26182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // chains. We want to token factor all of the input chains to these nodes 26192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // together. However, if any of the input chains is actually one of the 26202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // nodes matched in this pattern, then we have an intra-match reference. 26212a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Ignore these because the newly token factored chain should not refer to 26222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // the old nodes. 26232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumChains = MatcherTable[MatcherIndex++]; 26242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NumChains != 0 && "Can't TF zero chains"); 26252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ChainNodesMatched.empty() && 26272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Should only have one EmitMergeInputChains per match"); 26282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Read all of the chained nodes. 263000592ec857b4c3f31b46412e2738924238c59983Chris Lattner for (unsigned i = 0; i != NumChains; ++i) { 263100592ec857b4c3f31b46412e2738924238c59983Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 26322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2633d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner ChainNodesMatched.push_back(RecordedNodes[RecNo].first.getNode()); 26346e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: What if other value results of the node have uses not matched 26362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // by this pattern? 26372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ChainNodesMatched.back() != NodeToMatch && 2638d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner !RecordedNodes[RecNo].first.hasOneUse()) { 26392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 26402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 26412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26436e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26446b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // If the inner loop broke out, the match fails. 26456b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (ChainNodesMatched.empty()) 26466b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; 26472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26486b30792d2d7d142b8192241e6232aee004f745fbChris Lattner // Merge the input chains if they are not intra-pattern references. 26496b30792d2d7d142b8192241e6232aee004f745fbChris Lattner InputChain = HandleMergeInputChains(ChainNodesMatched, CurDAG); 26506e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26516b30792d2d7d142b8192241e6232aee004f745fbChris Lattner if (InputChain.getNode() == 0) 26526b30792d2d7d142b8192241e6232aee004f745fbChris Lattner break; // Failed to merge. 26532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 26542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 26552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26566e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitCopyToReg: { 26582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 26592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 26602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned DestPhysReg = MatcherTable[MatcherIndex++]; 26616e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (InputChain.getNode() == 0) 26632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getEntryNode(); 26646e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = CurDAG->getCopyToReg(InputChain, NodeToMatch->getDebugLoc(), 2666d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner DestPhysReg, RecordedNodes[RecNo].first, 2667a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue); 26686e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2669a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue = InputChain.getValue(1); 26702a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 26712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26726e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNodeXForm: { 26742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned XFormNo = MatcherTable[MatcherIndex++]; 26752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 26762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2677d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDValue Res = RunSDNodeXForm(RecordedNodes[RecNo].first, XFormNo); 2678df30bdb3a735a81b4182d80b870bc39846824396Oscar Fuentes RecordedNodes.push_back(std::pair<SDValue,SDNode*>(Res, (SDNode*) 0)); 26792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 26802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26816e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_EmitNode: 26832a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_MorphNodeTo: { 268414df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner uint16_t TargetOpc = MatcherTable[MatcherIndex++]; 268514df8dc680d40173f34d693f9dc451f8a30c907bChris Lattner TargetOpc |= (unsigned short)MatcherTable[MatcherIndex++] << 8; 26862a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned EmitNodeInfo = MatcherTable[MatcherIndex++]; 26872a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the result VT list. 26882a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumVTs = MatcherTable[MatcherIndex++]; 26892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<EVT, 4> VTs; 26902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumVTs; ++i) { 26912a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MVT::SimpleValueType VT = 26922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner (MVT::SimpleValueType)MatcherTable[MatcherIndex++]; 26932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (VT == MVT::iPTR) VT = TLI.getPointerTy().SimpleTy; 26942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(VT); 26952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 26966e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 26972a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 26982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTs.push_back(MVT::Other); 2699a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (EmitNodeInfo & OPFL_GlueOutput) 2700f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner VTs.push_back(MVT::Glue); 27016e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27027d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // This is hot code, so optimize the two most common cases of 1 and 2 27037d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner // results. 27047d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner SDVTList VTList; 27057d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner if (VTs.size() == 1) 27067d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0]); 27077d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else if (VTs.size() == 2) 27087d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs[0], VTs[1]); 27097d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner else 27107d892d6e6d451e9a0d0f9db839a943a256126c05Chris Lattner VTList = CurDAG->getVTList(VTs.data(), VTs.size()); 27112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 27122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Get the operand list. 27132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumOps = MatcherTable[MatcherIndex++]; 27142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SmallVector<SDValue, 8> Ops; 27152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumOps; ++i) { 27162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 27172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 27182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 27196e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid EmitNode"); 2721d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner Ops.push_back(RecordedNodes[RecNo].first); 27222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27236e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If there are variadic operands to add, handle them now. 27252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_VariadicInfo) { 27262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Determine the start index to copy from. 27272a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned FirstOpToCopy = getNumFixedFromVariadicInfo(EmitNodeInfo); 27282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner FirstOpToCopy += (EmitNodeInfo & OPFL_Chain) ? 1 : 0; 27292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->getNumOperands() >= FirstOpToCopy && 27302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Invalid variadic node"); 2731a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Copy all of the variadic operands, not including a potential glue 27322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // input. 27332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = FirstOpToCopy, e = NodeToMatch->getNumOperands(); 27342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner i != e; ++i) { 27352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDValue V = NodeToMatch->getOperand(i); 2736f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (V.getValueType() == MVT::Glue) break; 27372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(V); 27382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27406e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2741a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If this has chain/glue inputs, add them. 27422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 27432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Ops.push_back(InputChain); 2744a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if ((EmitNodeInfo & OPFL_GlueInput) && InputGlue.getNode() != 0) 2745a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner Ops.push_back(InputGlue); 27466e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Create the node. 27482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner SDNode *Res = 0; 27492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode != OPC_MorphNodeTo) { 27502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this is a normal EmitNode command, just create the new node and 27512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // add the results to the RecordedNodes list. 27522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res = CurDAG->getMachineNode(TargetOpc, NodeToMatch->getDebugLoc(), 27532a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner VTList, Ops.data(), Ops.size()); 27546e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2755a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Add all the non-glue/non-chain results to the RecordedNodes list. 27562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0, e = VTs.size(); i != e; ++i) { 2757f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (VTs[i] == MVT::Other || VTs[i] == MVT::Glue) break; 2758d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner RecordedNodes.push_back(std::pair<SDValue,SDNode*>(SDValue(Res, i), 2759df30bdb3a735a81b4182d80b870bc39846824396Oscar Fuentes (SDNode*) 0)); 27602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27616e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 27622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else { 27633ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner Res = MorphNode(NodeToMatch, TargetOpc, VTList, Ops.data(), Ops.size(), 27643ff1e4db7896a8ccec74800d52a926118d025260Chris Lattner EmitNodeInfo); 27652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 27666e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2767a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the node had chain/glue results, update our notion of the current 2768a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // chain and glue. 2769a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (EmitNodeInfo & OPFL_GlueOutput) { 2770a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue = SDValue(Res, VTs.size()-1); 27712a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_Chain) 27722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-2); 27732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } else if (EmitNodeInfo & OPFL_Chain) 27742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = SDValue(Res, VTs.size()-1); 27752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2776a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // If the OPFL_MemRefs glue is set on this node, slap all of the 27772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // accumulated memrefs onto it. 27782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // 27792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: This is vastly incorrect for patterns with multiple outputs 27802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // instructions that access memory and for ComplexPatterns that match 27812a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // loads. 27822a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (EmitNodeInfo & OPFL_MemRefs) { 27835a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich // Only attach load or store memory operands if the generated 27845a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich // instruction may load or store. 2785e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng const MCInstrDesc &MCID = TM.getInstrInfo()->get(TargetOpc); 2786e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng bool mayLoad = MCID.mayLoad(); 2787e837dead3c8dc3445ef6a0e2322179c57e264a13Evan Cheng bool mayStore = MCID.mayStore(); 27885a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich 27895a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich unsigned NumMemRefs = 0; 27905a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich for (SmallVector<MachineMemOperand*, 2>::const_iterator I = 27915a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) { 27925a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if ((*I)->isLoad()) { 27935a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if (mayLoad) 27945a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich ++NumMemRefs; 27955a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } else if ((*I)->isStore()) { 27965a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if (mayStore) 27975a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich ++NumMemRefs; 27985a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } else { 27995a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich ++NumMemRefs; 28005a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } 28015a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } 28025a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich 28032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MachineSDNode::mmo_iterator MemRefs = 28045a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich MF->allocateMemRefsArray(NumMemRefs); 28055a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich 28065a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich MachineSDNode::mmo_iterator MemRefsPos = MemRefs; 28075a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich for (SmallVector<MachineMemOperand*, 2>::const_iterator I = 28085a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich MatchedMemRefs.begin(), E = MatchedMemRefs.end(); I != E; ++I) { 28095a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if ((*I)->isLoad()) { 28105a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if (mayLoad) 28115a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich *MemRefsPos++ = *I; 28125a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } else if ((*I)->isStore()) { 28135a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich if (mayStore) 28145a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich *MemRefsPos++ = *I; 28155a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } else { 28165a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich *MemRefsPos++ = *I; 28175a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } 28185a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich } 28195a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich 28202a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner cast<MachineSDNode>(Res) 28215a4b3d8c8f52ee225ffc65c7d6cebc78b1ec7808Cameron Zwarich ->setMemRefs(MemRefs, MemRefs + NumMemRefs); 28222a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28236e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28242a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner DEBUG(errs() << " " 28252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << (Opcode == OPC_MorphNodeTo ? "Morphed" : "Created") 28262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner << " node: "; Res->dump(CurDAG); errs() << "\n"); 28276e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28282a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If this was a MorphNodeTo then we're completely done! 28292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (Opcode == OPC_MorphNodeTo) { 2830a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Update chain and glue uses. 2831a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched, 2832a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue, GlueResultNodesMatched, true); 283382dd3d38d9b3bd49f19b8230f39d33e8ee6d4055Chris Lattner return Res; 28342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28356e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 28372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28386e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 283929d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner case OPC_MarkGlueResults: { 28402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumNodes = MatcherTable[MatcherIndex++]; 28416e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2842a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Read and remember all the glue-result nodes. 28432a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumNodes; ++i) { 28442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned RecNo = MatcherTable[MatcherIndex++]; 28452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (RecNo & 128) 28462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecNo = GetVBR(RecNo, MatcherTable, MatcherIndex); 28472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 28482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(RecNo < RecordedNodes.size() && "Invalid CheckSame"); 2849a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner GlueResultNodesMatched.push_back(RecordedNodes[RecNo].first.getNode()); 28502a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner continue; 28522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28536e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28542a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner case OPC_CompleteMatch: { 28552a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // The match has been completed, and any new nodes (if any) have been 28562a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created. Patch up references to the matched dag to use the newly 28572a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // created nodes. 28582a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumResults = MatcherTable[MatcherIndex++]; 28592a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 28602a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner for (unsigned i = 0; i != NumResults; ++i) { 28612a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned ResSlot = MatcherTable[MatcherIndex++]; 28622a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (ResSlot & 128) 28632a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ResSlot = GetVBR(ResSlot, MatcherTable, MatcherIndex); 28646e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28652a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(ResSlot < RecordedNodes.size() && "Invalid CheckSame"); 2866d847bc20b89679279e75412ddc51dc1d299da942Chris Lattner SDValue Res = RecordedNodes[ResSlot].first; 28676e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2868b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner assert(i < NodeToMatch->getNumValues() && 2869b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner NodeToMatch->getValueType(i) != MVT::Other && 2870f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner NodeToMatch->getValueType(i) != MVT::Glue && 2871b0e483e2c47c122f58cec4c83e37ceef92c36aefChris Lattner "Invalid number of results to complete!"); 28722a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert((NodeToMatch->getValueType(i) == Res.getValueType() || 28732a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i) == MVT::iPTR || 28742a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType() == MVT::iPTR || 28752a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeToMatch->getValueType(i).getSizeInBits() == 28762a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner Res.getValueType().getSizeInBits()) && 28772a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "invalid replacement"); 28782a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CurDAG->ReplaceAllUsesOfValueWith(SDValue(NodeToMatch, i), Res); 28792a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28802a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 288129d8f0cae425f1bba583565227eaebf58f26ce73Chris Lattner // If the root node defines glue, add it to the glue nodes to update list. 2882f1b4eafbfec976f939ec0ea3e8acf91cef5363e3Chris Lattner if (NodeToMatch->getValueType(NodeToMatch->getNumValues()-1) == MVT::Glue) 2883a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner GlueResultNodesMatched.push_back(NodeToMatch); 28846e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 2885a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner // Update chain and glue uses. 2886a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner UpdateChainsAndGlue(NodeToMatch, InputChain, ChainNodesMatched, 2887a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue, GlueResultNodesMatched, false); 28886e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28892a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner assert(NodeToMatch->use_empty() && 28902a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner "Didn't replace all uses of the node?"); 28916e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28922a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // FIXME: We just return here, which interacts correctly with SelectRoot 28932a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // above. We should fix this to not return an SDNode* anymore. 28942a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 28952a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28962a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 28976e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 28982a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If the code reached this point, then the match failed. See if there is 28992a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // another child to try in the current 'Scope', otherwise pop it until we 29002a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // find a case to check. 290119b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Match failed at index " << CurrentOpcodeIndex << "\n"); 2902bed993d8a4ede75a24a142437057b42498ce5b9fChris Lattner ++NumDAGIselRetries; 29032a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner while (1) { 29042a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (MatchScopes.empty()) { 29052a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner CannotYetSelect(NodeToMatch); 29062a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner return 0; 29072a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29082a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29092a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Restore the interpreter state back to the point where the scope was 29102a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // formed. 29112a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScope &LastScope = MatchScopes.back(); 29122a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner RecordedNodes.resize(LastScope.NumRecordedNodes); 29132a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.clear(); 29142a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NodeStack.append(LastScope.NodeStack.begin(), LastScope.NodeStack.end()); 29152a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner N = NodeStack.back(); 29162a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29172a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (LastScope.NumMatchedMemRefs != MatchedMemRefs.size()) 29182a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchedMemRefs.resize(LastScope.NumMatchedMemRefs); 29192a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatcherIndex = LastScope.FailIndex; 29206e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 292119b3826d0f0e299447d0a1c47d4fb2899d32d31fDan Gohman DEBUG(errs() << " Continuing at " << MatcherIndex << "\n"); 29226e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29232a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner InputChain = LastScope.InputChain; 2924a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner InputGlue = LastScope.InputGlue; 29252a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (!LastScope.HasChainNodesMatched) 29262a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner ChainNodesMatched.clear(); 2927a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner if (!LastScope.HasGlueResultNodesMatched) 2928a4359be0328a91971c486b06892c742de1fa0f2bChris Lattner GlueResultNodesMatched.clear(); 29292a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29302a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // Check to see what the offset is at the new MatcherIndex. If it is zero 29312a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // we have reached the end of this scope, otherwise we have another child 29322a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // in the current scope to try. 29332a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner unsigned NumToSkip = MatcherTable[MatcherIndex++]; 29342a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip & 128) 29352a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner NumToSkip = GetVBR(NumToSkip, MatcherTable, MatcherIndex); 29362a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29372a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // If we have another child in this scope to match, update FailIndex and 29382a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // try it. 29392a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner if (NumToSkip != 0) { 29402a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner LastScope.FailIndex = MatcherIndex+NumToSkip; 29412a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner break; 29422a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29436e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29442a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // End of this scope, pop it and try the next child in the containing 29452a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner // scope. 29462a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner MatchScopes.pop_back(); 29472a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29482a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner } 29492a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner} 29506e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29512a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 29522a49d57d2d9dd19125a9ba302e883f6ba6c38b83Chris Lattner 2953eeb3a00b84b7767d236ec8cf0619b9217fc247b9Dan Gohmanvoid SelectionDAGISel::CannotYetSelect(SDNode *N) { 2954e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman std::string msg; 2955e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman raw_string_ostream Msg(msg); 29565df1578decc8b05ffaec0e7f5d1532234bc1be19Chris Lattner Msg << "Cannot select: "; 29576e8f4c404825b79f9b9176483653f1aa927dfbdeAndrew Trick 29582c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (N->getOpcode() != ISD::INTRINSIC_W_CHAIN && 29592c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_WO_CHAIN && 29602c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->getOpcode() != ISD::INTRINSIC_VOID) { 29612c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner N->printrFull(Msg, CurDAG); 29622c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } else { 29632c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner bool HasInputChain = N->getOperand(0).getValueType() == MVT::Other; 29642c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner unsigned iid = 29652c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner cast<ConstantSDNode>(N->getOperand(HasInputChain))->getZExtValue(); 29662c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner if (iid < Intrinsic::num_intrinsics) 29672c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "intrinsic %" << Intrinsic::getName((Intrinsic::ID)iid); 29682c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else if (const TargetIntrinsicInfo *TII = TM.getIntrinsicInfo()) 29692c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "target intrinsic %" << TII->getName(iid); 29702c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner else 29712c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner Msg << "unknown intrinsic #" << iid; 29722c4afd1d8e3cd7cdf47a163deaf345a747541367Chris Lattner } 297375361b69f3f327842b9dad69fa7f28ae3b688412Chris Lattner report_fatal_error(Msg.str()); 2974e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman} 2975e1f188fe27050ec812e5b64cc996e6bb93300392Dan Gohman 29761997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 2977