SelectionDAGISel.cpp revision 6833b0601bdd53957db049b13dfa2e6a9e56f65f
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" 155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/ADT/BitVector.h" 16c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAGISel.h" 18a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 20adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.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" 285694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer#include "llvm/ParameterAttributes.h" 29ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen#include "llvm/CodeGen/Collector.h" 301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineJumpTableInfo.h" 3484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 36eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 386f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 44124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 457c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner#include "llvm/Support/MathExtras.h" 461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Support/Debug.h" 47a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 487e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 527944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 53a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 54a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 55a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 56a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 57a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 583e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 593e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 605bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 617944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 623e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0, ViewSUnitDAGs = 0; 637944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 647944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 65eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 66eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 67eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 68eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 69eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 70eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 71eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 73eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 75eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 76eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 774ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Chengnamespace { 78eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey cl::opt<RegisterScheduler::FunctionPassCtor, false, 79eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterPassParser<RegisterScheduler> > 80e7e7d0d7e39d0c7c659d26b97e8081fce0fcd749Dale Johannesen ISHeuristic("pre-RA-sched", 813700f90c19f51deae00f85b80d31e1f7fbda1f99Chris Lattner cl::init(&createDefaultScheduler), 825bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Instruction schedulers available (before register" 835bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner " allocation):")); 8413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 859ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey static RegisterScheduler 869373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey defaultListDAGScheduler("default", " Best scheduler for the target", 879373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey createDefaultScheduler); 884ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng} // namespace 894ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 905c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengnamespace { struct SDISelAsmOperandInfo; } 91bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 92f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// ComputeValueVTs - Given an LLVM IR type, compute a sequence of 93f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// MVT::ValueTypes that represent all the individual underlying 94f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// non-aggregate types that comprise it. 95f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnerstatic void ComputeValueVTs(const TargetLowering &TLI, const Type *Ty, 96f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner SmallVectorImpl<MVT::ValueType> &ValueVTs) { 97f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given a struct type, recursively traverse the elements. 98f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const StructType *STy = dyn_cast<StructType>(Ty)) { 99f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner for (StructType::element_iterator EI = STy->element_begin(), 100f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner EB = STy->element_end(); 101f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner EI != EB; ++EI) 102f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner ComputeValueVTs(TLI, *EI, ValueVTs); 103f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 104f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner } 105f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given an array type, recursively traverse the elements. 106f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 107f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner const Type *EltTy = ATy->getElementType(); 108f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) 109f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner ComputeValueVTs(TLI, EltTy, ValueVTs); 110f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 11123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 112f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Base case: we can get an MVT::ValueType for this LLVM IR type. 113f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner ValueVTs.push_back(TLI.getValueType(Ty)); 114f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner} 11523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 116f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnernamespace { 117864635ad7b3046d3042311423071152c613961deChris Lattner /// RegsForValue - This struct represents the physical registers that a 118864635ad7b3046d3042311423071152c613961deChris Lattner /// particular value is assigned and the type information about the value. 119864635ad7b3046d3042311423071152c613961deChris Lattner /// This is needed because values can be promoted into larger registers and 120864635ad7b3046d3042311423071152c613961deChris Lattner /// expanded into multiple smaller registers than the value. 1219525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 12223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// TLI - The TargetLowering object. 12323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const TargetLowering *TLI; 12423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 125b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// Regs - This list holds the register (for legal and promoted values) 126864635ad7b3046d3042311423071152c613961deChris Lattner /// or register set (for expanded values) that the value should be assigned 127864635ad7b3046d3042311423071152c613961deChris Lattner /// to. 1288eaff0449c70a7baa75c6ec5d1d90ea9ac2dad5aChris Lattner SmallVector<unsigned, 4> Regs; 129864635ad7b3046d3042311423071152c613961deChris Lattner 13023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// RegVTs - The value types of the registers. This is the same size 13123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// as ValueVTs; every register contributing to a given value must 13223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// have the same type. When Regs contains all virtual registers, the 13323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// contents of RegVTs is redundant with TLI's getRegisterType member 13423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// function, however when Regs contains physical registers, it is 13523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// necessary to have a separate record of the types. 136864635ad7b3046d3042311423071152c613961deChris Lattner /// 13723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<MVT::ValueType, 4> RegVTs; 138864635ad7b3046d3042311423071152c613961deChris Lattner 13923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// ValueVTs - The value types of the values, which may be promoted 14023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// or synthesized from one or more registers. 14123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<MVT::ValueType, 4> ValueVTs; 142864635ad7b3046d3042311423071152c613961deChris Lattner 14323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue() : TLI(0) {} 144864635ad7b3046d3042311423071152c613961deChris Lattner 14523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 14623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned Reg, MVT::ValueType regvt, MVT::ValueType valuevt) 14723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman : TLI(&tli), Regs(1, Reg), RegVTs(1, regvt), ValueVTs(1, valuevt) {} 14823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 149b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 150864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 15123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman : TLI(&tli), Regs(regs), RegVTs(1, regvt), ValueVTs(1, valuevt) {} 15223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 153b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 15423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const SmallVector<MVT::ValueType, 4> ®vts, 15523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const SmallVector<MVT::ValueType, 4> &valuevts) 15623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman : TLI(&tli), Regs(regs), RegVTs(regvts), ValueVTs(valuevts) {} 15723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 15823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned Reg, const Type *Ty) : TLI(&tli) { 15923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(tli, Ty, ValueVTs); 16023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 16123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned Value = 0; Value != ValueVTs.size(); ++Value) { 16223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType ValueVT = ValueVTs[Value]; 16323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 16423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = TLI->getRegisterType(ValueVT); 16523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 16623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Regs.push_back(Reg + i); 16723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegVTs.push_back(RegisterVT); 16823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Reg += NumRegs; 16923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 170864635ad7b3046d3042311423071152c613961deChris Lattner } 171864635ad7b3046d3042311423071152c613961deChris Lattner 172864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 17323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// this value and returns the result as a ValueVTs value. This uses 174864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 175b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 176864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 177b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 178c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 179c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 180c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 181c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 182b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 183c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 184b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 185c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 186c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 187c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 188c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 189c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 1909f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 191864635ad7b3046d3042311423071152c613961deChris Lattner }; 192864635ad7b3046d3042311423071152c613961deChris Lattner} 1934ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 1951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 1969373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 1979373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 1989373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 1999373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 2009373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 2019373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 2029373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2039373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 2049373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 2059373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 2069373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 2079373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 2089373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 2099373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 2109373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 2119373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2129373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2139373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 2141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 2151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 216f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 217f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 2181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 2191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 2201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 22184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo; 2221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 2241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 2261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 2271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 2291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 2319f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 2321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 2341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 2351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 2361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 2371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 238f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 239f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 240f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 241f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 242f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 24484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT)); 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 246571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 247571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 248571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 249571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 250571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 251571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 252edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2533c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 2543c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 2561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 2571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 2581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 2591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 263cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 264cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 265cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 266f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 2678806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 2688806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 269f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 270f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 271f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 273f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 274ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth/// switch or atomic instruction, which may expand to multiple basic blocks. 2751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 279f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 280571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 281f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 2841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 286bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 287f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 288f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 289bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 290bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 291bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 292f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 293bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 294bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 295bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 296bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 2971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 298edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 29984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) { 3001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 301bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 302bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 30316ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 30416ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 305bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 306bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 3071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 308bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 309bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 310bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 3112aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 3121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 3131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 314b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 3151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 316514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 317ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 318d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 319ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 320a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 321b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 322d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 3231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 3246266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 3251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3272aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 3282aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 3311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 3321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 3331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 3351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 3361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 3372aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 3381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 3391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 3401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 3411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 3431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 3441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 3458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 3468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 3478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 3488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 3497f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 3508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 3518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 352c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 353b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 354c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 3558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3593c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 3603c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 3613c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 3623c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 36323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<MVT::ValueType, 4> ValueVTs; 364b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner ComputeValueVTs(TLI, V->getType(), ValueVTs); 36595b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 36623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned FirstReg = 0; 36723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned Value = 0; Value != ValueVTs.size(); ++Value) { 36823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType ValueVT = ValueVTs[Value]; 36923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(ValueVT); 3708c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 371b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumRegs = TLI.getNumRegisters(ValueVT); 37223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 37323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned R = MakeReg(RegisterVT); 37423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman if (!FirstReg) FirstReg = R; 37523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 37623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 37723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return FirstReg; 3783c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 3811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 3821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 3831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 3841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 3851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 3861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 3871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 3881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3890da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 3901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 391d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 392d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 393d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 394d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 395d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 396d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 39786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingExports - CopyToReg nodes that copy values to virtual registers 39886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// for export to other blocks need to be emitted before any terminator 39986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instruction, but they have no other ordering requirements. We bunch them 40086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// up and the emit a single tokenfactor for them just before terminator 40186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instructions. 40286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman std::vector<SDOperand> PendingExports; 40386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 4045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 4055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 4065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 4075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 4085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 4095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 4105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 4125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 4135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 4145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 4155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 4165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 4175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 4185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 4195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 4205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 4224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 4234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 4244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 4254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 4274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 4284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 4314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 4325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 4335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 434f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 435f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 436f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 437f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 438f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 439f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 440f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 441f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 442f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 443f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 444f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 445f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 446f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 447f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 448f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 449f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 450f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 451b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 452b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 4535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 4555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 456f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 4574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 4585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 4595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 4605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 4615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 462f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 463f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 4645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 4664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 4674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 4684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 4694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 472f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 479a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 4805f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 4811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 482f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 483f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 484f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 4853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 4863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 4873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 4884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 489f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 4911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 4921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 493ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 494ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen /// GCI - Garbage collection metadata for the function. 495ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *GCI; 4961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 4985f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 499ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FunctionLoweringInfo &funcinfo, 500ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *gci) 5015f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 502ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FuncInfo(funcinfo), GCI(gci) { 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 50586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getRoot - Return the current virtual root of the Selection DAG, 50686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// flushing any PendingLoad items. This must be done before emitting 50786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// a store or any other node that may need to be ordered after any 50886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// prior load instructions. 509a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 510a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 511d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 512d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 513edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 514d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 515d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 516d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 517d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 518d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 519d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 520d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 521d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 522bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 523bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 524d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 525d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 526d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 527a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 528a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 52986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getControlRoot - Similar to getRoot, but instead of flushing all the 53086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingLoad items, flush all the PendingExports items. It is necessary 53186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// to do this before emitting a terminator instruction. 53286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// 53386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand getControlRoot() { 53486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Root = DAG.getRoot(); 53586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 53686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports.empty()) 53786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 53886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 53986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman // Turn all of the CopyToReg chains into one factored node. 54086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (Root.getOpcode() != ISD::EntryToken) { 54186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned i = 0, e = PendingExports.size(); 54286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (; i != e; ++i) { 54386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(PendingExports[i].Val->getNumOperands() > 1); 54486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports[i].Val->getOperand(0) == Root) 54586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman break; // Don't add the root if we already indirectly depend on it. 54686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 54786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 54886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (i == e) 54986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Root); 55086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 55186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 55286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 55386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman &PendingExports[0], 55486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.size()); 55586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.clear(); 55686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(Root); 55786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 55886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 55986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 56086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman void CopyValueToVirtualRegister(Value *V, unsigned Reg); 561571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 5621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 5631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 5651e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 5661e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 5671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 5681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 5691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 5711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 5721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 5731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 5741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 5781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 57928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 580466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 58195c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, unsigned Alignment); 5821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 583199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 5841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5850da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 5861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 5871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 5880da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 5891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5904e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 5915c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 592e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 593e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 594f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 595571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 596571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 597571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 5988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 599571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 6006f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands void LowerCallTo(CallSite CS, SDOperand Callee, bool IsTailCall, 601070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 602dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 6041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 606f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 6071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 6081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 609b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 610dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 611b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 612b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 613b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 614dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 615b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 616b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 617b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 618dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 619b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 620b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 621b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 6224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 6234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 6244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 6254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 626f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 6274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 6284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 6294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 6304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 63137efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 6323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 6333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 634f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 6351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 636b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 637b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 6381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6397f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 640e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 6415fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 6427f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 6437f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 6441628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 6457f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 64601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 647b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 6481628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 6497f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 6507f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 6511628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 6527f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 6531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 6557f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 6567f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 6577f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 6587f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 6597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 6607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 6617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 6627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 66324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 6643822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 6653822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 66645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 66745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 6683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 6693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 6703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 6713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 6723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 6733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 6743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 6753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 6763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 6773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 6783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 6793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 6803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 6811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6822bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 6832bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 6843e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 685c7029805ef35ce9805931067b841e6af11db382eChris Lattner 6861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 6871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 6881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 6901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 6911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 6921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 6931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 6941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 6951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 696fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 697c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 6980eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 6991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 7011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 7021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 7031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 7041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 705ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman void visitGetResult(GetResultInst &I); 70640a04216daaaee119665e023019c005306ec48acDevang Patel 7071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 7081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 7091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 7101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 7121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 7131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 7141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 7161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 7171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 719b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyFromParts - Create a value that contains the specified legal parts 720b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// combined into the value they represent. If the parts combine to a type 721b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// larger then ValueVT then AssertOp can be used to specify whether the extra 722b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 7234468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner/// (ISD::AssertSext). 7246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic SDOperand getCopyFromParts(SelectionDAG &DAG, 7256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman const SDOperand *Parts, 7266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 7276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT, 7286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT, 7294468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner ISD::NodeType AssertOp = ISD::DELETED_NODE) { 730014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts > 0 && "No parts to assemble!"); 731014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TargetLowering &TLI = DAG.getTargetLoweringInfo(); 732014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand Val = Parts[0]; 733014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 734014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts > 1) { 735014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the value from multiple parts. 736014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!MVT::isVector(ValueVT)) { 737014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned PartBits = MVT::getSizeInBits(PartVT); 738014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ValueBits = MVT::getSizeInBits(ValueVT); 739014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 740014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the power of 2 part. 741014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = NumParts & (NumParts - 1) ? 742014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1 << Log2_32(NumParts) : NumParts; 743014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = PartBits * RoundParts; 744014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType RoundVT = RoundBits == ValueBits ? 745014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT : MVT::getIntegerType(RoundBits); 746014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand Lo, Hi; 747014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 748014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts > 2) { 749014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType HalfVT = MVT::getIntegerType(RoundBits/2); 750014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT); 751014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2, 752014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, HalfVT); 7536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 754014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Parts[0]; 755014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = Parts[1]; 7566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 757014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 758014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 759014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi); 760014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 761014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts < NumParts) { 762014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the trailing non-power-of-2 part. 763014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 764014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType OddVT = MVT::getIntegerType(OddParts * PartBits); 765014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT); 766014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 767014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Combine the round and odd parts. 768014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Val; 769014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 770014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 771014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType TotalVT = MVT::getIntegerType(NumParts * PartBits); 772014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi); 773014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::SHL, TotalVT, Hi, 774014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(MVT::getSizeInBits(Lo.getValueType()), 775014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 776014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo); 777014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi); 778014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 779014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 780014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Handle a multi-element vector. 781014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType IntermediateVT, RegisterVT; 782014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumIntermediates; 783014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumRegs = 784014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 785014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands RegisterVT); 786014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 787014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 788014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 789014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == Parts[0].getValueType() && 790014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Part type doesn't match part!"); 791014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 792014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the parts into intermediate operands. 793014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SmallVector<SDOperand, 8> Ops(NumIntermediates); 794014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumIntermediates == NumParts) { 795014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the register was not expanded, truncate or copy the value, 796014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // as appropriate. 797014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumParts; ++i) 798014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 799014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 800014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts > 0) { 801014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the intermediate type was expanded, build the intermediate operands 802014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // from the parts. 803014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts % NumIntermediates == 0 && 804014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Must expand into a divisible number of parts!"); 805014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned Factor = NumParts / NumIntermediates; 806014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumIntermediates; ++i) 807014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 808014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 809014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 810014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 811014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 812014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // operands. 813014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(MVT::isVector(IntermediateVT) ? 814014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, 815014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT, &Ops[0], NumIntermediates); 8166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 817014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 8186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 819014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // There is now one part, held in Val. Correct it to match ValueVT. 820014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT = Val.getValueType(); 8216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 822014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) 823014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return Val; 824014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 825014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isVector(PartVT)) { 826014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::isVector(ValueVT) && "Unknown vector conversion!"); 827014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 8286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 8296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 830014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isVector(ValueVT)) { 831014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::getVectorElementType(ValueVT) == PartVT && 832014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::getVectorNumElements(ValueVT) == 1 && 833014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Only trivial scalar-to-vector conversions should get here!"); 834014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 835014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 8366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 837014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isInteger(PartVT) && 838014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::isInteger(ValueVT)) { 839014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::getSizeInBits(ValueVT) < MVT::getSizeInBits(PartVT)) { 840014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // For a truncate, see if we have any information to 841014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // indicate whether the truncated bits will always be 842014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // zero or sign-extension. 843014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (AssertOp != ISD::DELETED_NODE) 844014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(AssertOp, PartVT, Val, 845014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getValueType(ValueVT)); 846014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 847014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 848014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 849014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 8506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 851014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 852d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner if (MVT::isFloatingPoint(PartVT) && MVT::isFloatingPoint(ValueVT)) { 853d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner if (ValueVT < Val.getValueType()) 8544468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner // FP_ROUND's are always exact here. 855d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val, 8564468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner DAG.getIntPtrConstant(1)); 857d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val); 858d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner } 859014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 860014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::getSizeInBits(PartVT) == MVT::getSizeInBits(ValueVT)) 861014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 862014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 863014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 864d27c991cebe48fdf82b5d9eec6c2a1a244f82622Chris Lattner return SDOperand(); 8656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 8666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 867b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyToParts - Create a series of nodes that contain the specified value 868b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// split into legal parts. If the parts contain more bits than Val, then, for 869b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// integers, ExtendKind can be used to specify how to generate the extra bits. 8706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 8716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val, 8726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand *Parts, 8736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 874b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT, 875b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 87625ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 87725ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman MVT::ValueType PtrVT = TLI.getPointerTy(); 8786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT = Val.getValueType(); 879014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned PartBits = MVT::getSizeInBits(PartVT); 880014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 881014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 882014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!NumParts) 883014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 884014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 885014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!MVT::isVector(ValueVT)) { 886014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) { 887014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "No-op copy with multiple parts!"); 888014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 889014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 890014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 891014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 892014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts * PartBits > MVT::getSizeInBits(ValueVT)) { 893014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover more bits than the value has, promote the value. 894014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isFloatingPoint(PartVT) && MVT::isFloatingPoint(ValueVT)) { 895014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "Do not know what to promote to!"); 896014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 897014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 898014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 899014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ExtendKind, ValueVT, Val); 900014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 901014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 902014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 903014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (PartBits == MVT::getSizeInBits(ValueVT)) { 904014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Different types of the same size. 905014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && PartVT != ValueVT); 906014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 907014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts * PartBits < MVT::getSizeInBits(ValueVT)) { 908014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover less bits than value has, truncate the value. 909014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 910014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 911014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 912014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 913014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 914014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 915014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 917014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The value may have changed - recompute ValueVT. 918014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = Val.getValueType(); 919014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts * PartBits == MVT::getSizeInBits(ValueVT) && 920014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Failed to tile the value with PartVT!"); 921014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 922014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 923014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(PartVT == ValueVT && "Type conversion failed!"); 924014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 9256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 9266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 928014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Expand the value into multiple parts. 929014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts & (NumParts - 1)) { 930014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is not a power of 2. Split off and copy the tail. 931014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::isInteger(PartVT) && MVT::isInteger(ValueVT) && 932014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Do not know what to expand to!"); 933014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = 1 << Log2_32(NumParts); 934014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = RoundParts * PartBits; 935014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 936014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand OddVal = DAG.getNode(ISD::SRL, ValueVT, Val, 937014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(RoundBits, 938014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 939014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT); 940014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 941014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The odd parts were reversed by getCopyToParts - unreverse them. 942014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts + RoundParts, Parts + NumParts); 943014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands NumParts = RoundParts; 944014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 945014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 946014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 947014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 948014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is a power of 2. Repeatedly bisect the value using 949014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // EXTRACT_ELEMENT. 95025eb043759c23b61769108f78382eb9701c41db2Duncan Sands Parts[0] = DAG.getNode(ISD::BIT_CONVERT, 95125eb043759c23b61769108f78382eb9701c41db2Duncan Sands MVT::getIntegerType(MVT::getSizeInBits(ValueVT)), 95225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Val); 953014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 954014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i < NumParts; i += StepSize) { 955014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ThisBits = StepSize * PartBits / 2; 95625eb043759c23b61769108f78382eb9701c41db2Duncan Sands MVT::ValueType ThisVT = MVT::getIntegerType (ThisBits); 95725eb043759c23b61769108f78382eb9701c41db2Duncan Sands SDOperand &Part0 = Parts[i]; 95825eb043759c23b61769108f78382eb9701c41db2Duncan Sands SDOperand &Part1 = Parts[i+StepSize/2]; 95925eb043759c23b61769108f78382eb9701c41db2Duncan Sands 96025eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 96125eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(1, PtrVT)); 96225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 96325eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(0, PtrVT)); 96425eb043759c23b61769108f78382eb9701c41db2Duncan Sands 96525eb043759c23b61769108f78382eb9701c41db2Duncan Sands if (ThisBits == PartBits && ThisVT != PartVT) { 96625eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0); 96725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1); 96825eb043759c23b61769108f78382eb9701c41db2Duncan Sands } 969014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 970014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 971014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 972014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 973014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts, Parts + NumParts); 974014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 975014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 976014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 977014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 978014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Vector ValueVT. 979014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 9806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 9816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 9826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 983014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 984014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::getVectorElementType(ValueVT) == PartVT && 985a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorNumElements(ValueVT) == 1 && 986a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 987a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 988a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 9896183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 991014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 9926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 9936183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 9946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 9966183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 9976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 9986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 9996183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 10006183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 10016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 10026183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 10036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumElements = MVT::getVectorNumElements(ValueVT); 10046183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 10066183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 10076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 10096183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 10106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 10116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(IntermediateVT)) 10126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 10136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 10146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 101525ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 10166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 10176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 10186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 101925ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 10206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 10226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 10236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 10246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 10256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 1026532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 10276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 10286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 10296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 10306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 10316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 10326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 10336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 1034532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 10356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 10376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1039199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 1040199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 1041199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 1042199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1043199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 10446833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType(), true); 1045b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1046b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) 1047b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstant(CI->getValue(), VT); 1048b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1049b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) 1050199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 1051b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1052b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (isa<ConstantPointerNull>(C)) 1053199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 1054b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1055b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) 1056b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 1057b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 10586833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C) && !isa<VectorType>(V->getType())) 10596833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 1060b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1061b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 1062b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner visit(CE->getOpcode(), *CE); 1063b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SDOperand N1 = NodeMap[V]; 1064b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 1065b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N1; 1066b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner } 1067b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 10686833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner const VectorType *VecTy = cast<VectorType>(V->getType()); 1069b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumElements = VecTy->getNumElements(); 1070b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 10716833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // Now that we know the number and type of the elements, get that number of 10726833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // elements into the Ops array based on what kind of constant it is. 10736833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SmallVector<SDOperand, 16> Ops; 1074b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 1075b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 1076b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.push_back(getValue(CP->getOperand(i))); 1077199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 10786833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 10796833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Unknown vector constant!"); 10806833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner MVT::ValueType EltVT = TLI.getValueType(VecTy->getElementType()); 10816833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 1082b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SDOperand Op; 10836833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C)) 10846833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getNode(ISD::UNDEF, EltVT); 10856833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else if (MVT::isFloatingPoint(EltVT)) 10866833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstantFP(0, EltVT); 1087b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner else 10886833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstant(0, EltVT); 1089b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.assign(NumElements, Op); 1090199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1091b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1092b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // Create a BUILD_VECTOR node. 1093b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 1094199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1095199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1096b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // If this is a static alloca, generate it as the frameindex instead of 1097b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // computation. 1098199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 1099199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 1100b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 1101199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 1102199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 1103199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1104199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1105251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 1106251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 1107199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 11086833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner RegsForValue RFV(TLI, InReg, V->getType()); 1109b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = DAG.getEntryNode(); 1110b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 1111199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 1112199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1113199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 11141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 11151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 111686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot())); 11171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 11181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1119b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1120bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 112186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman NewValues.push_back(getControlRoot()); 112286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 1123ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 1124b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType VT = RetOp.getValueType(); 1125b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 11268e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 11278e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 1128b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (MVT::isInteger(VT)) { 1129b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType MinVT = TLI.getRegisterType(MVT::i32); 1130b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (MVT::getSizeInBits(VT) < MVT::getSizeInBits(MinVT)) 1131b988baccc229ef3e175905c999245d5544a0d384Duncan Sands VT = MinVT; 1132b988baccc229ef3e175905c999245d5544a0d384Duncan Sands } 1133b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1134b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = TLI.getNumRegisters(VT); 1135b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = TLI.getRegisterType(VT); 1136b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 1137b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1138b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1139b988baccc229ef3e175905c999245d5544a0d384Duncan Sands const Function *F = I.getParent()->getParent(); 1140b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (F->paramHasAttr(0, ParamAttr::SExt)) 1141b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::SIGN_EXTEND; 1142b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (F->paramHasAttr(0, ParamAttr::ZExt)) 1143b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::ZERO_EXTEND; 1144b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1145b988baccc229ef3e175905c999245d5544a0d384Duncan Sands getCopyToParts(DAG, RetOp, &Parts[0], NumParts, PartVT, ExtendKind); 1146b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1147b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i < NumParts; ++i) { 1148b988baccc229ef3e175905c999245d5544a0d384Duncan Sands NewValues.push_back(Parts[i]); 1149276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy())); 1150ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 11511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1152bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 1153bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 11541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1156571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 1157571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 1158571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 1159571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 1160571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 1161571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 1162571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1163571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 1164571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 1165571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1166571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 116786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(V, Reg); 1168571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1169571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 11708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 11718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 11728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 11738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 11748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 11758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 11768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 11778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 11788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 11808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 11818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 11828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 11848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 11858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 11868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 11878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 11888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 11908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 11918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 11928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 11948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 11958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 11968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11976a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 11986a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 11996a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 12006a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 12016a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 12026a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1203571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1204571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1205571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1206571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1207571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1208571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1209571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1210e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1211571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1212e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1213e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 12146a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 12156a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 12166a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1217571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1218571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1219e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1220e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1221e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1222e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 12235a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 12245a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 12255a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 12265a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 12275a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1228e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1229e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1230e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1231e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1232e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1233e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1234e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1235e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1236e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1237e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1238e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1239e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1240e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1241e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1242e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1243e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1244e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1245e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1246e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1247e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1248e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1249e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1250e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1251e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1252e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1253e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1254e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1255e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1256e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1257e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1258e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1259e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1260e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1261e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1262e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1263e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1264e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1265e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1266e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1267e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1268e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1269e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 12700da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1271e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1272571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1273571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1274571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 12755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1276571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1277571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1278571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1279571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1280571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 12816b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 12825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1283571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1284571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1285571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1286571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1287d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1288d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1289571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 1290571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 1291571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 1292571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1293d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1294d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1295d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1296d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1297d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1298d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1299d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1300d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1301571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1302d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1303d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1304d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1305d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1306d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1307d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1308d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1309d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1310d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1311d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1312d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1313d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1314d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1315d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1316d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1317d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1318d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1319d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1320d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1321d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1322d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1323d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1324571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1325571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1326df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1327df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1328df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1329df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1330df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1331df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1332df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 13330ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 13340ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 13350ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 13360ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 13370ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 13380ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 13390ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 13400ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 13410ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1342df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1343df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1344df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 13451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 13461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 13471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 13481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 13501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 13511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 13521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 13531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 13541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 13561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 13571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 135886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1359dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 136057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 136157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 136257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 136357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 136457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 136557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 136657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 136757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 136857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 136957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1370571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1371571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1372571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1373571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1374571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1375571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1376571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1377571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1378571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1379571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1380571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1381571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1382571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1383571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1384571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1385571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1386571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1387571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1388d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1389571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1390571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 13910ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 13920ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 13930ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 13940ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 13950ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1396df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1397df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1398df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1399df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1400df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1401df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1402df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1403df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1404df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1405df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1406df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 14075a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 14085a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 14090ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 14100ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 14110ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 14120ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 14130ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1414df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1415571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1416571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 14172452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 14182452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 14196b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 14205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 14212452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 14222452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 14232452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 14241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 14251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1426f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1427f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1428f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 142957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 143057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 143157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 14325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 14335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 14345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 14355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 14365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 14375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 14385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 14395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 14405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 14415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 14425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 14435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 14445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 14455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 14475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 14485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 14505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 14513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 14525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 14535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 14545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 14555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 14565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 14575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 14585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 14595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 14615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1462f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1463f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1464f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1465f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1466f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1467f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1468f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1469f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1470f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 147157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 147257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1473f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1474f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1475f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 147686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond, 147757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 147857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1479f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1480f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1481f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 148257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1483f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 148457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 148557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1486f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1487f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 14883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 148937efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 149037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1491f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 149237efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 149386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy); 14943d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 14953d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 14963d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 14973d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 149837efe6764568a3829fee26aba532283131d1a104Nate Begeman} 149937efe6764568a3829fee26aba532283131d1a104Nate Begeman 15003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 15013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 15023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 15033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 15043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 15053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 15063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 15073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 15083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 15093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 15103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 15113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 15133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 15143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 15153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 15163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 15177f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 15183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 15193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 15203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 15213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 152386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp); 15243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 15253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 15273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 15283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 15295b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 15303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 15313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 15323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 15343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 15353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 15363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 15373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 15383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 15393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 15413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 15423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 15443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 15453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 15463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 15474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 15484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 15503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 15513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 15534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 15544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 15554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 15564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 15574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 15584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 15594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 15604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 15625b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 15634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 15644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 15654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 15677f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getShiftAmountTy())) 15684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 15694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 15704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 15714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 15734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 15744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 15754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 15764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 157886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal); 15794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 15804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 15824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 15834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 15854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 15864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 15874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 15884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 15894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 15904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 15924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 15934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 15944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 15954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 15964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 15974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 15994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 16004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 16024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 16034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 16054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 16064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 16074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 16084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 160986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg, TLI.getPointerTy()); 16104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 16124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 16134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 16144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 16155b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp, 16164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 16174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 161886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), 16194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 16204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 16224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 16234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 16244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 16254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 16264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 16274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 16294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 16304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 16314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 16324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 16334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 16354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 16364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 16384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 16393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1640b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1641b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1642b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1643f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 16449fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1645fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1646fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1647fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 16486f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1649f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1650f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1651f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1652f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1653f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1654f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 165586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(&I, VMI->second); 1656f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 16579fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1658f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Drop into normal successor. 165986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1660f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.getBasicBlock(Return))); 1661070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1662f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1663f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1664f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 1665b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1666b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1667b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1668b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1669b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 16705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1671b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1672dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1673b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1674b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1675b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1676dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1677dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1678dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1679dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 16804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1681dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 16825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1683b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1684b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1685b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1686b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1687b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1688b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1689b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1690b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1691b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1692b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1693b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1694b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1695b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1696b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1697b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1698b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1699b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 17005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1701b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1702b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1703b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 17045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1705b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1706b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1707b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1708b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1709b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1710b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1711b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1712b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1713b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1714b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1715b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1716b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1717b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1718b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1719b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1720b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1721b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1722b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1723b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 17265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 17275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 17285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 17295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 17305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 17315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 17325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 17335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 17345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 17355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 17365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1737b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1738b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1739b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1740b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1741b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1742b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1743b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1744b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1745b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1746b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1747b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1748b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1749dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1750dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1751b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1752b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 17537294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 17547294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 17557294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 17567294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 17577294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1758b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1759dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1760b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1761b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1762b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1763dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1764dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1765dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 17675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 17685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 17705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 17715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 17725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1773dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17747294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1775dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1776dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 17785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1779dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1780dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 17825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 17834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 17845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1785b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1786b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1787dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1788b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1789b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1790b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1791b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1792b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1793b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1794b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1795b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1796b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1797b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1798b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1799b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1800b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1801b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1802b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1803b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1804b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1805b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1806b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1807b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 18084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1809b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1810b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1811b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1812b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 18135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 18145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 18155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 18165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 18185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 18195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 18205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1821b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1822b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1823b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 18245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1825b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1826b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 18275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1828b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1829b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1830b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1831b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1832b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1833b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1834b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1835b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1836b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1837b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1838b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1839b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1840b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1841b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1842f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1843b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1844b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1845b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1846b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1847b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1848b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1849b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1850dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1851b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1852b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1853b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1854b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1855dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1856b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1857b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1858b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1859b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1860b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1861b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1862b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1863b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1864b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1865b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1866b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1867b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1868b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1869b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1870b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1871b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1872b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1873b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1874b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1875b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1876b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 18775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 18785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 18794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 18805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1881b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1882b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1883b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 18845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 18855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 18865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 18875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 18885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 18905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 18914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 18924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 18934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1894b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 18955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 18965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 18975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 18984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1899b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1900b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 190154e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 19024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 19034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 19044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 19054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 19064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 19074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1908b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 19094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 19104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1911b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 19125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 19145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1915b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 19167294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 19177294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 19187294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 19197294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 19207294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 19217294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 1922b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1923b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1924b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 19255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1926b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1927b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1928b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1929b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1930b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1931b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1932b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1933b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1934b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 19355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 19365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 19375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 19385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1939b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1940b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1941b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1942b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1943b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1944b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1945b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1946b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1947b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1948b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1949b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 19505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 19515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 19525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1953b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1954b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1955b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1956b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1957b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1958b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1959b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1960b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1961b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 19625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 19635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1964b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1965b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1966b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1967b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1968b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1969dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1970dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1971b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1972b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 19734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 19744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 19754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 19764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 19774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 19784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 19793ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 1980b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy()); 19814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 19834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 19844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 19864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 19874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 19884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 19904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 19914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 19924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 19934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 19944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 19954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 19964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 19974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 19984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 20004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 20014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 20024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 20034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 20044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 20054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 20064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 20084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 20094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 20114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 20124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 20134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 20144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 20154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 20164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 20174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 20184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 2019ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 20204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 20214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 20224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 20234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 20244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 20264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 20274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 20294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 20304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 20314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 2032e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 20334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 20344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 20354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 20364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 20394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 20404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 20424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 20434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 20444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 20454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 20464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 20484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 20494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 20504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 20514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 20544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 20554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 2057e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 20584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 20594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 20634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 20654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 20674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 20684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 20694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 20714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 20734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 20744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 20754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 20764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 20784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 20794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 20804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 20814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 20824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 2085efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 20864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 20874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 20894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 20904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 20924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 20944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 20954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 209786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman/// Clusterify - Transform simple list of Cases into list of CaseRange's 20985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 20995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 21005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 21015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 21035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 21045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 21055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 21065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 21075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 21085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2109b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 21105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 21125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 2113a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 2114a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 211527a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 21165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 21175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 21185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 21195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 21205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 21225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 21235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 21245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 21255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 21265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 21275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 21285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 21295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 21305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 21325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 21335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 21345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 21355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 21365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 21385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 21395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 2141f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 2142f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 2143f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 2144c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 21455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 2146d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 2147f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 2148f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 21495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 2150f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 2151c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2152f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 2153d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 215486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 2155d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 2156c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2157d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 2158f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 2159f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2160f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 2161f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 2162f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 2163f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 21645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 21655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 21665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 21675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 2168c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2169f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 2170f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 2171f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 21725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 217337efe6764568a3829fee26aba532283131d1a104Nate Begeman 21743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 2175b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 21763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 21773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 21783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 21793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 21803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 21813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 21823a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 21834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 21844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 21854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 21873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 2188dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 2189dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2190dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 21914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 21923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 21933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2194dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2195dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2196dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2197dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2198dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2199dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2200f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2201f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2202f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 22033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2204b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2205b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 220624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 22079d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 22087f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 22097f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 22107f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2211c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2212c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 22139e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2214c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2215c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2216c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng SDOperand Op2 = getValue(I.getOperand(1)); 2217c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2218c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2219c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 22207f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 22217f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 22227f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 22237f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 222401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 22259e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 222601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 222701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 222801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 222901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 22307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 22317f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 22327f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2233b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2234b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 22357f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 22361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 22371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 223824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 223924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 22401628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 22411628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2242e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2243e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2244e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2245e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 22467f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(TLI.getShiftAmountTy()) < 22477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getSizeInBits(Op2.getValueType())) 2248832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 2249832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 2250832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 2251e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 22521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 22531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 225545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2256e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2257e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2258e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2259e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2260e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2261e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2262e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 226345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2264e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 226545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 226645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 226745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 226845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 226945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 227045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 227145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 227245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 227345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 227445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 227545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 227645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 227745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 227845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 227945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 228045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 228145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 228245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 228345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2284e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2285e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2286e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2287e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2288e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2289e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2290e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 2291e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2292e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2293e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2294e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2295e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2296e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2297e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2298e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2299e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2300e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 2301e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 2302e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2303e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2304e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2305e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2306e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2307e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2308e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 230945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 231045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2311e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 231245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 231345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2314e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2315e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2316e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2317e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2318e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 23191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 23221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 23231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 23241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 23257f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 23267f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 23271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 23313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 23323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 23353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 23383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 23393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 23403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 23433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 23463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 23473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 23483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 23513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 23543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 23553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23570bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0))); 23583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 23613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 23623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 23653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 23683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 23693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 23723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 23753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 23763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 23793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 23823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 23833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 23863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 23893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 23903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 23933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 23963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 23973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 23981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 2399e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 240028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 24013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 24023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 24033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 24043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 24053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 24063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 24073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 24083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 24091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 24113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 24123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 24133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 24143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 24153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 24163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 24173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 24183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 24193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 24203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 24213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 24223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 24233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 24243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 24253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 24263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 24273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 24283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 24293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 24303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 24313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 24323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 24331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24352bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2436c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2437c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2438c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2439c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2440c7029805ef35ce9805931067b841e6af11db382eChris Lattner 24417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 24427f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 24437f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2444c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2445c7029805ef35ce9805931067b841e6af11db382eChris Lattner 24462bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2447384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2448384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2449384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 24507f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2451384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2452384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2453c7029805ef35ce9805931067b841e6af11db382eChris Lattner 24543e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 24553e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 24563e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 24573e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 24583e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 24607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 24617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 24623e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 24633e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24643e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 24661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 24671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 24681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 24701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 24711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2472c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2473b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 24741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 24751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2476b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 24771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 24780bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offset)); 24791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 24801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 24811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 24821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 24837c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 24847c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 24857c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2486b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 248747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2488a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 24890bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 24900bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offs)); 24917c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 24927c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 24937c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 24947c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2495a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 24967c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 24977c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 24987c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 24997c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 25007c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 250147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 25027c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 25037c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 25047c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 25057c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 25067c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 25077c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 25087c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 25097c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 25106b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 25111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 25127c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 25131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 25147c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 25150bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner SDOperand Scale = DAG.getIntPtrConstant(ElementSize); 25167c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 25177c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 25181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 25191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 25201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 25211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 25241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 25251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 25261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 25271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 25281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2530514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 253158092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2532d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 253358092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 25341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 253668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 253768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 253868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 253968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 254068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 25411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 254268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 25430bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(TySize)); 25441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25454515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 25464515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 25474515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 25481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 25491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 25504515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 25511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 25524515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 25534515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 25544515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 25554515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 25560bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(StackAlign-1)); 25574515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 25584515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 25590bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 25601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25610bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner SDOperand Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 2562f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2563f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2564f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 25650da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 25660da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 25671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 25691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 25701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 25711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 25741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2575edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2576d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2577d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2578d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2579d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2580d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2581d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2582d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 258328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2584466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 258595c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb Root, I.isVolatile(), I.getAlignment())); 258628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 258728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 258828b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2589466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 259095c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, 259195c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb unsigned Alignment) { 25927f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman SDOperand L = 25937f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, 25947f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman isVolatile, Alignment); 2595d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 259628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2597d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2598d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2599d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 260028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 260128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 26021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 26061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 26071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 26081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 26090b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 261095c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb I.isVolatile(), I.getAlignment())); 26111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26130eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 26140eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 26150eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 26160eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 2617a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 2618a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2619a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 26200eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2621bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2622e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2623e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2624e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2625e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2626e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2627e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2628e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2629e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 26300eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26310eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 26320eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 26330eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26340eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 26350eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 26360eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 26370eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 26380eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 26390eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 26400eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26410eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26420eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 26430eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 26440eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 26457f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(VT)) { 26469d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 26470eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 26480eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26490eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 26500eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 26510eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26520eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26530eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 26540eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 26550eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26560eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 26570eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 26580eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2659f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2660f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 26610eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 266248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 266348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2664f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2665f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 266648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2667f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2668f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 266948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2670f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2671f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 267248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2673e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2674e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2675e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2676e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2677e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2678e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2679e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 26800eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 26819d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 26827f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = TLI.getValueType(PTy); 26837f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 26840eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26850eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 26860eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26870eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 26880eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2689b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 2690cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 2691b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands V = IntrinsicInst::StripPointerCasts(V); 2692b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 26934c71dfe356716e6bc1993ef5efdced08b68fe612Anton Korobeynikov assert ((GV || isa<ConstantPointerNull>(V)) && 2694cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 2695cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 2696cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 2697cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2698f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 2699cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 2700f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 2701f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 2702f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 2703f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 2704f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 2705f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 2706f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 2707f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 2708f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2709f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 2710f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 2711f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 2712cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 2713cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2714cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 2715cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 2716cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 27176590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 2718cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 2719cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2720cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 2721cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 2722cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 2723cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2724cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2725cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 2726cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2727cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 27286590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 27296590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 27306590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 27316590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 27326590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 27336590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 27346590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 27356590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 27366590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 27376590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 27386590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 2739cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2740cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 2741cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2742f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 2743cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2744cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 2745cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 2746cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 2747cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2748f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2749cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2750f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 2751f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2752c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2753c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2754c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2755c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2756c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2757c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 27580eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 27590eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 27600eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 27610eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2762c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2763c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2764c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2765bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2766bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2767bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2768bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2769bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2770bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2771bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2772bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2773c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2774d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2775c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2776c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2777d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2778c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 277903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 2780707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memcpy_i64: { 2781707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 2782707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 2783707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 2784707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 2785707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 2786707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 278703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2788707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 278903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 2790707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memset_i64: { 2791707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 2792707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 2793707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 2794707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 2795707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align, 2796707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0)); 279703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2798707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 279903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 2800707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memmove_i64: { 2801707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 2802707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 2803707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 2804707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 2805707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 2806707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // If the source and destination are known to not be aliases, we can 2807707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // lower memmove as memcpy. 2808707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman uint64_t Size = -1ULL; 2809707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 2810707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman Size = C->getValue(); 2811707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 2812707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman AliasAnalysis::NoAlias) { 2813707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 2814707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 2815707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman return 0; 2816707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 2817707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 2818707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align, 2819707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 282003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2821707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 282286cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 282344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 282443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 282544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2826bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 282736ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2828bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2829bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2830bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2831ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 283244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2833ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 283443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 283543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2836bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2837bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2838ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2839bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 284086cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 284143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2842b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 284336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 284443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 284544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 284643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 284744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 284844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 28491ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2850bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 2851bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(0, MVT::i32))); 285243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 285343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2854b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 285543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 285643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 285744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 285843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 285944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 286044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 2861bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2862bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 2863bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(0, MVT::i32))); 286443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 286543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2866b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 286743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 286843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 286944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 28701b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (!MMI) return 0; 287143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 28721b08bbca5592351a940bcd164bdec724ee954326Evan Cheng Value *SP = FSI.getSubprogram(); 28731b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (SP && MMI->Verify(SP)) { 28741b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is 28751b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // what (most?) gdb expects. 28761b08bbca5592351a940bcd164bdec724ee954326Evan Cheng DebugInfoDesc *DD = MMI->getDescFor(SP); 28771b08bbca5592351a940bcd164bdec724ee954326Evan Cheng assert(DD && "Not a debug information descriptor"); 28781b08bbca5592351a940bcd164bdec724ee954326Evan Cheng SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD); 28791b08bbca5592351a940bcd164bdec724ee954326Evan Cheng const CompileUnitDesc *CompileUnit = Subprogram->getFile(); 28801b08bbca5592351a940bcd164bdec724ee954326Evan Cheng unsigned SrcFile = MMI->RecordSource(CompileUnit->getDirectory(), 28811b08bbca5592351a940bcd164bdec724ee954326Evan Cheng CompileUnit->getFileName()); 28821b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // Record the source line but does create a label. It will be emitted 28831b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // at asm emission time. 28841b08bbca5592351a940bcd164bdec724ee954326Evan Cheng MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile); 288543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 288643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2887b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 288843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 288943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 289044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 289143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 2892a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng Value *Variable = DI.getVariable(); 2893a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng if (MMI && Variable && MMI->Verify(Variable)) 2894a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(), 2895a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng getValue(DI.getAddress()), getValue(Variable))); 289643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 289743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2898c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2899b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 29001532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (!CurMBB->isLandingPad()) { 29011532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // FIXME: Mark exception register as live in. Hack for PR1508. 29021532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen unsigned Reg = TLI.getExceptionAddressRegister(); 29031532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (Reg) CurMBB->addLiveIn(Reg); 2904735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 29051532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Insert the EXCEPTIONADDR instruction. 29061532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 29071532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Ops[1]; 29081532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Ops[0] = DAG.getRoot(); 29091532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 29101532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, Op); 29111532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.setRoot(Op.getValue(1)); 2912b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2913b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2914b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 29158806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 29168806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 2917b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 29188806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 29198806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 29208806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 29211532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 2922f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 2923f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 2924e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 2925f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 2926f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 2927f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 2928902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 2929902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 2930902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2931e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 2932735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2933735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 29348806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 2935735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2936735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2937735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2938735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2939735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2940735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 29417a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 29428806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 2943b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2944b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2945b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2946b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 29478806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 29488806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 29498806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 2950b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 29518806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 29528806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 2953735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2954735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2955735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 2956cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 29573b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2958735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 29598806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 29607a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 2961f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 29628806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 2963b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2964b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2965b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2966b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2967b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 29682365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 29692365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 29702365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29711532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 29722365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 29732365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 29742365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 297586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman getControlRoot(), 29762365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 29772365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 29782365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 29792365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 29802365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29812365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29822365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 29832365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29842365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29852365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 29862365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 29872365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 29882365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29892365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29902365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 29912365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 29922365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29932365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 29941532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen MVT::ValueType VT = getValue(I.getOperand(1)).getValueType(); 29951532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand CfaArg; 29961532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 29971532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::TRUNCATE, 29981532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 29991532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen else 30001532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 30011532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 30021532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen 30031532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Offset = DAG.getNode(ISD::ADD, 30041532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 30051532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 30061532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy()), 30071532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg); 30081532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, DAG.getNode(ISD::ADD, 30091532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 30101532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAMEADDR, 30111532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 30121532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getConstant(0, 30131532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy())), 30141532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Offset)); 30152365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 30162365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 30172365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 30189ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 3019c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 3020c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 3021c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 3022c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 30239ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 30246ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 30256ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 30266ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 30276ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 30286ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 3029ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 3030ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 3031ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3032ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3033ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3034ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 3035ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 3036ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3037ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3038ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3039ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 3040ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 3041ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3042ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 3043ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 3044ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3045c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 3046c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 3047c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 3048c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3049c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 30508b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 3051bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 3052f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 3053f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 3054f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 30558b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 30568b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 305751b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 30588b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 3059c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 30603f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 3061f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 3062f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 3063f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 3064f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 3065f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 3066f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 30673f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 3068addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 3069a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 3070d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 3071d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 3072d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 3073d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 3074a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 3075a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3076a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3077a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 3078a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3079c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3080a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3081a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 3082a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3083a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3084a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 3085a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3086c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3087a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3088a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 3089a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3090a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3091a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 3092a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3093c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3094a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3095140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 3096bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 3097f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 3098f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 3099140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 3100140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 3101140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 3102140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 310339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 310439a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 310539a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 3106140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 310739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 310824e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 310924e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 311024e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 311136397f50343639ce9a25996f2d790c656791ab92Duncan Sands 311236397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 311336397f50343639ce9a25996f2d790c656791ab92Duncan Sands const Function *F = 311436397f50343639ce9a25996f2d790c656791ab92Duncan Sands cast<Function>(IntrinsicInst::StripPointerCasts(I.getOperand(2))); 311536397f50343639ce9a25996f2d790c656791ab92Duncan Sands 311636397f50343639ce9a25996f2d790c656791ab92Duncan Sands SDOperand Ops[6]; 311736397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 311836397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 311936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 312036397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 312136397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 312236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 312336397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3124f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands SDOperand Tmp = DAG.getNode(ISD::TRAMPOLINE, 3125f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 3126f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 3127f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 3128f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 3129f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 3130f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 313136397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 313236397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 3133ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3134ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcroot: 3135ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (GCI) { 3136ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Value *Alloca = I.getOperand(1); 3137ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Constant *TypeMap = cast<Constant>(I.getOperand(2)); 3138ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3139ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val); 3140ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI->addStackRoot(FI->getIndex(), TypeMap); 3141ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen } 3142ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3143ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3144ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcread: 3145ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcwrite: 3146ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen assert(0 && "Collector failed to lower gcread/gcwrite intrinsics!"); 3147ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3148ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3149917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 31501a0248690aaa9f7baaf1247e5f65a1c0c9e3783cDan Gohman setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32)); 3151917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 3152917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 315366fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov 315466fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov case Intrinsic::trap: { 315566fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot())); 315666fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov return 0; 315766fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov } 315827b7db549e4c5bff4579d209304de5628513edebEvan Cheng case Intrinsic::prefetch: { 315927b7db549e4c5bff4579d209304de5628513edebEvan Cheng SDOperand Ops[4]; 316027b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[0] = getRoot(); 316127b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[1] = getValue(I.getOperand(1)); 316227b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[2] = getValue(I.getOperand(2)); 316327b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[3] = getValue(I.getOperand(3)); 316427b7db549e4c5bff4579d209304de5628513edebEvan Cheng DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4)); 316527b7db549e4c5bff4579d209304de5628513edebEvan Cheng return 0; 316627b7db549e4c5bff4579d209304de5628513edebEvan Cheng } 316727b7db549e4c5bff4579d209304de5628513edebEvan Cheng 316822c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth case Intrinsic::memory_barrier: { 316922c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth SDOperand Ops[6]; 317022c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[0] = getRoot(); 317122c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth for (int x = 1; x < 6; ++x) 317222c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[x] = getValue(I.getOperand(x)); 317322c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth 317422c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6)); 317522c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth return 0; 317622c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth } 3177ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_lcs: { 3178ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3179ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O3 = getValue(I.getOperand(3)); 3180ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_LCS, Root, 3181ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3182ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(2)), 3183ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O3, O3.getValueType()); 3184ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3185ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3186ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3187ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3188ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_las: { 3189ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3190ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O2 = getValue(I.getOperand(2)); 3191ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_LAS, Root, 3192ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3193ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O2, O2.getValueType()); 3194ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3195ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3196ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3197ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3198ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_swap: { 3199ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3200ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O2 = getValue(I.getOperand(2)); 3201ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_SWAP, Root, 3202ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3203ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O2, O2.getValueType()); 3204ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3205ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3206ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3207ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3208ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth 3209c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3210c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 3211c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3212c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 32136f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sandsvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDOperand Callee, 32141da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 3215070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 32166f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 3217735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 3218070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 3219070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 32206f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3221735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 3222735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 32236f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 32246f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 32256f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 32266f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands SDOperand ArgNode = getValue(*i); 32276f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 32286f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 32296f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 32306f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 32316f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 32326f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 32336f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 32346f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 32356f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 323608e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen Entry.Alignment = CS.getParamAlignment(attrInd); 3237735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 3238735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 3239735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 32401532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3241070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 3242070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 3243070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 3244a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // Both PendingLoads and PendingExports must be flushed here; 3245a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // this call might not return. 3246a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen (void)getRoot(); 3247a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getControlRoot(), 3248bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(BeginLabel, MVT::i32), 3249bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 3250070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 32516f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3252735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 32536f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 32546f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 325500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CS.paramHasAttr(0, ParamAttr::ZExt), 32566f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 3257735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 32586f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 32596f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 3260735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 3261070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 32621532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3263070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 3264070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 3265070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 3266070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 3267bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(EndLabel, MVT::i32), 3268bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 3269070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 32706f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 3271070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 3272070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 3273735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 3274735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3275735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 32761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 327764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 3278c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 327987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3280c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3281c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3282c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3283c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 328487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 328587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 328687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 328787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 328887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 328987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 329087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 329187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 329287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 329387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 329487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 329587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 329687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 329787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 329887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 329987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand LHS = getValue(I.getOperand(1)); 330087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand RHS = getValue(I.getOperand(2)); 330187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 330287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 330387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 330487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 330587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 330687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 33072f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 33082f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 330987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 331087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 331187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 331287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 331387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 331487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 331587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 331687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 331787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 33182f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 33192f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 332087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 332187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 332287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 332387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 332487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 332587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 332687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 332787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 332887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 33292f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 33302f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 333187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 333287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 333387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 333487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 333587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 333687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3337f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3338c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 333987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3340ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3341fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3342ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3343c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3344edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 334564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 334664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 334764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 334864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 334964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3350070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 33516f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 33521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 33531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3354735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3355ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohmanvoid SelectionDAGLowering::visitGetResult(GetResultInst &I) { 335667780f108ccb509dffe3ff63d3826ea6accb1bb1Dan Gohman if (isa<UndefValue>(I.getOperand(0))) { 33573dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman SDOperand Undef = DAG.getNode(ISD::UNDEF, TLI.getValueType(I.getType())); 33583dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman setValue(&I, Undef); 33596833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return; 33603dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman } 33616833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 33626833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // To add support for individual return values with aggregate types, 33636833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // we'd need a way to take a getresult index and determine which 33646833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // values of the Call SDNode are associated with it. 33656833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert(TLI.getValueType(I.getType(), true) != MVT::Other && 33666833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Individual return values must not be aggregates!"); 33676833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 33686833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand Call = getValue(I.getOperand(0)); 33696833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner setValue(&I, SDOperand(Call.Val, I.getIndex())); 3370ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman} 3371ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 3372ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 3373b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3374b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3375b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3376b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3377b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan GohmanSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 33786833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand &Chain, 33796833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand *Flag) const { 338023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Assemble the legal parts into the final values. 338123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 4> Values(ValueVTs.size()); 33826833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SmallVector<SDOperand, 8> Parts; 33836833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 338423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Copy the legal parts from the registers. 338523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType ValueVT = ValueVTs[Value]; 338623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 338723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = RegVTs[Value]; 338823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 33896833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Parts.resize(NumRegs); 339023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 33916833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand P; 33926833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 33936833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT); 33946833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 33956833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag); 339623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman *Flag = P.getValue(2); 33976833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 33986833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = P.getValue(1); 339923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Parts[Part+i] = P; 340023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3401b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 340223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Values[Value] = getCopyFromParts(DAG, &Parts[Part], NumRegs, RegisterVT, 340323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ValueVT); 340423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumRegs; 340523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 34066833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 34076833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (ValueVTs.size() == 1) 34086833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return Values[0]; 34096833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 341023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return DAG.getNode(ISD::MERGE_VALUES, 341123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman DAG.getVTList(&ValueVTs[0], ValueVTs.size()), 341223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Values[0], ValueVTs.size()); 3413b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3414b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3415b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3416b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 3417b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3418b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3419b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohmanvoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 3420b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const { 3421b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 342223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = Regs.size(); 342323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 8> Parts(NumRegs); 34246833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 342523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType ValueVT = ValueVTs[Value]; 342623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumParts = TLI->getNumRegisters(ValueVT); 342723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = RegVTs[Value]; 342823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 342923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman getCopyToParts(DAG, Val.getValue(Val.ResNo + Value), 343023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Parts[Part], NumParts, RegisterVT); 343123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumParts; 343223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3433b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3434b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 343523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 8> Chains(NumRegs); 343623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 34376833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand Part; 34386833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 34396833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 34406833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 34416833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag); 3442b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 34436833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 34446833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chains[i] = Part.getValue(0); 3445c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 34466833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 34476833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (NumRegs == 1) 34486833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = Chains[0]; 34496833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else 34506833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 3451c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3452864635ad7b3046d3042311423071152c613961deChris Lattner 3453c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3454c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3455c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3456c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 34579f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 34584b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 34594b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 34606833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) { 34616833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]); 346223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = RegVTs[Value]; 34636833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned i = 0; i != NumRegs; ++i) 34646833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT)); 346523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3466c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3467864635ad7b3046d3042311423071152c613961deChris Lattner 3468864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3469864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3470864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3471864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 34729b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 34736f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetLowering &TLI, 34746f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI) { 3475f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 3476f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 34776f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 34786f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman E = TRI->regclass_end(); RCI != E; ++RCI) { 3479f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 3480f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 34819b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 34829b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 34839b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 34849b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 34859b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 34869b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3487f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3488f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3489f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 3490f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 3491f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 3492f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3493f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3494f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 34959b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 34969b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 34979b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3498f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 34999b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3500864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3501864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3502864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3503864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 35049b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 35059b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3506f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3507f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3508f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3509f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3510f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3511f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3512f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3513864635ad7b3046d3042311423071152c613961deChris Lattner } 3514f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3515864635ad7b3046d3042311423071152c613961deChris Lattner} 3516864635ad7b3046d3042311423071152c613961deChris Lattner 3517bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3518bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3519bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3520bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 35215c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengstruct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo { 35225c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// CallOperand - If this is the result output operand or a clobber 35235c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// this is null, otherwise it is the incoming operand to the CallInst. 35245c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// This gets modified as the asm is processed. 3525bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SDOperand CallOperand; 35265c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng 3527e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3528e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3529e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3530e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 353123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 35325c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 3533bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3534bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3535e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3536e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3537e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3538e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 35397cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner std::set<unsigned> &InputRegs, 35407cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) const { 35417cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isOutReg) { 35427cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 35437cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 35447cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 35457cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isInReg) { 35467cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 35477cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 35487cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 35497cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 35507cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner 35517cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattnerprivate: 35527cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// MarkRegAndAliases - Mark the specified register and all aliases in the 35537cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// specified set. 35547cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 35557cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) { 35567cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 35577cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(Reg); 35587cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 35597cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (; *Aliases; ++Aliases) 35607cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(*Aliases); 35617cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 3562bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3563bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3564bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3565bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 35660fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// GetRegistersForValue - Assign registers (virtual or physical) for the 35670fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// specified operand. We prefer to assign virtual registers, to allow the 35680fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// register allocator handle the assignment process. However, if the asm uses 35690fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// features that we can't model on machineinstrs, we have SDISel do the 35700fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// allocation. This produces generally horrible, but correct, code. 35710fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 35720fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// OpInfo describes the operand. 35730fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// HasEarlyClobber is true if there are any early clobber constraints (=&r) 35740fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// or any explicitly clobbered registers. 35750fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// Input and OutputRegs are the set of already allocated physical registers. 35760fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 3577e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 35785c80760fdf71659c5bdf45cd85d173df454dfb41Evan ChengGetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 3579864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 35804e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3581e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3582e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3583e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3584e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3585e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3586e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3587e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3588e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3589e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3590e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3591e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3592e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3593e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3594e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3595e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3596e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3597e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3598e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3599e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3600e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3601e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3602e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3603e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3604e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3605e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3606b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SmallVector<unsigned, 4> Regs; 3607e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3608e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3609e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3610e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3611e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3612e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3613864635ad7b3046d3042311423071152c613961deChris Lattner 3614bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3615bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3616b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 3617864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 3618bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ValueVT = OpInfo.ConstraintVT; 3619864635ad7b3046d3042311423071152c613961deChris Lattner 3620bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 36212a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 36222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3623864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3624bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 3625864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3626cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3627cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3628cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3629cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3630cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3631864635ad7b3046d3042311423071152c613961deChris Lattner 3632864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3633864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 3634864635ad7b3046d3042311423071152c613961deChris Lattner 3635864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 3636864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 3637864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 3638864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 3639864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 3640864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 3641864635ad7b3046d3042311423071152c613961deChris Lattner 3642864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 3643864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 3644864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 3645864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 3646864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 3647864635ad7b3046d3042311423071152c613961deChris Lattner } 3648864635ad7b3046d3042311423071152c613961deChris Lattner } 364923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 36507cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 36517cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 3652e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3653864635ad7b3046d3042311423071152c613961deChris Lattner } 3654864635ad7b3046d3042311423071152c613961deChris Lattner 36552a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 36562a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 36572a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 3658c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 3659c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 36602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 36612a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 36622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 3663e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 3664e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 3665e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 3666e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 3667e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 36682a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 36693a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 3670bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 36713a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 36722a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 36732a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 367484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo = MF.getRegInfo(); 36752a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 367684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second)); 36772a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 367823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 3679e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 36802a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 36812a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 36822a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 36832a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 36842a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 36852a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 36862a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 36872a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 36882a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 36892a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 3690bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 3691bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 36922a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 3693e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 36946f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 3695864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 3696864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 3697864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 36984e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 3699864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 3700864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 3701864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3702864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3703864635ad7b3046d3042311423071152c613961deChris Lattner continue; 3704864635ad7b3046d3042311423071152c613961deChris Lattner } 3705864635ad7b3046d3042311423071152c613961deChris Lattner 37064e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 37074e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 3708c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 37096f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman RC = isAllocatableRegister(Reg, MF, TLI, TRI); 3710c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 3711c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 3712c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 3713c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 3714c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 37154e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 37164e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3717864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 3718864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 3719864635ad7b3046d3042311423071152c613961deChris Lattner 3720e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 3721864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 3722864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 3723864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 3724864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 3725e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 3726e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 3727864635ad7b3046d3042311423071152c613961deChris Lattner 372823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(), 3729e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 37307cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 3731e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3732864635ad7b3046d3042311423071152c613961deChris Lattner } 37334e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 3734864635ad7b3046d3042311423071152c613961deChris Lattner 3735864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 3736e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 37374e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 37384e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 37393ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 3740ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 3741ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 3742fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 3743fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 3744ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37450c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 37465c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng std::vector<SDISelAsmOperandInfo> ConstraintOperands; 3747ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3748ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 3749ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 3750ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37514e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 37520c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 37530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 37540c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 37550c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 37560c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 3757e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3758e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 3759e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 3760e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 3761e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 3762e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3763fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 3764acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner unsigned ResNo = 0; // ResNo - The result number of the next output. 37650c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 37665c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 37675c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 37680c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 37690c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner MVT::ValueType OpVT = MVT::Other; 37701efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 37710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 37720c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 37731efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 3774acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // Indirect outputs just consume an argument. 3775acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (OpInfo.isIndirect) { 3776fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 3777acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner break; 3778acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } 3779acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // The return value of the call is this value. As such, there is no 3780acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // corresponding argument. 3781acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 3782acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (const StructType *STy = dyn_cast<StructType>(CS.getType())) { 3783acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(STy->getElementType(ResNo)); 3784acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } else { 3785acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(ResNo == 0 && "Asm only has one result!"); 3786acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(CS.getType()); 37871efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 3788acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner ++ResNo; 37891efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 37901efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 3791fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 37921efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 37931efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 37940c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 37951efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 37961efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 37970c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 37980c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 3799eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 38000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 3801507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) 3802507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]); 3803eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 3804eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 3805eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 3806eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 3807eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 3808eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 3809eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 3810eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 3811eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If OpTy is not a first-class value, it may be a struct/union that we 3812eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 3813eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (!OpTy->isFirstClassType() && OpTy->isSized()) { 3814eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 3815eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 3816eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 3817eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 3818eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 3819eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 3820eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 3821eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 3822eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 3823eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 3824eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 38256995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 3826eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 3827eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 38280c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 38290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 38301efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 38310c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 38322a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 38333ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 38345a09690446a36f94f990db7d18d9b9ac8587888aChris Lattner TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG); 38351efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3836e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 3837e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 383809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 38390fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner // If we see a clobber of a register, it is an early clobber. 384069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (!SawEarlyClobber && 384169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.Type == InlineAsm::isClobber && 384269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) { 384369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // Note that we want to ignore things that we don't trick here, like 384469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // dirflag, fpsr, flags, etc. 384569e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 384669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 384769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintVT); 384869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (PhysReg.first || PhysReg.second) { 384969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // This is a register we know of. 385069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner SawEarlyClobber = true; 385169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 385269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 38530fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner 385409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 385509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 385609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 385709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 385809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 385909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 386009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 386109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 386209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 386309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 386409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 386509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 386609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 386709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 386809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 386909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 387009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 387109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 387209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 387309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 387409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 387509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 3876514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 387709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 387809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 387909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 388009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 388109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 388209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 388309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 388409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 388509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 388609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 388709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 388809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 388909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 389009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 3891e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 3892e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 3893e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 3894e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 38950c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 38960c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 38970c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 38980c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 3899e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 3900e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 3901e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 39025c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 3903e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3904e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 3905e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 3906e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 3907e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 3908e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3909e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 39100c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 39110c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 39120c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 39130c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 39140c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 39150c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 39162cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 39170f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 39180f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3919864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 39200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 39210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 3922864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 39230f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 39240c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 39255c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 39261efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 39270c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 39282cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 3929c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 3930c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 3931f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 393209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 393322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 393422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 393522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3936c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3937c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 393809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 393922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 394022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 394122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 39422a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 394322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3944864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3945864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3946e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 3947832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 39480c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 3949d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3950d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 39512cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 39520c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (!OpInfo.isIndirect) { 39530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // This is the result value of the call. 3954864635ad7b3046d3042311423071152c613961deChris Lattner assert(RetValRegs.Regs.empty() && 39552cc2f66c25d9576743026688fdae5ed402726532Chris Lattner "Cannot have multiple output constraints yet!"); 3956fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 3957e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RetValRegs = OpInfo.AssignedRegs; 39582cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } else { 3959e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 39600c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 39612cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 39626656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 39636656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 39646656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3965e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 3966e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 39676656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 39686656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 39696656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 39700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 39713d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 39720c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 39732223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 39742223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 39750c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 39763d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 3977c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 3978c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 3979c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 3980c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 3981c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 3982c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3983c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3984a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 3985a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 3986c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 3987c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 3988c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 3989c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 3990c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 3991c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 3992527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 3993527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 3994527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 399523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.TLI = &TLI; 399623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.ValueVTs.resize(1, InOperandVal.getValueType()); 399723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.RegVTs.resize(1, AsmNodeOperands[CurOp+1].getValueType()); 3998527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 3999527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 4000527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 4001527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 4002527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 4003c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4004527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 4005b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 4006527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 4007527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 4008527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 4009527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 4010f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner assert((NumOps >> 3) == 1 && "Unexpected number of operands"); 4011f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner // Add information to the INLINEASM node to know about this input. 4012f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4013f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4014f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner TLI.getPointerTy())); 4015f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 4016f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner break; 4017c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 401887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 401987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 40202a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 40210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 402244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 402344b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 402448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner std::vector<SDOperand> Ops; 402548884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 402648884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 402748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 4028832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 40290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 403053069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 403153069fbbae2558a3138df24776448791fea3aceeChris Lattner } 4032c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 403387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 403448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 4035c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4036c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 403748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 403887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 40392a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 404009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 404144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 404244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 404344b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 404487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 404587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4046c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4047c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 404887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 4049c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 40502223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 405187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 40522a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 40532a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 40542a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 40550c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 405644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 405787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 405887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 4059e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 4060e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 406187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4062b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 406387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4064e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 4065e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 40666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 40676656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4068c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 4069c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 4070c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 4071e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 4072e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 4073e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 40746656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 40756656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4076c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 40776656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4078ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4079ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 4080ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 4081ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 4082ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4083f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 4084f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 4085bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 4086ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 4087ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 40886656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 40896656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 40903a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 4091b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 40923a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 40933a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // If the result of the inline asm is a vector, it may have the wrong 40943a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // width/num elts. Make sure to convert it to the right type with 40957f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 40967f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(Val.getValueType())) { 4097fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands const VectorType *VTy = cast<VectorType>(CS.getType()); 40987f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType DesiredVT = TLI.getValueType(VTy); 40993a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 41007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, DesiredVT, Val); 41013a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 41023a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 4103fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 41043a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 41056656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 41066656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 41076656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 41086656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 41096656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 41106656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 4111864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 41126656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 4113b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 4114864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 41156656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4116ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41176656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 4118bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 41196656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 41200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 41216656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 41228b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 41236656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 4124bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 4125bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 4126ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 4127ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 4128ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4129ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 41311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 41321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 413468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 413568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 413668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 413768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 413868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 41391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 4141514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 41421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 41430bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner Src, DAG.getIntPtrConstant(ElementSize)); 41441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 414547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 414647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 414747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 414847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 414947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 4150cf5734dddd66af9388a171b44996505ede47feedChris Lattner 4151cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 415200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C, 415300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG); 4154cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 4155cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 41561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 41571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 415947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 416047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 416147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 416247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 416347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 41641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 4165cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 416600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, 416700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CallingConv::C, true, 4168cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 4169cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 41701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 41711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4172ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 4173ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 4174025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 4175025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 4176025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 4177ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 4178025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 4179832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 4180832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 4181ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng << "TargetLowering::EmitInstrWithCustomInserter!\n"; 4182025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 4183025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 4184025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 4185025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 418639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 4187acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 4188acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4189acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 419039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 419139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 41921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 4193acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 4194acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 4195acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 4196acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 4197acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 41981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 41991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 4201acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 4202acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4203acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 42041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 4207acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 4208acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4209acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 4210acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 4211acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 42121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4214fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 4215fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 4216f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 4217f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 4218fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 4219fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 4220fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 4221fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 42228c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 4223fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 4224fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 4225fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4226fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 4227fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 42286aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 4229ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 4230ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 4231fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 4232276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy Flags; 42337aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4234d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 42357aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 4236afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::ZExt)) 4237276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setZExt(); 4238afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::SExt)) 4239276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSExt(); 4240afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::InReg)) 4241276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setInReg(); 4242afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::StructRet)) 4243276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSRet(); 4244afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::ByVal)) { 4245276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByVal(); 4246594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const PointerType *Ty = cast<PointerType>(I->getType()); 4247a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands const Type *ElementTy = Ty->getElementType(); 4248276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4249a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 425008e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // For ByVal, alignment should be passed from FE. BE will guess if 425108e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // this info is not there but there are cases it cannot get right. 425208e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen if (F.getParamAlignment(j)) 4253276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands FrameAlign = F.getParamAlignment(j); 4254276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValAlign(FrameAlign); 4255276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValSize(FrameSize); 4256594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola } 4257afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::Nest)) 4258276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setNest(); 4259276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setOrigAlign(OriginalAlignment); 4260b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4261b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType RegisterVT = getRegisterType(VT); 4262b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumRegs = getNumRegisters(VT); 4263b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i != NumRegs; ++i) { 4264b988baccc229ef3e175905c999245d5544a0d384Duncan Sands RetVals.push_back(RegisterVT); 42659701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray ISD::ArgFlagsTy MyFlags = Flags; 4266c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray if (NumRegs > 1 && i == 0) 42676ccbbd89906157187ac04b2b3237c4aee7acd095Nicolas Geoffray MyFlags.setSplit(); 4268b988baccc229ef3e175905c999245d5544a0d384Duncan Sands // if it isn't first piece, alignment must be 1 4269c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray else if (i > 0) 42709701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray MyFlags.setOrigAlign(1); 42719701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray Ops.push_back(DAG.getArgFlags(MyFlags)); 4272b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 4273fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 42743b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 42758c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 4276fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4277fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 4278f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 427986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner DAG.getVTList(&RetVals[0], RetVals.size()), 4280bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 428186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 428286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but 428386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // allows exposing the loads that may be part of the argument access to the 428486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // first DAGCombiner pass. 428586ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner SDOperand TmpRes = LowerOperation(SDOperand(Result, 0), DAG); 428686ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 428786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // The number of results should match up, except that the lowered one may have 428886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // an extra flag result. 428986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner assert((Result->getNumValues() == TmpRes.Val->getNumValues() || 429086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner (Result->getNumValues()+1 == TmpRes.Val->getNumValues() && 429186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag)) 429286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner && "Lowering produced unexpected number of results!"); 429386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner Result = TmpRes.Val; 429486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 429527a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 429627a70be55f8b63181598d144d034b396402be66eDan Gohman DAG.setRoot(SDOperand(Result, NumArgRegs)); 4297fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4298fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 4299fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 4300fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 430147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 430247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 430347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 4304fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 4305b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = getRegisterType(VT); 4306b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4307b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = getNumRegisters(VT); 4308b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 4309b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned j = 0; j != NumParts; ++j) 4310b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Parts[j] = SDOperand(Result, i++); 4311b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4312b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 4313b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (F.paramHasAttr(Idx, ParamAttr::SExt)) 4314b988baccc229ef3e175905c999245d5544a0d384Duncan Sands AssertOp = ISD::AssertSext; 4315b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 4316b988baccc229ef3e175905c999245d5544a0d384Duncan Sands AssertOp = ISD::AssertZext; 4317b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4318b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Ops.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT, 43194468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner AssertOp)); 4320fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 432127a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 4322fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 4323fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 4324fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4325f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4326f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 4327f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 4328f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 4329f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 4330f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 433100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan SandsTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 433200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands bool RetSExt, bool RetZExt, bool isVarArg, 433300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands unsigned CallingConv, bool isTailCall, 4334f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 4335f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4336be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 4337f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4338f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4339f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4340f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4341f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4342f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4343f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4344f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 434547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 434647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 4347276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy Flags; 43487aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4349d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 4350276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands 4351d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 4352276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setZExt(); 4353276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands if (Args[i].isSExt) 4354276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSExt(); 43550db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 4356276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setInReg(); 43570db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 4358276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSRet(); 435921485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola if (Args[i].isByVal) { 4360276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByVal(); 436121485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const PointerType *Ty = cast<PointerType>(Args[i].Ty); 4362a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands const Type *ElementTy = Ty->getElementType(); 4363276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4364a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 436508e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // For ByVal, alignment should come from FE. BE will guess if this 436608e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // info is not there but there are cases it cannot get right. 436708e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen if (Args[i].Alignment) 4368276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands FrameAlign = Args[i].Alignment; 4369276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValAlign(FrameAlign); 4370276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValSize(FrameSize); 437121485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola } 437236397f50343639ce9a25996f2d790c656791ab92Duncan Sands if (Args[i].isNest) 4373276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setNest(); 4374276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setOrigAlign(OriginalAlignment); 4375b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4376b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = getRegisterType(VT); 4377b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = getNumRegisters(VT); 4378b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 4379b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 4380b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4381b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (Args[i].isSExt) 4382b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::SIGN_EXTEND; 4383b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (Args[i].isZExt) 4384b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::ZERO_EXTEND; 4385b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4386b988baccc229ef3e175905c999245d5544a0d384Duncan Sands getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind); 4387b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4388b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i != NumParts; ++i) { 4389b988baccc229ef3e175905c999245d5544a0d384Duncan Sands // if it isn't first piece, alignment must be 1 4390276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy MyFlags = Flags; 4391c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray if (NumParts > 1 && i == 0) 43926ccbbd89906157187ac04b2b3237c4aee7acd095Nicolas Geoffray MyFlags.setSplit(); 4393c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray else if (i != 0) 4394276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands MyFlags.setOrigAlign(1); 4395b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4396b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Ops.push_back(Parts[i]); 4397276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Ops.push_back(DAG.getArgFlags(MyFlags)); 439827a70be55f8b63181598d144d034b396402be66eDan Gohman } 4399f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4400f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4401ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Figure out the result value types. We start by making a list of 440223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // the potentially illegal return value types. 4403ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<MVT::ValueType, 4> LoweredRetTys; 4404ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<MVT::ValueType, 4> RetTys; 440523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(*this, RetTy, RetTys); 4406ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 440723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Then we translate that to a list of legal types. 440823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 440923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType VT = RetTys[I]; 4410ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4411ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4412ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4413ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(RegisterVT); 4414ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4415f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4416ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(MVT::Other); // Always has a chain. 4417f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4418b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4419be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4420ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&LoweredRetTys[0], 4421ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.size()), 4422be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4423ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Chain = Res.getValue(LoweredRetTys.size() - 1); 4424b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4425b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4426b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 442700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 442800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 442900fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands if (RetSExt) 443000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands AssertOp = ISD::AssertSext; 443100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands else if (RetZExt) 4432b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 443300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 4434ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<SDOperand, 4> ReturnValues; 4435ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNo = 0; 443623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 443723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType VT = RetTys[I]; 4438ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4439ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4440ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNoEnd = NumRegs + RegNo; 4441ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<SDOperand, 4> Results; 4442ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (; RegNo != RegNoEnd; ++RegNo) 4443ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Results.push_back(Res.getValue(RegNo)); 4444ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SDOperand ReturnValue = 4445ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, 4446ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman AssertOp); 4447ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman ReturnValues.push_back(ReturnValue); 4448ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4449ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Res = ReturnValues.size() == 1 ? ReturnValues.front() : 4450ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getNode(ISD::MERGE_VALUES, 4451ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&RetTys[0], RetTys.size()), 4452ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman &ReturnValues[0], ReturnValues.size()); 4453f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4454b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4455b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4456f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4457f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 445850381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4459171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4460171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4461d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4462171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4463171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 44640aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 44650aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 44660aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 44670aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 44680aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 44690aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 44700aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 44717041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 44727041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 44737041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 44741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 447684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 44771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 44781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4479495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4480c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4481ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen AU.addRequired<CollectorModuleMetadata>(); 4482c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4483495a0b51915eb763576874f29192820b731edc22Chris Lattner} 44841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4485c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4486bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 44871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 44885f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 44895f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 44905f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 44911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 4492ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (MF.getFunction()->hasCollector()) 4493ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = &getAnalysis<CollectorModuleMetadata>().get(*MF.getFunction()); 4494ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 4495ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = 0; 449684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner RegInfo = &MF.getRegInfo(); 4497832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 44981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 44991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 45001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45011532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 45021532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 45031532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 45041532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 45059fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45069fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 45071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4508edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4509ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4510ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4511ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 451284bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner if (!RegInfo->livein_empty()) 451384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 451484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner E = RegInfo->livein_end(); I != E; ++I) 4515ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4516ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4517f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4518f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4519f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4520f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4521f40708223e409a152834b1553c6883ff2035b957Duncan Sands 45221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 45231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45256833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattnervoid SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) { 4526571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 452718c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4528d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 452918c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 453086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 4531b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 453223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue RFV(TLI, Reg, V->getType()); 453323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SDOperand Chain = DAG.getEntryNode(); 453423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RFV.getCopyToRegs(Op, DAG, Chain, 0); 453523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman PendingExports.push_back(Chain); 45361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4538068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 453986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan GohmanLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) { 45401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 454115699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 45420afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4543bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4544bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4545bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4546bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4547bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4548bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4549bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4550bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4551f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4552bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4553bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4554251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4555251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 455686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(AI, VMI->second); 4557bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 45580afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4559bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4560bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4561966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4562bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4563068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4564068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4565f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4566f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4567f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4568cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4569f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4570f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4571f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4572560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 4573560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 4574f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4575f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4576f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4577f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4578c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 457948abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 4580c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 4581c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 4582c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 4583c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand Terminator = DAG.getRoot(); 4584c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4585c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 4586c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 4587c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 4588c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4589c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4590c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 4591c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 4592c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer BI = prior(DAG.allnodes_end()); BI != BE; --BI) { 4593c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 4594c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpRet(Ret, 0); 4595c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpCall(static_cast<SDNode*>(BI), 0); 4596c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 4597c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 4598c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 4599c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 460048abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 4601c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 4602c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (isMarkedTailCall && 4603c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer (Ret==NULL || 4604c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG))) { 4605c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SmallVector<SDOperand, 32> Ops; 4606c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 4607c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for(SDNode::op_iterator I =OpCall.Val->op_begin(), 4608c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer E=OpCall.Val->op_end(); I!=E; I++, idx++) { 4609c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 4610c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 4611c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer else 4612c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 4613c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4614c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 4615c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4616c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4617c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4618c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 4619c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4620068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4621068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4622f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4623ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo, GCI); 4624068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4625bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4626ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 462786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman LowerArguments(LLVMBB, SDL); 46281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 46301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 46311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4632f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 46339fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 46341532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI && BB->isLandingPad()) { 4635f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 4636f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 4637f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 4638f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 4639bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 4640bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 4641f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4642e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 4643e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 4644e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4645e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4646e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 4647e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 4648e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4649e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4650f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 4651f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 4652f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 4653f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 4654cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 4655cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 4656cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 4657cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 4658cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 4659cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 4660cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 4661f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 4662f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4663f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 4664f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 4665f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 4666cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 4667f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 4668f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4669f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 4670f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 4671f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 46729fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 46739fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 46749fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 46751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 46761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 46771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 46781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4679f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 46801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 4681f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 46821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4683f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 46849f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 46851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 468686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(I, VMI->second); 46871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 46881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 46901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 46911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 46921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 46931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 46941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4695edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 46968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 46971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 46991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4700d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 47018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 47028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 47038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 47048c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 47058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4706532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 4707532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 47081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 47091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4710d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 47118c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4712d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 47138c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 47148c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 47158c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 47168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 47178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 47188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 47198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 47201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 47211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 47231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 47241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 47251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 47268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 47278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 47288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 47298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 47308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 47318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 47323f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 47338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 47348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 47358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 47368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 473786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(C, RegOut); 47381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 47408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 47418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 47428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 47438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 47448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 47458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 47468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 474786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(PHIOp, Reg); 47487e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 47491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 47518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 47528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 47538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 47547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4755b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 47568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 47578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 47581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 47601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4762f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 4763a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4764f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 476537efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4766f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4767f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 47683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 47693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 47704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 47714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 47724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4773a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 477486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(SDL.getControlRoot()); 4775c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4776c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 4777c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 4778c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 4779c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 4780c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer CheckDAGForTailCallsAndFixThem(DAG, TLI); 47811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 47821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4783f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4784417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Lowered selection DAG:\n"; 4785417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4786417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4787af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 47885f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(false, *AA); 47892300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4790417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 47911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4792f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 47931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 47941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 479501d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#if 0 // Enable this some day. 479601d029b82cb08367d81aa10cdc94d05360466649Chris Lattner DAG.LegalizeTypes(); 479701d029b82cb08367d81aa10cdc94d05360466649Chris Lattner // Someday even later, enable a dag combine pass here. 479801d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#endif 4799ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4800f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4801832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 48021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4803f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4804af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 48055f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(true, *AA); 48062300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4807417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 4808417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4809417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4810a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4811552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4812a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4813a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 48141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4815f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4816832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 48171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4818f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4819f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4820f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4821f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4822f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4823f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 482444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4825f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4826f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4827f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4828f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4829f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 48301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4831f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4832f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4833f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 48344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 48364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 48374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 48384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 48394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4840f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4841a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 48421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 48434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4844f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4845f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4846f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4847f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 48489ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 48499ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48509ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 4851f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4852f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 48531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 48544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 48564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 48574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 48584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 4860ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 48614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 48634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 48644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 48654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 48664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 48674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 48684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 48714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 4873ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo, GCI); 48744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 48764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 48774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 48784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 48794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 48804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 48814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 48824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 48834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 48844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 48854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 48864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 48894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 48904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 48934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 48944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 48954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 48964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 48974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 48984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 48994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 49004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 49019ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49029ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49039ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent)); 49049ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49059ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49069ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases. 49079ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 49084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 49104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 49114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 49124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 49134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 49149ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49159ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49169ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 49174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 49229453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 49239453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 49249453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 49253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 49263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 49273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 49283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 49293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 4930ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 49313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 49323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 49333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 49343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 49353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 49363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 49373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 49384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 49403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 49413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 4942ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo, GCI); 494337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 49443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 49453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 494637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 49473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 49483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 49493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 49503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 495137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 495237efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 495337efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 495437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 495537efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 495637efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 49574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 49583a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 49599ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49609ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49619ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB)); 4962f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 49634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4964f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 49659ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49669ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49679ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 496837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 496937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 497037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 497137efe6764568a3829fee26aba532283131d1a104Nate Begeman 4972b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 4973b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 4974b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4975b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 4976b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4977b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 4978b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 49799ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 49809ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49819ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 4982b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4983b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 4984b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 4985f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 4986f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 4987d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 498844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4989f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 4990ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo, GCI); 4991d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4992f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 4993f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 4994f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 4995d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 4996f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 4997f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 4998f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 4999f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 5000d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5001d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 5002d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 5003d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 5004d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 500557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 5006d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 5007d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 5008d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 5009d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 5010d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 5011d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 50129ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn]. 50139ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 50149ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB)); 5015d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 5016d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5017d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5018f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5019d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5020d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 502157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 502257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5023d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5024d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 50252452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 502657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5027f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 502857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 5029a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 50301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5031a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 503213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 5033a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 5034a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 5035a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 5036a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 5037a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 503813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 5039eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 504013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 504113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 5042eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 50439373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 50444ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 504513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 50469ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 5047a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 50483e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 50493e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman if (ViewSUnitDAGs) SL->viewGraph(); 50503e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5051cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 5052a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 50530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 505403fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 50559ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 50569ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 50579ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 50589ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 5059755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5060755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 5061755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5062755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 5063755480681c795d585c73556c028b6143c46bda86Chris Lattner 5064755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 5065755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5066755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 5067755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5068755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 5069dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 50702e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 50712e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5072755480681c795d585c73556c028b6143c46bda86Chris Lattner 5073755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5074755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5075755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5076755480681c795d585c73556c028b6143c46bda86Chris Lattner 5077755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 50782e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5079755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5080755480681c795d585c73556c028b6143c46bda86Chris Lattner 5081755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5082755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 50832e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5084ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5085755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5086755480681c795d585c73556c028b6143c46bda86Chris Lattner 5087755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5088755480681c795d585c73556c028b6143c46bda86Chris Lattner 5089755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5090755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5091755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5092755480681c795d585c73556c028b6143c46bda86Chris Lattner 5093755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5094755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5095755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5096755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5097755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 50982e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 50992e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 51002e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5101755480681c795d585c73556c028b6143c46bda86Chris Lattner 5102755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5103755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5104755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5105755480681c795d585c73556c028b6143c46bda86Chris Lattner 5106755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 51072e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5108755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5109755480681c795d585c73556c028b6143c46bda86Chris Lattner 5110755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5111755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 51122e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5113755480681c795d585c73556c028b6143c46bda86Chris Lattner 51142e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 5115ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5116755480681c795d585c73556c028b6143c46bda86Chris Lattner 5117755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5118755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5119755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5120755480681c795d585c73556c028b6143c46bda86Chris Lattner 5121755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5122755480681c795d585c73556c028b6143c46bda86Chris Lattner 5123755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5124755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5125755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5126755480681c795d585c73556c028b6143c46bda86Chris Lattner 51279ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 51280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 51290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 51300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 51310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 51320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 51330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 51340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 51360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 51370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 51390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 51400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 51410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 51430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 51440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 51450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 51460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 51470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 51480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 51490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 51500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 51510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 51520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5153832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 51540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 51550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 51560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 51584b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 515936d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 51604b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 51610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 51620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 51630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 51640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 51650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 51670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 51680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 51690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5170794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 51711997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5172