SelectionDAGISel.cpp revision 41f6259a4b54d2dc58a4040e942b37f00d306b7b
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 { 1170fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegsForValue - This struct represents the registers (physical or virtual) 1180fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// that a particular set of values is assigned, and the type information about 1190fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// the value. The most common situation is to represent one value at a time, 1200fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// but struct or array values are handled element-wise as multiple values. 1210fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// The splitting of aggregates is performed recursively, so that we never 1220fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have aggregate-typed registers. The values at this point do not necessarily 1230fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have legal types, so each value may require one or more registers of some 1240fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// legal type. 1250fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 1269525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 12723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// TLI - The TargetLowering object. 1280fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 12923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const TargetLowering *TLI; 13023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 1310fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs - The value types of the values, which may not be legal, and 1320fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// may need be promoted or synthesized from one or more registers. 1330fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 1340fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman SmallVector<MVT::ValueType, 4> ValueVTs; 135864635ad7b3046d3042311423071152c613961deChris Lattner 1360fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegVTs - The value types of the registers. This is the same size as 1370fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs and it records, for each value, what the type of the assigned 1380fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// register or registers are. (Individual values are never synthesized 1390fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// from more than one type of register.) 1400fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 1410fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// With virtual registers, the contents of RegVTs is redundant with TLI's 1420fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// getRegisterType member function, however when with physical registers 1430fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// it is necessary to have a separate record of the types. 144864635ad7b3046d3042311423071152c613961deChris Lattner /// 14523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<MVT::ValueType, 4> RegVTs; 146864635ad7b3046d3042311423071152c613961deChris Lattner 1470fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Regs - This list holds the registers assigned to the values. 1480fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Each legal or promoted value requires one register, and each 1490fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// expanded value requires multiple registers. 1500fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 1510fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman SmallVector<unsigned, 4> Regs; 152864635ad7b3046d3042311423071152c613961deChris Lattner 15323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue() : TLI(0) {} 154864635ad7b3046d3042311423071152c613961deChris Lattner 15523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 156b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 157864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType regvt, MVT::ValueType valuevt) 1580fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {} 15923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 160b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 16123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const SmallVector<MVT::ValueType, 4> ®vts, 16223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const SmallVector<MVT::ValueType, 4> &valuevts) 1630fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {} 16423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 16523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned Reg, const Type *Ty) : TLI(&tli) { 16623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(tli, Ty, ValueVTs); 16723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 168b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 16923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType ValueVT = ValueVTs[Value]; 17023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 17123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = TLI->getRegisterType(ValueVT); 17223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 17323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Regs.push_back(Reg + i); 17423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegVTs.push_back(RegisterVT); 17523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Reg += NumRegs; 17623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 177864635ad7b3046d3042311423071152c613961deChris Lattner } 178864635ad7b3046d3042311423071152c613961deChris Lattner 17941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner /// append - Add the specified values to this one. 18041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner void append(const RegsForValue &RHS) { 18141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner TLI = RHS.TLI; 18241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end()); 18341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end()); 18441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner Regs.append(RHS.Regs.begin(), RHS.Regs.end()); 18541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } 18641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 18741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 188864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 18923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// this value and returns the result as a ValueVTs value. This uses 190864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 191b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 192864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 193b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 194c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 195c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 196c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 197c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 198b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 199c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 200b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 201c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 202c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 203c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 204c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 205c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 2069f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 207864635ad7b3046d3042311423071152c613961deChris Lattner }; 208864635ad7b3046d3042311423071152c613961deChris Lattner} 2094ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 2101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 2111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 2129373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 2139373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 2149373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 2159373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 2169373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey MachineBasicBlock *BB) { 2179373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 2189373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2199373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 2209373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createTDListDAGScheduler(IS, DAG, BB); 2219373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 2229373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 2239373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 2249373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey return createBURRListDAGScheduler(IS, DAG, BB); 2259373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 2269373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 2279373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2289373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2299373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 2301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 2311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 232f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 233f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 2341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 2351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 2361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 23784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo; 2381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 2401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 2421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 2431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 2451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 2461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 2479f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 2481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 2501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 2511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 2521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 2531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 254f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 255f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 256f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 257f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 258f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned MakeReg(MVT::ValueType VT) { 26084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT)); 2611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 262571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 263571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 264571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 265571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 266571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 267571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 268edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2693c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 2703c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 2711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 2721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 2731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 2741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 2751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 2761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 2771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 2781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 279cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 280cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 281cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 282f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 2838806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 2848806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 285f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 286f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 287f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 289f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 290ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth/// switch or atomic instruction, which may expand to multiple basic blocks. 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 2921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 2931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 2941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 295f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 296571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 297f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 2981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 2991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 3001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 302bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 303f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 304f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 305bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 306bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 307bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 308f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 309bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 310bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 311bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 312bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 314edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 31584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) { 3161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 317bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 318bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 31916ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 32016ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 321bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 322bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 3231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 324bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 325bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 326bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 3272aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 3281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 330b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 3311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 332514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 333ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 334d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 335ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 336a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 337b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 338d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 3391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 3406266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 3411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3432aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 3442aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 3451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 3461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 3471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 3481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 3491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 3511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 3521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 3532aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 3541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *MBB = new MachineBasicBlock(BB); 3551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MF.getBasicBlockList().push_back(MBB); 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 3591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 3601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 3618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 3628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 3638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 3648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 3657f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 3668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 3678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 368c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 369b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 370c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 3718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 3721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 3731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3753c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 3763c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 3773c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 37810a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 37910a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// In the case that the given value has struct or array type, this function 38010a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// will assign registers for each member or element. 38110a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 3823c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 38323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<MVT::ValueType, 4> ValueVTs; 384b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner ComputeValueVTs(TLI, V->getType(), ValueVTs); 38595b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 38623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned FirstReg = 0; 387b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 38823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType ValueVT = ValueVTs[Value]; 38923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = TLI.getRegisterType(ValueVT); 3908c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 391b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumRegs = TLI.getNumRegisters(ValueVT); 39223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 39323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned R = MakeReg(RegisterVT); 39423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman if (!FirstReg) FirstReg = R; 39523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 39623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 39723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return FirstReg; 3983c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 3991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 4011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 4021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 4031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 4041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 4051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 4061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 4071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 4081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4090da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 411d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 412d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 413d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 414d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 415d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner std::vector<SDOperand> PendingLoads; 416d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 41786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingExports - CopyToReg nodes that copy values to virtual registers 41886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// for export to other blocks need to be emitted before any terminator 41986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instruction, but they have no other ordering requirements. We bunch them 42086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// up and the emit a single tokenfactor for them just before terminator 42186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instructions. 42286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman std::vector<SDOperand> PendingExports; 42386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 4245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 4255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 4265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 4275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 4285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 4295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 4305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 4325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 4335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 4345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 4355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 4365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 4375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 4385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 4395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 4405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 4424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 4434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 4444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 4454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 4474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 4484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 4514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 4525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 4535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 454f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 455f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 456f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 457f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 458f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 459f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 460f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 461f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 462f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 463f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 464f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 465f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 466f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 467f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 468f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 469f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 470f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 471b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 472b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 4735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 4755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 476f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 4774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 4785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 4795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 4805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 4815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 482f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 483f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 4845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 4864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 4874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 4884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 4894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 4904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 492f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 4941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 4951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 4961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 4971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 4981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 499a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 5005f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 5011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 502f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 503f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 504f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 5053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 5063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 5073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 5084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 509f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 5111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 5121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 513ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 514ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen /// GCI - Garbage collection metadata for the function. 515ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *GCI; 5161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 5185f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 519ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FunctionLoweringInfo &funcinfo, 520ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *gci) 5215f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 522ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FuncInfo(funcinfo), GCI(gci) { 5231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getRoot - Return the current virtual root of the Selection DAG, 52686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// flushing any PendingLoad items. This must be done before emitting 52786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// a store or any other node that may need to be ordered after any 52886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// prior load instructions. 529a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 530a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 531d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 532d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 533edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 534d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 535d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 536d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 537d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 538d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 539d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 540d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 541d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 542bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 543bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 544d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 545d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 546d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 547a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 548a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 54986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getControlRoot - Similar to getRoot, but instead of flushing all the 55086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingLoad items, flush all the PendingExports items. It is necessary 55186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// to do this before emitting a terminator instruction. 55286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// 55386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand getControlRoot() { 55486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Root = DAG.getRoot(); 55586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 55686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports.empty()) 55786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 55886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 55986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman // Turn all of the CopyToReg chains into one factored node. 56086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (Root.getOpcode() != ISD::EntryToken) { 56186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned i = 0, e = PendingExports.size(); 56286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (; i != e; ++i) { 56386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(PendingExports[i].Val->getNumOperands() > 1); 56486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports[i].Val->getOperand(0) == Root) 56586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman break; // Don't add the root if we already indirectly depend on it. 56686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 56786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 56886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (i == e) 56986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Root); 57086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 57186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 57286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 57386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman &PendingExports[0], 57486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.size()); 57586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.clear(); 57686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(Root); 57786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 57886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 57986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 58086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman void CopyValueToVirtualRegister(Value *V, unsigned Reg); 581571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 5821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 5831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 5851e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 5861e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 5871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 5881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 5891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 5901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 5911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 5921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 5931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 5941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 5981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 59928b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner SDOperand getLoadFrom(const Type *Ty, SDOperand Ptr, 600466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 60195c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, unsigned Alignment); 6021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 603199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 6041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6050da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 6061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 6071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 6080da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 6091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6104e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 6115c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 612e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 613e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 614f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 615571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 616571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 617571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 6188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 619571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 6206f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands void LowerCallTo(CallSite CS, SDOperand Callee, bool IsTailCall, 621070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 622dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 6231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 6241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 6251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 626f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 6271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 6281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 629b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 630dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 631b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 632b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 633b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 634dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 635b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 636b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 637b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 638dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 639b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 640b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 641b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 6424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 6434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 6444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 6454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 646f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 6474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 6484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 6494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 6504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 65137efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 6523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 6533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 654f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 6551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 656b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 657b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 6581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 660e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 6615fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 6627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 6637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 6641628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 6657f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 66601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 667b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 6681628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 6697f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 6707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 6711628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 6727f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 6731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6747f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 6757f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 6767f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 6777f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 6787f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 6797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 6807f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 6817f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 6827f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 68324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 6843822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 6853822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 68645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 68745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 6883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 6893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 6903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 6913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 6923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 6933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 6943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 6953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 6963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 6973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 6983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 6993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 7003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 7011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7022bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 7032bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 7043e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 705c7029805ef35ce9805931067b841e6af11db382eChris Lattner 7061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 7071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 7081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 7101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 7111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 7121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 7131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 7141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 7151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 716fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 717c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 7180eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 7191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 7211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 7221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 7231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 7241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 725ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman void visitGetResult(GetResultInst &I); 72640a04216daaaee119665e023019c005306ec48acDevang Patel 7271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 7281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 7291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 7301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 7321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 7331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 7341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 7361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 7371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 739b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyFromParts - Create a value that contains the specified legal parts 740b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// combined into the value they represent. If the parts combine to a type 741b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// larger then ValueVT then AssertOp can be used to specify whether the extra 742b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 7434468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner/// (ISD::AssertSext). 7446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic SDOperand getCopyFromParts(SelectionDAG &DAG, 7456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman const SDOperand *Parts, 7466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 7476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType PartVT, 7486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT, 7494468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner ISD::NodeType AssertOp = ISD::DELETED_NODE) { 750014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts > 0 && "No parts to assemble!"); 751014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TargetLowering &TLI = DAG.getTargetLoweringInfo(); 752014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand Val = Parts[0]; 753014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 754014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts > 1) { 755014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the value from multiple parts. 756014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!MVT::isVector(ValueVT)) { 757014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned PartBits = MVT::getSizeInBits(PartVT); 758014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ValueBits = MVT::getSizeInBits(ValueVT); 759014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 760014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the power of 2 part. 761014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = NumParts & (NumParts - 1) ? 762014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1 << Log2_32(NumParts) : NumParts; 763014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = PartBits * RoundParts; 764014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType RoundVT = RoundBits == ValueBits ? 765014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT : MVT::getIntegerType(RoundBits); 766014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand Lo, Hi; 767014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 768014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts > 2) { 769014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType HalfVT = MVT::getIntegerType(RoundBits/2); 770014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT); 771014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2, 772014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, HalfVT); 7736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 774014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Parts[0]; 775014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = Parts[1]; 7766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 777014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 778014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 779014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi); 780014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 781014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts < NumParts) { 782014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the trailing non-power-of-2 part. 783014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 784014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType OddVT = MVT::getIntegerType(OddParts * PartBits); 785014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT); 786014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 787014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Combine the round and odd parts. 788014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Val; 789014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 790014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 791014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType TotalVT = MVT::getIntegerType(NumParts * PartBits); 792014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi); 793014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::SHL, TotalVT, Hi, 794014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(MVT::getSizeInBits(Lo.getValueType()), 795014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 796014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo); 797014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi); 798014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 799014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 800014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Handle a multi-element vector. 801014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::ValueType IntermediateVT, RegisterVT; 802014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumIntermediates; 803014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumRegs = 804014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 805014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands RegisterVT); 806014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 807014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 808014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 809014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == Parts[0].getValueType() && 810014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Part type doesn't match part!"); 811014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 812014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the parts into intermediate operands. 813014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SmallVector<SDOperand, 8> Ops(NumIntermediates); 814014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumIntermediates == NumParts) { 815014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the register was not expanded, truncate or copy the value, 816014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // as appropriate. 817014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumParts; ++i) 818014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 819014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 820014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts > 0) { 821014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the intermediate type was expanded, build the intermediate operands 822014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // from the parts. 823014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts % NumIntermediates == 0 && 824014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Must expand into a divisible number of parts!"); 825014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned Factor = NumParts / NumIntermediates; 826014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumIntermediates; ++i) 827014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 828014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 829014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 830014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 831014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 832014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // operands. 833014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(MVT::isVector(IntermediateVT) ? 834014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, 835014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT, &Ops[0], NumIntermediates); 8366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 837014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 8386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 839014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // There is now one part, held in Val. Correct it to match ValueVT. 840014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT = Val.getValueType(); 8416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 842014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) 843014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return Val; 844014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 845014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isVector(PartVT)) { 846014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::isVector(ValueVT) && "Unknown vector conversion!"); 847014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 8486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 8496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 850014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isVector(ValueVT)) { 851014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::getVectorElementType(ValueVT) == PartVT && 852014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::getVectorNumElements(ValueVT) == 1 && 853014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Only trivial scalar-to-vector conversions should get here!"); 854014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 855014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 8566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 857014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isInteger(PartVT) && 858014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands MVT::isInteger(ValueVT)) { 859014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::getSizeInBits(ValueVT) < MVT::getSizeInBits(PartVT)) { 860014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // For a truncate, see if we have any information to 861014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // indicate whether the truncated bits will always be 862014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // zero or sign-extension. 863014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (AssertOp != ISD::DELETED_NODE) 864014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(AssertOp, PartVT, Val, 865014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getValueType(ValueVT)); 866014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 867014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 868014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 869014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 8706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 871014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 872d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner if (MVT::isFloatingPoint(PartVT) && MVT::isFloatingPoint(ValueVT)) { 873d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner if (ValueVT < Val.getValueType()) 8744468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner // FP_ROUND's are always exact here. 875d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val, 8764468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner DAG.getIntPtrConstant(1)); 877d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val); 878d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner } 879014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 880014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::getSizeInBits(PartVT) == MVT::getSizeInBits(ValueVT)) 881014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 882014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 883014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 884d27c991cebe48fdf82b5d9eec6c2a1a244f82622Chris Lattner return SDOperand(); 8856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 8866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 887b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyToParts - Create a series of nodes that contain the specified value 888b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// split into legal parts. If the parts contain more bits than Val, then, for 889b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// integers, ExtendKind can be used to specify how to generate the extra bits. 8906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 8916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val, 8926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand *Parts, 8936183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 894b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT, 895b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 89625ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 89725ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman MVT::ValueType PtrVT = TLI.getPointerTy(); 8986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType ValueVT = Val.getValueType(); 899014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned PartBits = MVT::getSizeInBits(PartVT); 900014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 901014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 902014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!NumParts) 903014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 904014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 905014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!MVT::isVector(ValueVT)) { 906014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) { 907014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "No-op copy with multiple parts!"); 908014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 909014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 910014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 911014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 912014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts * PartBits > MVT::getSizeInBits(ValueVT)) { 913014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover more bits than the value has, promote the value. 914014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isFloatingPoint(PartVT) && MVT::isFloatingPoint(ValueVT)) { 915014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "Do not know what to promote to!"); 916014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 917014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 918014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 919014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ExtendKind, ValueVT, Val); 920014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 921014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 922014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 923014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (PartBits == MVT::getSizeInBits(ValueVT)) { 924014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Different types of the same size. 925014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && PartVT != ValueVT); 926014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 927014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts * PartBits < MVT::getSizeInBits(ValueVT)) { 928014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover less bits than value has, truncate the value. 929014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (MVT::isInteger(PartVT) && MVT::isInteger(ValueVT)) { 930014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 931014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 932014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 933014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 934014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 935014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 937014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The value may have changed - recompute ValueVT. 938014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = Val.getValueType(); 939014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts * PartBits == MVT::getSizeInBits(ValueVT) && 940014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Failed to tile the value with PartVT!"); 941014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 942014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 943014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(PartVT == ValueVT && "Type conversion failed!"); 944014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 9456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 9466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 948014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Expand the value into multiple parts. 949014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts & (NumParts - 1)) { 950014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is not a power of 2. Split off and copy the tail. 951014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::isInteger(PartVT) && MVT::isInteger(ValueVT) && 952014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Do not know what to expand to!"); 953014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = 1 << Log2_32(NumParts); 954014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = RoundParts * PartBits; 955014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 956014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand OddVal = DAG.getNode(ISD::SRL, ValueVT, Val, 957014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(RoundBits, 958014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 959014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT); 960014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 961014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The odd parts were reversed by getCopyToParts - unreverse them. 962014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts + RoundParts, Parts + NumParts); 963014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands NumParts = RoundParts; 964014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = MVT::getIntegerType(NumParts * PartBits); 965014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 966014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 967014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 968014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is a power of 2. Repeatedly bisect the value using 969014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // EXTRACT_ELEMENT. 97025eb043759c23b61769108f78382eb9701c41db2Duncan Sands Parts[0] = DAG.getNode(ISD::BIT_CONVERT, 97125eb043759c23b61769108f78382eb9701c41db2Duncan Sands MVT::getIntegerType(MVT::getSizeInBits(ValueVT)), 97225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Val); 973014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 974014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i < NumParts; i += StepSize) { 975014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ThisBits = StepSize * PartBits / 2; 97625eb043759c23b61769108f78382eb9701c41db2Duncan Sands MVT::ValueType ThisVT = MVT::getIntegerType (ThisBits); 97725eb043759c23b61769108f78382eb9701c41db2Duncan Sands SDOperand &Part0 = Parts[i]; 97825eb043759c23b61769108f78382eb9701c41db2Duncan Sands SDOperand &Part1 = Parts[i+StepSize/2]; 97925eb043759c23b61769108f78382eb9701c41db2Duncan Sands 98025eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 98125eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(1, PtrVT)); 98225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 98325eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(0, PtrVT)); 98425eb043759c23b61769108f78382eb9701c41db2Duncan Sands 98525eb043759c23b61769108f78382eb9701c41db2Duncan Sands if (ThisBits == PartBits && ThisVT != PartVT) { 98625eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0); 98725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1); 98825eb043759c23b61769108f78382eb9701c41db2Duncan Sands } 989014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 990014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 991014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 992014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 993014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts, Parts + NumParts); 994014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 995014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 996014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 997014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 998014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Vector ValueVT. 999014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 10006183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 10016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(PartVT)) { 10026183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 1003014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1004014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(MVT::getVectorElementType(ValueVT) == PartVT && 1005a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman MVT::getVectorNumElements(ValueVT) == 1 && 1006a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 1007a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 1008a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 10096183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1011014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 10126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 10136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 10146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 10176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman MVT::ValueType IntermediateVT, RegisterVT; 10186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 10196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 10206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 10216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 10226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 10236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumElements = MVT::getVectorNumElements(ValueVT); 10246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 10266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 10276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 10296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 10306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 10316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (MVT::isVector(IntermediateVT)) 10326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 10336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 10346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 103525ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 10366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 10376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 10386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 103925ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 10406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 10426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 10436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 10446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 10456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 1046532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 10476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 10486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 10496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 10506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 10516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 10526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 10536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 1054532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 10556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 10576183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10586183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1059199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 1060199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 1061199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 1062199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1063199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 10646833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner MVT::ValueType VT = TLI.getValueType(V->getType(), true); 1065b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1066b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) 1067b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstant(CI->getValue(), VT); 1068b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1069b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) 1070199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 1071b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1072b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (isa<ConstantPointerNull>(C)) 1073199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 1074b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1075b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) 1076b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 1077b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 10786833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C) && !isa<VectorType>(V->getType())) 10796833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 1080b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1081b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 1082b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner visit(CE->getOpcode(), *CE); 1083b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SDOperand N1 = NodeMap[V]; 1084b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 1085b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N1; 1086b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner } 1087b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 10886833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner const VectorType *VecTy = cast<VectorType>(V->getType()); 1089b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumElements = VecTy->getNumElements(); 1090b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 10916833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // Now that we know the number and type of the elements, get that number of 10926833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // elements into the Ops array based on what kind of constant it is. 10936833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SmallVector<SDOperand, 16> Ops; 1094b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 1095b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 1096b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.push_back(getValue(CP->getOperand(i))); 1097199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 10986833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 10996833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Unknown vector constant!"); 11006833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner MVT::ValueType EltVT = TLI.getValueType(VecTy->getElementType()); 11016833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 1102b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SDOperand Op; 11036833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C)) 11046833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getNode(ISD::UNDEF, EltVT); 11056833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else if (MVT::isFloatingPoint(EltVT)) 11066833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstantFP(0, EltVT); 1107b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner else 11086833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstant(0, EltVT); 1109b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.assign(NumElements, Op); 1110199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1111b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1112b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // Create a BUILD_VECTOR node. 1113b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 1114199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1115199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1116b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // If this is a static alloca, generate it as the frameindex instead of 1117b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // computation. 1118199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 1119199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 1120b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 1121199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 1122199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 1123199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1124199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1125251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 1126251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 1127199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 11286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner RegsForValue RFV(TLI, InReg, V->getType()); 1129b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = DAG.getEntryNode(); 1130b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 1131199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 1132199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1133199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 11341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 11351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 113686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot())); 11371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 11381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1139b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1140bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 114186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman NewValues.push_back(getControlRoot()); 114286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 1143ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 1144b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType VT = RetOp.getValueType(); 1145b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 11468e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // FIXME: C calling convention requires the return type to be promoted to 11478e7d056bc5c0688501f6721994c8f4074d699c69Evan Cheng // at least 32-bit. But this is not necessary for non-C calling conventions. 1148b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (MVT::isInteger(VT)) { 1149b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType MinVT = TLI.getRegisterType(MVT::i32); 1150b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (MVT::getSizeInBits(VT) < MVT::getSizeInBits(MinVT)) 1151b988baccc229ef3e175905c999245d5544a0d384Duncan Sands VT = MinVT; 1152b988baccc229ef3e175905c999245d5544a0d384Duncan Sands } 1153b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1154b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = TLI.getNumRegisters(VT); 1155b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = TLI.getRegisterType(VT); 1156b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 1157b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1158b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1159b988baccc229ef3e175905c999245d5544a0d384Duncan Sands const Function *F = I.getParent()->getParent(); 1160b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (F->paramHasAttr(0, ParamAttr::SExt)) 1161b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::SIGN_EXTEND; 1162b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (F->paramHasAttr(0, ParamAttr::ZExt)) 1163b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::ZERO_EXTEND; 1164b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1165b988baccc229ef3e175905c999245d5544a0d384Duncan Sands getCopyToParts(DAG, RetOp, &Parts[0], NumParts, PartVT, ExtendKind); 1166b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1167b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i < NumParts; ++i) { 1168b988baccc229ef3e175905c999245d5544a0d384Duncan Sands NewValues.push_back(Parts[i]); 1169276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy())); 1170ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 11711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1172bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 1173bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 11741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 11751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1176571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 1177571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 1178571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 1179571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 1180571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 1181571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 1182571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1183571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 1184571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 1185571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1186571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 118786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(V, Reg); 1188571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1189571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 11908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 11918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 11928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 11938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 11948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 11958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 11968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 11978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 11988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 11998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 12008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 12018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 12028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 12038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 12048c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 12058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 12068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 12078c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 12088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 12098c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 12108c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 12118c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 12128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 12138c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 12148c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 12158c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 12168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 12176a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 12186a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 12196a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 12206a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 12216a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 12226a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1223571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1224571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1225571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1226571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1227571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1228571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1229571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1230e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1231571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1232e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1233e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 12346a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 12356a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 12366a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1237571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1238571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1239e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1240e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1241e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1242e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 12435a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 12445a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 12455a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 12465a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 12475a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1248e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1249e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1250e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1251e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1252e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1253e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1254e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1255e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1256e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1257e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1258e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1259e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1260e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1261e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1262e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1263e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1264e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1265e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1266e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1267e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1268e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1269e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1270e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1271e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1272e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1273e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1274e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 1275e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 1276e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 1277e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1278e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1279e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1280e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1281e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1282e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1283e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1284e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1285e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1286e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1287e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1288e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1289e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 12900da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1291e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1292571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1293571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1294571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 12955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1296571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1297571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1298571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1299571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1300571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 13016b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 13025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1303571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1304571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1305571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1306571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1307d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1308d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1309571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 1310571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TmpBB = new MachineBasicBlock(CurBB->getBasicBlock()); 1311571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner CurBB->getParent()->getBasicBlockList().insert(++BBI, TmpBB); 1312571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1313d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1314d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1315d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1316d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1317d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1318d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1319d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1320d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1321571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1322d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1323d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1324d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1325d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1326d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1327d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1328d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1329d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1330d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1331d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1332d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1333d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1334d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1335d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1336d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1337d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1338d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1339d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1340d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1341d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1342d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1343d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1344571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1345571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1346df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1347df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1348df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1349df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1350df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1351df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1352df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 13530ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 13540ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 13550ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 13560ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 13570ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 13580ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 13590ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 13600ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 13610ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1362df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1363df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1364df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 13651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 13661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 13671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 13681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 13701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 13711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 13721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 13731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 13741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 13751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 13761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 13771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 137886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1379dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 138057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 138157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // Update machine-CFG edges. 138257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(Succ0MBB); 138357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 138457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 138557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 138657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 138757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 138857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 138957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1390571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1391571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1392571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1393571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1394571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1395571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1396571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1397571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1398571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1399571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1400571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1401571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1402571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1403571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1404571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1405571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1406571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1407571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1408d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1409571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1410571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 14110ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 14120ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 14130ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 14140ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 14150ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1416df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1417df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1418df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1419df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1420df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1421df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1422df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1423df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1424df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1425df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1426df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 14275a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 14285a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 14290ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 14300ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 14310ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 14320ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner CurMBB->getParent()->getBasicBlockList().erase(SwitchCases[i].ThisBB); 14330ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1434df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1435571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1436571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 14372452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 14382452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 14396b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 14405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 14412452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 14422452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 14432452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 14441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 14451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1446f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1447f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1448f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 144957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 145057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 145157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 14525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 14535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 14545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 14555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 14565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 14575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 14585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 14595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 14605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 14615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 14625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 14635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 14645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 14655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 14675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 14685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 14705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MVT::ValueType VT = CmpOp.getValueType(); 14713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 14725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 14735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 14745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 14755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 14765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 14775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 14785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 14795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 14805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 14815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1482f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1483f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1484f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1485f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1486f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1487f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1488f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1489f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1490f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 149157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 149257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1493f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1494f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1495f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 149686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond, 149757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 149857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1499f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1500f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1501f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 150257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1503f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update successor info 150457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.TrueBB); 150557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner CurMBB->addSuccessor(CB.FalseBB); 1506f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1507f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 15083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 150937efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 151037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1511f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 151237efe6764568a3829fee26aba532283131d1a104Nate Begeman MVT::ValueType PTy = TLI.getPointerTy(); 151386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy); 15143d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 15153d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 15163d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 15173d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 151837efe6764568a3829fee26aba532283131d1a104Nate Begeman} 151937efe6764568a3829fee26aba532283131d1a104Nate Begeman 15203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 15213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 15223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 15233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 15243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 15253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 15263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 15273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 15283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 15293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 15303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 15313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 15333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 15343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 15353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 15363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 15377f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 15383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 15393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 15403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 15413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 154386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp); 15443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 15453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 15473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 15483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 15495b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 15503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 15513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 15523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 15543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 15553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 15563a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 15573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 15583a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 15593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15603a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 15613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 15623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 15643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 15653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 15663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 15674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 15684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 15703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 15713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 15724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 15734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 15744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 15754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 15764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 15774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MVT::ValueType VT = SwitchOp.getValueType(); 15784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 15794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 15804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 15825b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 15834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 15844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 15854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 15877f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getShiftAmountTy())) 15884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 15894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 15904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 15914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 15934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 15944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 15954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 15964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 15974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 159886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal); 15994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 16004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 16024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(B.Default)); 16034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 16054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 16064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 16074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 16084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 16094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 16104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 16124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 16134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 16144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 16154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 16164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 16174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.Default); 16194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(MBB); 16204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 16224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 16234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 16254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 16264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 16274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 16284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 162986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg, TLI.getPointerTy()); 16304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), 16324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SwitchVal, 16334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Mask, 16344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov TLI.getPointerTy())); 16355b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp, 16364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 16374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 163886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), 16394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 16404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 16424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 16434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 16444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 16454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 16464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 16474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 16494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 16504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 16514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 16524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 16534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(B.TargetBB); 16554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMBB->addSuccessor(NextMBB); 16564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 16584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 16593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1660b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1661b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1662b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1663f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 16649fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1665fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1666fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1667fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 16686f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1669f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1670f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1671f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1672f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1673f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1674f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 167586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(&I, VMI->second); 1676f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 16779fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1678f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Drop into normal successor. 167986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1680f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DAG.getBasicBlock(Return))); 1681070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 1682f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1683f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1684f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 1685b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1686b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1687b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1688b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1689b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 16905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1691b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1692dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1693b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1694b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1695b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1696dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1697dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1698dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1699dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 17004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1701dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 17025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1703b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1704b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1705b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1706b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1707b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1708b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1709b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1710b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1711b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1712b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1713b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1714b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1715b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1716b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1717b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1718b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1719b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 17205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1721b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1722b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1723b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 17245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1725b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1726b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1727b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1728b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1729b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1730b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1731b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1732b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1733b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1734b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1735b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1736b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1737b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 1738b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = new MachineBasicBlock(CurBlock->getBasicBlock()); 1739b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FallThrough); 1740b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1741b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1742b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1743b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 17445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 17465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 17475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 17485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 17495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 17505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 17515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 17525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 17535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 17545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 17555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 17565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1757b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1758b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1759b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1760b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1761b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1762b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1763b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1764b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1765b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1766b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1767b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1768b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1769dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1770dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1771b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1772b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 17737294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 17747294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 17757294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 17767294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 17777294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1778b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1779dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1780b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1781b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1782b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1783dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1784dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1785dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 17875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 17885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 17905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 17915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 17925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1793dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17947294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1795dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1796dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 17975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 17985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1799dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1800dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 18015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 18025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 18034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 18045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1805b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1806b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1807dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1808b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1809b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1810b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1811b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1812b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1813b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1814b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1815b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1816b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1817b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1818b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1819b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1820b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1821b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 1822b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *JumpTableBB = new MachineBasicBlock(LLVMBB); 1823b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, JumpTableBB); 1824b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1825b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1826b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1827b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 18284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1829b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1830b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1831b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1832b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 18335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 18345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 18355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 18365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 18385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 18395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 18405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1841b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1842b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1843b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 18445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1845b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1846b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 18475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1848b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1849b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1850b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1851b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1852b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1853b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1854b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1855b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1856b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1857b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1858b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1859b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1860b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1861b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1862f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1863b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1864b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1865b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1866b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1867b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1868b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1869b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1870dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1871b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1872b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1873b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 1874b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 1875dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 1876b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1877b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1878b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1879b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1880b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1881b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1882b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1883b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1884b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1885b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1886b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1887b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1888b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1889b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1890b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 1891b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1892b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1893b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1894b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 1895b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 1896b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 18975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 18985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 18994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 19005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 1901b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1902b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 1903b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 19045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 19055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 19065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 19075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 19085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 19105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 19114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 19124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 19134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 1914b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 19155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 19165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 19175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 19184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 1919b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 1920b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 192154e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 19224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 19234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 19244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 19254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 19264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 19274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 1928b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 19294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 19304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 1931b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 19325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 19345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 1935b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 19367294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 19377294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 19387294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 19397294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 19407294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 19417294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 1942b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1943b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 1944b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 19455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 1946b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 1947b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1948b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 1949b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 1950b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 1951b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 1952b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 1953b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 1954b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 19555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 19565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 19575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 19585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 1959b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1960b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov TrueBB = new MachineBasicBlock(LLVMBB); 1961b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, TrueBB); 1962b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 1963b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1964b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1965b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 1966b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 1967b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 1968b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 1969b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 19705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 19715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 19725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 1973b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1974b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FalseBB = new MachineBasicBlock(LLVMBB); 1975b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, FalseBB); 1976b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 1977b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1978b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1979b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1980b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 1981b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 19825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 19835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 1984b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1985b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1986b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1987b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1988b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1989dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1990dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1991b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1992b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 19934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 19944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 19954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 19964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 19974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 19984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 19993ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 2000b55757ec5f6f0218342a8910e1bbd9f018adc7d7Dan Gohman unsigned IntPtrBits = MVT::getSizeInBits(TLI.getPointerTy()); 20014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 20034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 20044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 20064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 20074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 20084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 20104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 20114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 20124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 20134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 20144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 20154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 20164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 20174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 20204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 20214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 20224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 20234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 20244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 20254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 20264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 20284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 20294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 20314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 20324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 20334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 20344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 20354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 20364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 20374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 20384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 2039ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 20404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 20414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 20424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 20434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 20444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 20464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 20474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 20494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 20504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 20514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 2052e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 20534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 20544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 20554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 20564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 20594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 20604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 20624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 20634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 20644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 20654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 20664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 20684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 20694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 20704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 20714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 20744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 20754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 2077e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 20784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 20794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 20824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 20834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 20854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 20874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 20884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 20894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 20914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 20934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 20944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 20954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 20964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 20974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *CaseBB = new MachineBasicBlock(LLVMBB); 20984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurMF->getBasicBlockList().insert(BBI, CaseBB); 20994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 21004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 21014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 21024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 2105efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 21064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 21074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 21094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 21104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 21124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 21144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 21154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 211786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman/// Clusterify - Transform simple list of Cases into list of CaseRange's 21185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 21195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 21205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 21215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 21235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 21245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 21255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 21265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 21275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 21285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2129b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 21305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 21325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 2133a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 2134a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 213527a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 21365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 21375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 21385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 21395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 21405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 21425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 21435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 21445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 21455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 21465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 21475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 21485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 21495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 21505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 21525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 21535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 21545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 21555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 21565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 21585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 21595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 2161f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 2162f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 2163f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 2164c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 21655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 2166d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 2167f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 2168f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 21695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 2170f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 2171c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2172f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 2173d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 217486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 2175d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 2176c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2177d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner CurMBB->addSuccessor(Default); 2178f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 2179f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2180f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 2181f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 2182f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 2183f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 21845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 21855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 21865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 21875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 2188c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2189f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 2190f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 2191f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 21925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 219337efe6764568a3829fee26aba532283131d1a104Nate Begeman 21943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 2195b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 21963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 21973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 21983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 21993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 22003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 22013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 22023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 22034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 22044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 22054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 22073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 2208dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 2209dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2210dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 22114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 22123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 22133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2214dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2215dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2216dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2217dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2218dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2219dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2220f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2221f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2222f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 22233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2224b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2225b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 222624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 22279d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 22287f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 22297f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 22307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2231c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2232c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 22339e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2234c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2235c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2236c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng SDOperand Op2 = getValue(I.getOperand(1)); 2237c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2238c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2239c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 22407f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 22417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 22427f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 22437f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 224401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 22459e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 224601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 224701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 224801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 224901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 22507f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 22517f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 22527f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2253b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2254b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 22557f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 22561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 22571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 225824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 225924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 22601628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 22611628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2262e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2263e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2264e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2265e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 22667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::getSizeInBits(TLI.getShiftAmountTy()) < 22677f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::getSizeInBits(Op2.getValueType())) 2268832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 2269832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer else if (TLI.getShiftAmountTy() > Op2.getValueType()) 2270832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 2271e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 22721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 22731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 22741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 227545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2276e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2277e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2278e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2279e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2280e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2281e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2282e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 228345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2284e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 228545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 228645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 228745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 228845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 228945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 229045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 229145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 229245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 229345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 229445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 229545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 229645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 229745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 229845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 229945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 230045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 230145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 230245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 230345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2304e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2305e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2306e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2307e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2308e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2309e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2310e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 2311e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2312e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2313e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2314e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2315e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2316e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2317e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2318e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2319e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2320e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ORD: FOC = ISD::SETEQ; FPC = ISD::SETO; break; 2321e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNO: FOC = ISD::SETNE; FPC = ISD::SETUO; break; 2322e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2323e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2324e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2325e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2326e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2327e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2328e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 232945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 233045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2331e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 233245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 233345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2334e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2335e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2336e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2337e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2338e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 23391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 23421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 23431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 23441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 23457f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 23467f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 23471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 23481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 23493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 23513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 23523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 23553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 23583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 23593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 23603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 23633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 23663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 23673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 23683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 23713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 23743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 23753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23770bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0))); 23783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 23813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 23823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 23853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 23883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 23893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 23923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 23933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 23943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 23953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 23963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 23973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 23983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 23993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 24003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 24013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 24023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 24033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 24043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 24053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 24063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 24073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 24083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 24093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 24103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 24113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 24123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 24133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 24143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 24153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 24163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 24173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 24181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 2419e25ca692c0478af5e15170fce23cea2a5b5fd0b9Chris Lattner MVT::ValueType SrcVT = N.getValueType(); 242028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner MVT::ValueType DestVT = TLI.getValueType(I.getType()); 24213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 24223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 24233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 24243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 24253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 24263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 24273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 24283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 24291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 24313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 24323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 24333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 24343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType SrcVT = N.getValueType(); 24353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 24363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(SrcVT)) 24373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 24383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 24393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 24403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 24413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 24423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 24433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 24443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 24453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer MVT::ValueType DestVT = TLI.getValueType(I.getType()); 24463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 24473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 24483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 24493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 24503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 24513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 24523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 24531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24552bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2456c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2457c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2458c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2459c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2460c7029805ef35ce9805931067b841e6af11db382eChris Lattner 24617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 24627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 24637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2464c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2465c7029805ef35ce9805931067b841e6af11db382eChris Lattner 24662bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2467384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2468384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2469384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 24707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2471384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2472384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2473c7029805ef35ce9805931067b841e6af11db382eChris Lattner 24743e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 24753e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 24763e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 24773e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 24783e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 24807f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 24817f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 24823e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 24833e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24843e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 24851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 24861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 24871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 24881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 24891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 24901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 24911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2492c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2493b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 24941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 24951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2496b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 24971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 24980bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offset)); 24991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 25001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 25011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 25021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 25037c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 25047c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 25057c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2506b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 250747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2508a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 25090bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 25100bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offs)); 25117c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 25127c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 25137c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 25147c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2515a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 25167c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 25177c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 25187c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 25197c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 25207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (IdxN.getValueType() < N.getValueType()) { 252147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 25227c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } else if (IdxN.getValueType() > N.getValueType()) 25237c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 25247c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 25257c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 25267c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 25277c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 25287c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 25297c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 25306b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 25311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 25327c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 25331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 25347c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 25350bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner SDOperand Scale = DAG.getIntPtrConstant(ElementSize); 25367c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 25377c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 25381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 25391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 25401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 25411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 25441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 25451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 25461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 25471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 25481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2550514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 255158092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2552d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 255358092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 25541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 255668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 255768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < AllocSize.getValueType()) 255868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 255968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > AllocSize.getValueType()) 256068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 25611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 256268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 25630bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(TySize)); 25641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25654515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 25664515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 25674515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 25681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 25691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 25704515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 25711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 25724515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 25734515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 25744515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 25754515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 25760bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(StackAlign-1)); 25774515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 25784515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 25790bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 25801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25810bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner SDOperand Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 2582f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2583f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2584f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 25850da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 25860da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 25871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 25891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 25901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 25911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 25941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(0)); 2595edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2596d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2597d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2598d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2599d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2600d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2601d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2602d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 260328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2604466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng setValue(&I, getLoadFrom(I.getType(), Ptr, I.getOperand(0), 260595c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb Root, I.isVolatile(), I.getAlignment())); 260628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner} 260728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 260828b5b1c7b54c2065882b98af2406c38a3bcee802Chris LattnerSDOperand SelectionDAGLowering::getLoadFrom(const Type *Ty, SDOperand Ptr, 2609466685d41a9ea4905b9486fea38e83802e46f196Evan Cheng const Value *SV, SDOperand Root, 261095c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb bool isVolatile, 261195c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb unsigned Alignment) { 26127f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman SDOperand L = 26137f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman DAG.getLoad(TLI.getValueType(Ty), Root, Ptr, SV, 0, 26147f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman isVolatile, Alignment); 2615d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 261628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 2617d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(L.getValue(1)); 2618d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 2619d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.push_back(L.getValue(1)); 262028b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 262128b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner return L; 26221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 26261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 26271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 26281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Ptr = getValue(I.getOperand(1)); 26290b4f80ee898c1e85242482e4cb363e6bfe0a133bEvan Cheng DAG.setRoot(DAG.getStore(getRoot(), Src, Ptr, I.getOperand(1), 0, 263095c218a83ecf77590b9dc40c636720772d2b5cd7Christopher Lamb I.isVolatile(), I.getAlignment())); 26311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26330eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 26340eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 26350eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 26360eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 2637a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 2638a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2639a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 26400eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2641bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2642e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2643e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2644e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2645e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2646e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2647e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2648e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2649e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 26500eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26510eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 26520eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 26530eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26540eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 26550eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 26560eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 26570eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 26580eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 26590eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 26600eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26610eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26620eade319cdb72e24c11d068728a98083737c6435Chris Lattner std::vector<MVT::ValueType> VTs; 26630eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 26640eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType VT = TLI.getValueType(I.getType()); 26657f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(VT)) { 26669d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 26670eade319cdb72e24c11d068728a98083737c6435Chris Lattner MVT::ValueType EltVT = TLI.getValueType(DestTy->getElementType()); 26680eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26690eade319cdb72e24c11d068728a98083737c6435Chris Lattner VT = MVT::getVectorType(EltVT, DestTy->getNumElements()); 26700eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 26710eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26720eade319cdb72e24c11d068728a98083737c6435Chris Lattner 26730eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 26740eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 26750eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 26760eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 26770eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 26780eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2679f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner const MVT::ValueType *VTList = DAG.getNodeValueTypes(VTs); 2680f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 26810eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 268248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 268348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2684f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2685f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 268648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2687f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2688f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 268948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2690f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2691f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 269248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2693e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2694e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2695e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2696e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2697e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2698e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2699e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 27000eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 27019d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 27027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman MVT::ValueType VT = TLI.getValueType(PTy); 27037f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 27040eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 27050eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 27060eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 27070eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 27080eade319cdb72e24c11d068728a98083737c6435Chris Lattner 2709b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 2710cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 2711b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands V = IntrinsicInst::StripPointerCasts(V); 2712b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 27134c71dfe356716e6bc1993ef5efdced08b68fe612Anton Korobeynikov assert ((GV || isa<ConstantPointerNull>(V)) && 2714cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 2715cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 2716cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 2717cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2718f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 2719cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 2720f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 2721f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 2722f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 2723f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 2724f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 2725f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 2726f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 2727f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 2728f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2729f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 2730f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 2731f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 2732cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 2733cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2734cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 2735cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 2736cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 27376590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 2738cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 2739cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2740cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 2741cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 2742cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 2743cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2744cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2745cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 2746cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2747cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 27486590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 27496590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 27506590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 27516590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 27526590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 27536590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 27546590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 27556590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 27566590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 27576590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 27586590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 2759cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2760cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 2761cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2762f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 2763cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 2764cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 2765cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 2766cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 2767cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 2768f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 2769cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 2770f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 2771f40708223e409a152834b1553c6883ff2035b957Duncan Sands 2772c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 2773c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 2774c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 2775c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 2776c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 2777c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 27780eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 27790eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 27800eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 27810eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 2782c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 2783c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 2784c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 2785bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 2786bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 2787bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2788bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2789bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 2790bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 2791bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 2792bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 2793c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 2794d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 2795c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 2796c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 2797d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 2798c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 279903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 2800707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memcpy_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 DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 2806707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 280703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2808707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 280903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 2810707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memset_i64: { 2811707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 2812707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 2813707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 2814707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 2815707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align, 2816707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0)); 281703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2818707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 281903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 2820707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memmove_i64: { 2821707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 2822707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 2823707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 2824707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 2825707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 2826707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // If the source and destination are known to not be aliases, we can 2827707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // lower memmove as memcpy. 2828707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman uint64_t Size = -1ULL; 2829707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 2830707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman Size = C->getValue(); 2831707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 2832707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman AliasAnalysis::NoAlias) { 2833707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 2834707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 2835707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman return 0; 2836707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 2837707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 2838707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align, 2839707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 284003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 2841707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 284286cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 284344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 284443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 284544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 2846bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Ops[5]; 284736ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner 2848bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[0] = getRoot(); 2849bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[1] = getValue(SPI.getLineValue()); 2850bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[2] = getValue(SPI.getColumnValue()); 2851ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 285244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 2853ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 285443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey CompileUnitDesc *CompileUnit = cast<CompileUnitDesc>(DD); 285543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2856bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[3] = DAG.getString(CompileUnit->getFileName()); 2857bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Ops[4] = DAG.getString(CompileUnit->getDirectory()); 2858ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey 2859bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::LOCATION, MVT::Other, Ops, 5)); 286086cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 286143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2862b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 286336ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 286443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 286544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 286643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 286744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 286844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 28691ee29257428960fede862fcfdbe80d5d007927e9Jim Laskey DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2870bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 2871bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(0, MVT::i32))); 287243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 287343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2874b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 287543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 287643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 287744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 287843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 287944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 288044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 2881bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 2882bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 2883bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(0, MVT::i32))); 288443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 288543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2886b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 288743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 288843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 288944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 28901b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (!MMI) return 0; 289143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 28921b08bbca5592351a940bcd164bdec724ee954326Evan Cheng Value *SP = FSI.getSubprogram(); 28931b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (SP && MMI->Verify(SP)) { 28941b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is 28951b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // what (most?) gdb expects. 28961b08bbca5592351a940bcd164bdec724ee954326Evan Cheng DebugInfoDesc *DD = MMI->getDescFor(SP); 28971b08bbca5592351a940bcd164bdec724ee954326Evan Cheng assert(DD && "Not a debug information descriptor"); 28981b08bbca5592351a940bcd164bdec724ee954326Evan Cheng SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD); 28991b08bbca5592351a940bcd164bdec724ee954326Evan Cheng const CompileUnitDesc *CompileUnit = Subprogram->getFile(); 29001b08bbca5592351a940bcd164bdec724ee954326Evan Cheng unsigned SrcFile = MMI->RecordSource(CompileUnit->getDirectory(), 29011b08bbca5592351a940bcd164bdec724ee954326Evan Cheng CompileUnit->getFileName()); 29021b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // Record the source line but does create a label. It will be emitted 29031b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // at asm emission time. 29041b08bbca5592351a940bcd164bdec724ee954326Evan Cheng MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile); 290543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 290643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 2907b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 290843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 290943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 291044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 291143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 2912a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng Value *Variable = DI.getVariable(); 2913a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng if (MMI && Variable && MMI->Verify(Variable)) 2914a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(), 2915a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng getValue(DI.getAddress()), getValue(Variable))); 291643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 291743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 2918c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 2919b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 29201532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (!CurMBB->isLandingPad()) { 29211532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // FIXME: Mark exception register as live in. Hack for PR1508. 29221532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen unsigned Reg = TLI.getExceptionAddressRegister(); 29231532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (Reg) CurMBB->addLiveIn(Reg); 2924735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 29251532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Insert the EXCEPTIONADDR instruction. 29261532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 29271532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Ops[1]; 29281532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Ops[0] = DAG.getRoot(); 29291532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 29301532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, Op); 29311532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.setRoot(Op.getValue(1)); 2932b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2933b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2934b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 29358806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 29368806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 2937b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 29388806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 29398806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 29408806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 29411532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 2942f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 2943f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 2944e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 2945f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 2946f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 2947f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 2948902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 2949902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 2950902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 2951e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 2952735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2953735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 29548806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 2955735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 2956735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 2957735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 2958735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 2959735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 2960735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 29617a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 29628806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 2963b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2964b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2965b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2966b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 29678806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 29688806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 29698806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 2970b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 29718806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::ValueType VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 29728806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 2973735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 2974735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 2975735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 2976cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 29773b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 2978735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 29798806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 29807a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 2981f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 29828806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 2983b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2984b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 2985b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 2986b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 2987b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 29882365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 29892365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 29902365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 29911532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 29922365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 29932365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 29942365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 299586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman getControlRoot(), 29962365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 29972365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 29982365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 29992365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 30002365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 30012365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 30022365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 30032365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 30042365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 30052365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 30062365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 30072365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 30082365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 30092365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 30102365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 30112365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 30122365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 30132365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 30141532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen MVT::ValueType VT = getValue(I.getOperand(1)).getValueType(); 30151532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand CfaArg; 30161532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MVT::getSizeInBits(VT) > MVT::getSizeInBits(TLI.getPointerTy())) 30171532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::TRUNCATE, 30181532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 30191532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen else 30201532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 30211532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 30221532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen 30231532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Offset = DAG.getNode(ISD::ADD, 30241532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 30251532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 30261532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy()), 30271532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg); 30281532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, DAG.getNode(ISD::ADD, 30291532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 30301532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAMEADDR, 30311532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 30321532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getConstant(0, 30331532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy())), 30341532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Offset)); 30352365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 30362365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 30372365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 30389ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 3039c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 3040c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 3041c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 3042c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 30439ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 30446ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 30456ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 30466ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 30476ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 30486ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 3049ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 3050ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 3051ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3052ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3053ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3054ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 3055ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 3056ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3057ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3058ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3059ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 3060ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 3061ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3062ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 3063ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 3064ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3065c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 3066c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 3067c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 3068c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3069c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 30708b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 3071bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 3072f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 3073f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 3074f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 30758b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 30768b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 307751b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 30788b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 3079c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 30803f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 3081f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 3082f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 3083f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 3084f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 3085f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 3086f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 30873f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 3088addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 3089a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 3090d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 3091d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 3092d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 3093d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 3094a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 3095a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3096a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3097a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 3098a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3099c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3100a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3101a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 3102a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3103a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3104a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 3105a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3106c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3107a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3108a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 3109a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 3110a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer MVT::ValueType Ty = Arg.getValueType(); 3111a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 3112a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3113c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3114a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3115140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 3116bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 3117f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 3118f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 3119140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 3120140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 3121140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 3122140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 312339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 312439a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 312539a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 3126140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 312739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 312824e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 312924e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 313024e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 313136397f50343639ce9a25996f2d790c656791ab92Duncan Sands 313236397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 313336397f50343639ce9a25996f2d790c656791ab92Duncan Sands const Function *F = 313436397f50343639ce9a25996f2d790c656791ab92Duncan Sands cast<Function>(IntrinsicInst::StripPointerCasts(I.getOperand(2))); 313536397f50343639ce9a25996f2d790c656791ab92Duncan Sands 313636397f50343639ce9a25996f2d790c656791ab92Duncan Sands SDOperand Ops[6]; 313736397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 313836397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 313936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 314036397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 314136397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 314236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 314336397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3144f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands SDOperand Tmp = DAG.getNode(ISD::TRAMPOLINE, 3145f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 3146f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 3147f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 3148f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 3149f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 3150f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 315136397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 315236397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 3153ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3154ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcroot: 3155ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (GCI) { 3156ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Value *Alloca = I.getOperand(1); 3157ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Constant *TypeMap = cast<Constant>(I.getOperand(2)); 3158ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3159ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val); 3160ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI->addStackRoot(FI->getIndex(), TypeMap); 3161ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen } 3162ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3163ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3164ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcread: 3165ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcwrite: 3166ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen assert(0 && "Collector failed to lower gcread/gcwrite intrinsics!"); 3167ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3168ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3169917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 31701a0248690aaa9f7baaf1247e5f65a1c0c9e3783cDan Gohman setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32)); 3171917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 3172917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 317366fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov 317466fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov case Intrinsic::trap: { 317566fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot())); 317666fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov return 0; 317766fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov } 317827b7db549e4c5bff4579d209304de5628513edebEvan Cheng case Intrinsic::prefetch: { 317927b7db549e4c5bff4579d209304de5628513edebEvan Cheng SDOperand Ops[4]; 318027b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[0] = getRoot(); 318127b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[1] = getValue(I.getOperand(1)); 318227b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[2] = getValue(I.getOperand(2)); 318327b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[3] = getValue(I.getOperand(3)); 318427b7db549e4c5bff4579d209304de5628513edebEvan Cheng DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4)); 318527b7db549e4c5bff4579d209304de5628513edebEvan Cheng return 0; 318627b7db549e4c5bff4579d209304de5628513edebEvan Cheng } 318727b7db549e4c5bff4579d209304de5628513edebEvan Cheng 318822c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth case Intrinsic::memory_barrier: { 318922c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth SDOperand Ops[6]; 319022c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[0] = getRoot(); 319122c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth for (int x = 1; x < 6; ++x) 319222c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[x] = getValue(I.getOperand(x)); 319322c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth 319422c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6)); 319522c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth return 0; 319622c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth } 3197ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_lcs: { 3198ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3199ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O3 = getValue(I.getOperand(3)); 3200ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_LCS, Root, 3201ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3202ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(2)), 3203ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O3, O3.getValueType()); 3204ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3205ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3206ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3207ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3208ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_las: { 3209ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3210ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O2 = getValue(I.getOperand(2)); 3211ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_LAS, Root, 3212ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3213ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O2, O2.getValueType()); 3214ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3215ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3216ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3217ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3218ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth case Intrinsic::atomic_swap: { 3219ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 3220ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand O2 = getValue(I.getOperand(2)); 3221ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand L = DAG.getAtomic(ISD::ATOMIC_SWAP, Root, 3222ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3223ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth O2, O2.getValueType()); 3224ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3225ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3226ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3227ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 3228ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth 3229c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3230c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 3231c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3232c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 32336f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sandsvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDOperand Callee, 32341da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 3235070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 32366f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 3237735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 3238070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 3239070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 32406f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3241735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 3242735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 32436f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 32446f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 32456f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 32466f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands SDOperand ArgNode = getValue(*i); 32476f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 32486f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 32496f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 32506f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 32516f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 32526f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 32536f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 32546f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 32556f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 325608e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen Entry.Alignment = CS.getParamAlignment(attrInd); 3257735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 3258735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 3259735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 32601532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3261070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 3262070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 3263070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 3264a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // Both PendingLoads and PendingExports must be flushed here; 3265a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // this call might not return. 3266a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen (void)getRoot(); 3267a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getControlRoot(), 3268bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(BeginLabel, MVT::i32), 3269bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 3270070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 32716f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3272735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 32736f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 32746f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 327500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CS.paramHasAttr(0, ParamAttr::ZExt), 32766f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 3277735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 32786f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 32796f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 3280735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 3281070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 32821532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3283070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 3284070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 3285070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 3286070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, getRoot(), 3287bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(EndLabel, MVT::i32), 3288bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 3289070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 32906f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 3291070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 3292070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 3293735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 3294735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3295735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 32961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 329764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 3298c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 329987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3300c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3301c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3302c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3303c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 330487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 330587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 330687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 330787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 330887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 330987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 331087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 331187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 331287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 331387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 331487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 331587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 331687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 331787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 331887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 331987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand LHS = getValue(I.getOperand(1)); 332087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand RHS = getValue(I.getOperand(2)); 332187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 332287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 332387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 332487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 332587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 332687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 33272f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 33282f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 332987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 333087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 333187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 333287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 333387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 333487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 333587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 333687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 333787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 33382f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 33392f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 334087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 334187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 334287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 334387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 334487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 334587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 334687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 334787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 334887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 33492f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 33502f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 335187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 335287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 335387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 335487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 335587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 335687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3357f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3358c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 335987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3360ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3361fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3362ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3363c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3364edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 336564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 336664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 336764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 336864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 336964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3370070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 33716f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 33721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 33731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3374735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3375ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohmanvoid SelectionDAGLowering::visitGetResult(GetResultInst &I) { 337667780f108ccb509dffe3ff63d3826ea6accb1bb1Dan Gohman if (isa<UndefValue>(I.getOperand(0))) { 33773dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman SDOperand Undef = DAG.getNode(ISD::UNDEF, TLI.getValueType(I.getType())); 33783dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman setValue(&I, Undef); 33796833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return; 33803dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman } 33816833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 33826833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // To add support for individual return values with aggregate types, 33836833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // we'd need a way to take a getresult index and determine which 33846833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // values of the Call SDNode are associated with it. 33856833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert(TLI.getValueType(I.getType(), true) != MVT::Other && 33866833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Individual return values must not be aggregates!"); 33876833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 33886833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand Call = getValue(I.getOperand(0)); 33896833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner setValue(&I, SDOperand(Call.Val, I.getIndex())); 3390ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman} 3391ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 3392ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 3393b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3394b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3395b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3396b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3397b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan GohmanSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 33986833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand &Chain, 33996833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand *Flag) const { 340023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Assemble the legal parts into the final values. 340123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 4> Values(ValueVTs.size()); 34026833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SmallVector<SDOperand, 8> Parts; 34036833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 340423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Copy the legal parts from the registers. 340523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType ValueVT = ValueVTs[Value]; 340623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 340723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = RegVTs[Value]; 340823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 34096833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Parts.resize(NumRegs); 341023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 34116833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand P; 34126833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 34136833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT); 34146833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 34156833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag); 341623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman *Flag = P.getValue(2); 34176833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 34186833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = P.getValue(1); 341923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Parts[Part+i] = P; 342023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3421b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 342223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Values[Value] = getCopyFromParts(DAG, &Parts[Part], NumRegs, RegisterVT, 342323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ValueVT); 342423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumRegs; 342523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 34266833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 34276833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (ValueVTs.size() == 1) 34286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return Values[0]; 34296833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 343023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return DAG.getNode(ISD::MERGE_VALUES, 343123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman DAG.getVTList(&ValueVTs[0], ValueVTs.size()), 343223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Values[0], ValueVTs.size()); 3433b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3434b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3435b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3436b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 3437b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3438b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3439b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohmanvoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 3440b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const { 3441b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 344223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = Regs.size(); 344323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 8> Parts(NumRegs); 34446833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 344523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType ValueVT = ValueVTs[Value]; 344623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumParts = TLI->getNumRegisters(ValueVT); 344723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = RegVTs[Value]; 344823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 344923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman getCopyToParts(DAG, Val.getValue(Val.ResNo + Value), 345023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Parts[Part], NumParts, RegisterVT); 345123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumParts; 345223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3453b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3454b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 345523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 8> Chains(NumRegs); 345623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 34576833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand Part; 34586833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 34596833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 34606833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 34616833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag); 3462b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 34636833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 34646833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chains[i] = Part.getValue(0); 3465c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 34666833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 346733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng if (NumRegs == 1 || Flag) 346833bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is 346933bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // flagged to it. That is the CopyToReg nodes and the user are considered 347033bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // a single scheduling unit. If we create a TokenFactor and return it as 347133bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // chain, then the TokenFactor is both a predecessor (operand) of the 347233bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // user as well as a successor (the TF operands are flagged to the user). 347333bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c1, f1 = CopyToReg 347433bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c2, f2 = CopyToReg 347533bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c3 = TokenFactor c1, c2 347633bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // ... 347733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // = op c3, ..., f2 347833bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng Chain = Chains[NumRegs-1]; 34796833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else 34806833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 3481c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3482864635ad7b3046d3042311423071152c613961deChris Lattner 3483c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3484c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3485c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3486c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 34879f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 34884b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 34894b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 34906833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) { 34916833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]); 349223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType RegisterVT = RegVTs[Value]; 34936833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned i = 0; i != NumRegs; ++i) 34946833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT)); 349523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3496c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3497864635ad7b3046d3042311423071152c613961deChris Lattner 3498864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3499864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3500864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3501864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 35029b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 35036f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetLowering &TLI, 35046f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI) { 3505f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType FoundVT = MVT::Other; 3506f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 35076f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 35086f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman E = TRI->regclass_end(); RCI != E; ++RCI) { 3509f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::ValueType ThisVT = MVT::Other; 3510f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 35119b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 35129b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 35139b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 35149b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 35159b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 35169b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3517f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3518f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3519f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 3520f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (FoundVT == MVT::Other || 3521f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner MVT::getSizeInBits(FoundVT) < MVT::getSizeInBits(*I)) { 3522f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3523f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3524f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 35259b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 35269b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 35279b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3528f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 35299b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3530864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3531864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3532864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3533864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 35349b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 35359b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3536f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3537f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3538f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3539f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3540f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3541f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3542f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3543864635ad7b3046d3042311423071152c613961deChris Lattner } 3544f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3545864635ad7b3046d3042311423071152c613961deChris Lattner} 3546864635ad7b3046d3042311423071152c613961deChris Lattner 3547bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3548bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3549bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3550bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 35515c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengstruct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo { 35525c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// CallOperand - If this is the result output operand or a clobber 35535c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// this is null, otherwise it is the incoming operand to the CallInst. 35545c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// This gets modified as the asm is processed. 3555bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SDOperand CallOperand; 35565c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng 3557e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3558e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3559e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3560e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 356123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 35625c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 3563bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3564bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3565e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3566e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3567e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3568e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 35697cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner std::set<unsigned> &InputRegs, 35707cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) const { 35717cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isOutReg) { 35727cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 35737cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 35747cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 35757cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isInReg) { 35767cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 35777cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 35787cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 35797cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 35807cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner 35817cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattnerprivate: 35827cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// MarkRegAndAliases - Mark the specified register and all aliases in the 35837cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// specified set. 35847cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 35857cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) { 35867cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 35877cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(Reg); 35887cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 35897cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (; *Aliases; ++Aliases) 35907cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(*Aliases); 35917cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 3592bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3593bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3594bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3595bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 35960fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// GetRegistersForValue - Assign registers (virtual or physical) for the 35970fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// specified operand. We prefer to assign virtual registers, to allow the 35980fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// register allocator handle the assignment process. However, if the asm uses 35990fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// features that we can't model on machineinstrs, we have SDISel do the 36000fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// allocation. This produces generally horrible, but correct, code. 36010fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 36020fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// OpInfo describes the operand. 36030fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// HasEarlyClobber is true if there are any early clobber constraints (=&r) 36040fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// or any explicitly clobbered registers. 36050fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// Input and OutputRegs are the set of already allocated physical registers. 36060fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 3607e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 36085c80760fdf71659c5bdf45cd85d173df454dfb41Evan ChengGetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 3609864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 36104e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3611e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3612e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3613e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3614e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3615e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3616e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3617e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3618e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3619e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3620e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3621e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3622e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3623e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3624e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3625e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3626e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3627e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3628e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3629e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3630e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3631e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3632e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3633e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3634e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3635e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3636b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SmallVector<unsigned, 4> Regs; 3637e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3638e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3639e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3640e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3641e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3642e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3643864635ad7b3046d3042311423071152c613961deChris Lattner 3644bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3645bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3646b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 3647864635ad7b3046d3042311423071152c613961deChris Lattner MVT::ValueType RegVT; 3648bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner MVT::ValueType ValueVT = OpInfo.ConstraintVT; 3649864635ad7b3046d3042311423071152c613961deChris Lattner 3650bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 36512a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 36522a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3653864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3654bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 3655864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3656cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3657cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3658cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3659cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3660cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3661864635ad7b3046d3042311423071152c613961deChris Lattner 3662864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3663864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 3664864635ad7b3046d3042311423071152c613961deChris Lattner 3665864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 3666864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 3667864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 3668864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator E = PhysReg.second->end(); 3669864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 3670864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Didn't find reg!"); 3671864635ad7b3046d3042311423071152c613961deChris Lattner 3672864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 3673864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 3674864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 3675864635ad7b3046d3042311423071152c613961deChris Lattner assert(I != E && "Ran out of registers to allocate!"); 3676864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 3677864635ad7b3046d3042311423071152c613961deChris Lattner } 3678864635ad7b3046d3042311423071152c613961deChris Lattner } 367923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 36807cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 36817cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 3682e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3683864635ad7b3046d3042311423071152c613961deChris Lattner } 3684864635ad7b3046d3042311423071152c613961deChris Lattner 36852a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 36862a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 36872a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 3688c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 3689c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 36902a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 36912a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 36922a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 3693e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 3694e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 3695e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 3696e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 3697e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 36982a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 36993a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 3700bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 37013a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 37022a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 37032a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 370484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo = MF.getRegInfo(); 37052a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 370684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second)); 37072a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 370823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 3709e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 37102a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 37112a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 37122a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 37132a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 37142a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 37152a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 37162a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 37172a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 37182a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 37192a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 3720bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 3721bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 37222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 3723e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 37246f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 3725864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 3726864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 3727864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 37284e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 3729864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 3730864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 3731864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 3732864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 3733864635ad7b3046d3042311423071152c613961deChris Lattner continue; 3734864635ad7b3046d3042311423071152c613961deChris Lattner } 3735864635ad7b3046d3042311423071152c613961deChris Lattner 37364e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 37374e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 3738c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 37396f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman RC = isAllocatableRegister(Reg, MF, TLI, TRI); 3740c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 3741c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 3742c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 3743c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 3744c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 37454e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 37464e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 3747864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 3748864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 3749864635ad7b3046d3042311423071152c613961deChris Lattner 3750e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 3751864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 3752864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 3753864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 3754864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 3755e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 3756e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 3757864635ad7b3046d3042311423071152c613961deChris Lattner 375823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(), 3759e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 37607cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 3761e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 3762864635ad7b3046d3042311423071152c613961deChris Lattner } 37634e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 3764864635ad7b3046d3042311423071152c613961deChris Lattner 3765864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 37664e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 37674e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 37683ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 3769ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 3770ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 3771fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 3772fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 3773ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37740c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 37755c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng std::vector<SDISelAsmOperandInfo> ConstraintOperands; 3776ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 3777ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 3778ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 3779ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 37804e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 37810c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 37820c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 37830c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 37840c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 37850c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 3786e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3787e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 3788e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 3789e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 3790e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 3791e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3792fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 3793acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner unsigned ResNo = 0; // ResNo - The result number of the next output. 37940c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 37955c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 37965c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 37970c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 37980c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner MVT::ValueType OpVT = MVT::Other; 37991efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 38000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 38010c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 38021efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 3803acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // Indirect outputs just consume an argument. 3804acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (OpInfo.isIndirect) { 3805fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 3806acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner break; 3807acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } 3808acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // The return value of the call is this value. As such, there is no 3809acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // corresponding argument. 3810acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 3811acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (const StructType *STy = dyn_cast<StructType>(CS.getType())) { 3812acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(STy->getElementType(ResNo)); 3813acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } else { 3814acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(ResNo == 0 && "Asm only has one result!"); 3815acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(CS.getType()); 38161efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 3817acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner ++ResNo; 38181efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 38191efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 3820fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 38211efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 38221efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 38230c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 38241efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 38251efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 38260c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 38270c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 3828eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 38290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 3830507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) 3831507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]); 3832eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 3833eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 3834eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 3835eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 3836eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 3837eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 3838eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 3839eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 3840eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If OpTy is not a first-class value, it may be a struct/union that we 3841eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 3842eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (!OpTy->isFirstClassType() && OpTy->isSized()) { 3843eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 3844eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 3845eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 3846eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 3847eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 3848eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 3849eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 3850eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 3851eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 3852eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 3853eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 38546995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 3855eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 3856eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 38570c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 38580c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 38591efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 38600c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 38612a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 38623ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 38635a09690446a36f94f990db7d18d9b9ac8587888aChris Lattner TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG); 38641efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 3865e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 3866e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 386709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 38680fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner // If we see a clobber of a register, it is an early clobber. 386969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (!SawEarlyClobber && 387069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.Type == InlineAsm::isClobber && 387169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) { 387269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // Note that we want to ignore things that we don't trick here, like 387369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // dirflag, fpsr, flags, etc. 387469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 387569e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 387669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintVT); 387769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (PhysReg.first || PhysReg.second) { 387869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // This is a register we know of. 387969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner SawEarlyClobber = true; 388069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 388169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 38820fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner 388309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 388409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 388509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 388609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 388709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 388809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 388909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 389009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 389109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 389209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 389309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 389409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 389509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 389609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 389709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 389809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 389909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 390009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 390109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 390209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 390309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 390409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 3905514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 390609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 390709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 390809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 390909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 391009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 391109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 391209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 391309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 391409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 391509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 391609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 391709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 391809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 391909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 3920e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 3921e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 3922e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 3923e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 39240c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 39250c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 39260c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 39270c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 3928e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 3929e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 3930e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 39315c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 3932e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3933e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 3934e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 3935e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 3936e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 3937e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3938e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 39390c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 39400c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 39410c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 39420c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 39430c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 39440c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 39452cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 39460f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 39470f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 3948864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 394941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 39500c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 3951864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 39520f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 39530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 39545c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 39551efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 39560c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 39572cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 3958c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 3959c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 3960f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 396109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 396222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 396322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 396422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 3965c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 3966c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 396709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 396822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 396922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 397022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 39712a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 397222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 3973864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 3974864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 3975e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 3976832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Couldn't allocate output reg for contraint '" 39770c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 3978d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 3979d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 39802cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 398141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // If this is an indirect operand, store through the pointer after the 398241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // asm. 398341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner if (OpInfo.isIndirect) { 3984e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 39850c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 398641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } else { 398741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // This is the result value of the call. 398841f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 398941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // Concatenate this output onto the outputs list. 399041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RetValRegs.append(OpInfo.AssignedRegs); 39912cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 39926656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 39936656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 39946656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 3995e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 3996e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 39976656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 39986656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 39996656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 40000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 40013d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 40020c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 40032223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 40042223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 40050c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 40063d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 4007c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 4008c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 4009c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 4010c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 4011c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 4012c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4013c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4014a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 4015a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 4016c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 4017c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 4018c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 4019c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4020c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4021c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4022527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 4023527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 4024527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 402523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.TLI = &TLI; 402623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.ValueVTs.resize(1, InOperandVal.getValueType()); 402723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.RegVTs.resize(1, AsmNodeOperands[CurOp+1].getValueType()); 4028527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 4029527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 4030527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 4031527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 4032527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 4033c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4034527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 4035b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 4036527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 4037527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 4038527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 4039527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 4040f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner assert((NumOps >> 3) == 1 && "Unexpected number of operands"); 4041f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner // Add information to the INLINEASM node to know about this input. 4042f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4043f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4044f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner TLI.getPointerTy())); 4045f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 4046f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner break; 4047c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 404887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 404987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 40502a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 40510c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 405244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 405344b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 405448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner std::vector<SDOperand> Ops; 405548884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 405648884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 405748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 4058832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 40590c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 406053069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 406153069fbbae2558a3138df24776448791fea3aceeChris Lattner } 4062c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 406387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 406448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 4065c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4066c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 406748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 406887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 40692a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 407009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 407144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 407244b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 407344b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 407487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 407587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4076c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4077c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 407887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 4079c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 40802223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 408187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 40822a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 40832a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 40842a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 40850c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 408644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 408787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 408887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 4089e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 4090e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 409187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4092b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 409387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4094e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 4095e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 40966656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 40976656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4098c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 4099c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 4100c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 4101e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 4102e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 4103e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 41046656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 41056656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4106c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 41076656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4108ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4109ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 4110ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 4111ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 4112ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4113f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 4114f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 4115bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 4116ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 4117ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41186656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 41196656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 41203a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 4121b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 41223a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 41233a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // If the result of the inline asm is a vector, it may have the wrong 41243a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner // width/num elts. Make sure to convert it to the right type with 41257f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 41267f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (MVT::isVector(Val.getValueType())) { 412741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner MVT::ValueType DesiredVT = TLI.getValueType(CS.getType()); 41287f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, DesiredVT, Val); 41293a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 41303a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 4131fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 41323a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 41336656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 41346656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 41356656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 41366656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 41376656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 41386656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 4139864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 41406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 4141b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 4142864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 41436656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4144ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 4146bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 41476656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 41480c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 41496656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 41508b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 41516656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 4152bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 4153bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 4154ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 4155ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 4156ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4157ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 41591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 41601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 416268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 416368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner if (IntPtr < Src.getValueType()) 416468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 416568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner else if (IntPtr > Src.getValueType()) 416668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 41671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 4169514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 41701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 41710bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner Src, DAG.getIntPtrConstant(ElementSize)); 41721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 417347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 417447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 417547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 417647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 417747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 4178cf5734dddd66af9388a171b44996505ede47feedChris Lattner 4179cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 418000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C, 418100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG); 4182cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 4183cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 41841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 41851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 41861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 418747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 418847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 418947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 419047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 419147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 41921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MVT::ValueType IntPtr = TLI.getPointerTy(); 4193cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 419400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, 419500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CallingConv::C, true, 4196cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 4197cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 41981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 41991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4200ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 4201ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 4202025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 4203025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 4204025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 4205ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 4206025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 4207832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 4208832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 4209ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng << "TargetLowering::EmitInstrWithCustomInserter!\n"; 4210025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 4211025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 4212025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 4213025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 421439ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 4215acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 4216acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4217acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 421839ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 421939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 42201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 4221acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 4222acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 4223acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 4224acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 4225acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 42261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 4229acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 4230acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4231acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 42321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 42341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 4235acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 4236acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4237acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 4238acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 4239acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 42401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 42411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4242fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 4243fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 4244f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 4245f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 4246fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattnerstd::vector<SDOperand> 4247fdfded55888e35b76bb70231a5bb2f60877c2f6aChris LattnerTargetLowering::LowerArguments(Function &F, SelectionDAG &DAG) { 4248fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 4249fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<SDOperand> Ops; 42508c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 4251fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 4252fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 4253fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4254fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 4255fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner std::vector<MVT::ValueType> RetVals; 42566aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 4257ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 4258ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 4259fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 4260276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy Flags; 42617aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4262d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(I->getType()); 42637aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio 4264afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::ZExt)) 4265276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setZExt(); 4266afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::SExt)) 4267276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSExt(); 4268afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::InReg)) 4269276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setInReg(); 4270afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::StructRet)) 4271276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSRet(); 4272afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::ByVal)) { 4273276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByVal(); 4274594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola const PointerType *Ty = cast<PointerType>(I->getType()); 4275a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands const Type *ElementTy = Ty->getElementType(); 4276276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4277a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 427808e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // For ByVal, alignment should be passed from FE. BE will guess if 427908e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // this info is not there but there are cases it cannot get right. 428008e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen if (F.getParamAlignment(j)) 4281276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands FrameAlign = F.getParamAlignment(j); 4282276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValAlign(FrameAlign); 4283276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValSize(FrameSize); 4284594d37e21aea4ef841d9ee5d9c328c4bf1c6bed7Rafael Espindola } 4285afa3b6da11bc05281bcf09e45de9e037e0ee5011Duncan Sands if (F.paramHasAttr(j, ParamAttr::Nest)) 4286276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setNest(); 4287276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setOrigAlign(OriginalAlignment); 4288b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4289b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType RegisterVT = getRegisterType(VT); 4290b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumRegs = getNumRegisters(VT); 4291b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i != NumRegs; ++i) { 4292b988baccc229ef3e175905c999245d5544a0d384Duncan Sands RetVals.push_back(RegisterVT); 42939701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray ISD::ArgFlagsTy MyFlags = Flags; 4294c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray if (NumRegs > 1 && i == 0) 42956ccbbd89906157187ac04b2b3237c4aee7acd095Nicolas Geoffray MyFlags.setSplit(); 4296b988baccc229ef3e175905c999245d5544a0d384Duncan Sands // if it isn't first piece, alignment must be 1 4297c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray else if (i > 0) 42989701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray MyFlags.setOrigAlign(1); 42999701c8a18fd3888d20f4cd8fcebc6bc99f005c0aNicolas Geoffray Ops.push_back(DAG.getArgFlags(MyFlags)); 4300b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 4301fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 43023b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 43038c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 4304fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4305fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 4306f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 430786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner DAG.getVTList(&RetVals[0], RetVals.size()), 4308bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 430986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 431086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but 431186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // allows exposing the loads that may be part of the argument access to the 431286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // first DAGCombiner pass. 431386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner SDOperand TmpRes = LowerOperation(SDOperand(Result, 0), DAG); 431486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 431586ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // The number of results should match up, except that the lowered one may have 431686ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // an extra flag result. 431786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner assert((Result->getNumValues() == TmpRes.Val->getNumValues() || 431886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner (Result->getNumValues()+1 == TmpRes.Val->getNumValues() && 431986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag)) 432086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner && "Lowering produced unexpected number of results!"); 432186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner Result = TmpRes.Val; 432286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 432327a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 432427a70be55f8b63181598d144d034b396402be66eDan Gohman DAG.setRoot(SDOperand(Result, NumArgRegs)); 4325fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4326fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 4327fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.clear(); 4328fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 432947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 433047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 433147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 4332fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner MVT::ValueType VT = getValueType(I->getType()); 4333b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = getRegisterType(VT); 4334b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4335b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = getNumRegisters(VT); 4336b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 4337b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned j = 0; j != NumParts; ++j) 4338b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Parts[j] = SDOperand(Result, i++); 4339b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4340b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 4341b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (F.paramHasAttr(Idx, ParamAttr::SExt)) 4342b988baccc229ef3e175905c999245d5544a0d384Duncan Sands AssertOp = ISD::AssertSext; 4343b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 4344b988baccc229ef3e175905c999245d5544a0d384Duncan Sands AssertOp = ISD::AssertZext; 4345b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4346b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Ops.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT, 43474468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner AssertOp)); 4348fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 434927a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 4350fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner return Ops; 4351fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 4352fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4353f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4354f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 4355f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 4356f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 4357f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 4358f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 435900fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan SandsTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 436000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands bool RetSExt, bool RetZExt, bool isVarArg, 436100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands unsigned CallingConv, bool isTailCall, 4362f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 4363f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4364be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 4365f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4366f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4367f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4368f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4369f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4370f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4371f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4372f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 437347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer MVT::ValueType VT = getValueType(Args[i].Ty); 437447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer SDOperand Op = Args[i].Node; 4375276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy Flags; 43767aa47b69ca5f4feb6b106a50959e37822bd25b4fLauro Ramos Venancio unsigned OriginalAlignment = 4377d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner getTargetData()->getABITypeAlignment(Args[i].Ty); 4378276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands 4379d0b82b301d700217a716526f9329bb031e0d6578Anton Korobeynikov if (Args[i].isZExt) 4380276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setZExt(); 4381276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands if (Args[i].isSExt) 4382276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSExt(); 43830db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isInReg) 4384276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setInReg(); 43850db79d86de74c315813d60f51ed842c0ba0f34ddAnton Korobeynikov if (Args[i].isSRet) 4386276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setSRet(); 438721485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola if (Args[i].isByVal) { 4388276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByVal(); 438921485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola const PointerType *Ty = cast<PointerType>(Args[i].Ty); 4390a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands const Type *ElementTy = Ty->getElementType(); 4391276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4392a41d7198035bdeaa3ba0a5840086d34ebcddac26Duncan Sands unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 439308e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // For ByVal, alignment should come from FE. BE will guess if this 439408e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen // info is not there but there are cases it cannot get right. 439508e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen if (Args[i].Alignment) 4396276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands FrameAlign = Args[i].Alignment; 4397276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValAlign(FrameAlign); 4398276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setByValSize(FrameSize); 439921485be444bd132941faf4e5653ac34b3ec74040Rafael Espindola } 440036397f50343639ce9a25996f2d790c656791ab92Duncan Sands if (Args[i].isNest) 4401276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setNest(); 4402276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Flags.setOrigAlign(OriginalAlignment); 4403b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4404b988baccc229ef3e175905c999245d5544a0d384Duncan Sands MVT::ValueType PartVT = getRegisterType(VT); 4405b988baccc229ef3e175905c999245d5544a0d384Duncan Sands unsigned NumParts = getNumRegisters(VT); 4406b988baccc229ef3e175905c999245d5544a0d384Duncan Sands SmallVector<SDOperand, 4> Parts(NumParts); 4407b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 4408b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4409b988baccc229ef3e175905c999245d5544a0d384Duncan Sands if (Args[i].isSExt) 4410b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::SIGN_EXTEND; 4411b988baccc229ef3e175905c999245d5544a0d384Duncan Sands else if (Args[i].isZExt) 4412b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ExtendKind = ISD::ZERO_EXTEND; 4413b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4414b988baccc229ef3e175905c999245d5544a0d384Duncan Sands getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind); 4415b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4416b988baccc229ef3e175905c999245d5544a0d384Duncan Sands for (unsigned i = 0; i != NumParts; ++i) { 4417b988baccc229ef3e175905c999245d5544a0d384Duncan Sands // if it isn't first piece, alignment must be 1 4418276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands ISD::ArgFlagsTy MyFlags = Flags; 4419c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray if (NumParts > 1 && i == 0) 44206ccbbd89906157187ac04b2b3237c4aee7acd095Nicolas Geoffray MyFlags.setSplit(); 4421c0cb28fd3abee9a8b40856990e04f1af2f9bd7b8Nicolas Geoffray else if (i != 0) 4422276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands MyFlags.setOrigAlign(1); 4423b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4424b988baccc229ef3e175905c999245d5544a0d384Duncan Sands Ops.push_back(Parts[i]); 4425276dcbdc8db6614cfd5004dc7dc35e437ddf9c58Duncan Sands Ops.push_back(DAG.getArgFlags(MyFlags)); 442627a70be55f8b63181598d144d034b396402be66eDan Gohman } 4427f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4428f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4429ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Figure out the result value types. We start by making a list of 443023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // the potentially illegal return value types. 4431ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<MVT::ValueType, 4> LoweredRetTys; 4432ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<MVT::ValueType, 4> RetTys; 443323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(*this, RetTy, RetTys); 4434ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 443523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Then we translate that to a list of legal types. 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 for (unsigned i = 0; i != NumRegs; ++i) 4441ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(RegisterVT); 4442ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4443f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4444ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(MVT::Other); // Always has a chain. 4445f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4446b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4447be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4448ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&LoweredRetTys[0], 4449ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.size()), 4450be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4451ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Chain = Res.getValue(LoweredRetTys.size() - 1); 4452b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4453b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4454b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 445500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 445600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 445700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands if (RetSExt) 445800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands AssertOp = ISD::AssertSext; 445900fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands else if (RetZExt) 4460b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 446100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 4462ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<SDOperand, 4> ReturnValues; 4463ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNo = 0; 446423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 446523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MVT::ValueType VT = RetTys[I]; 4466ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman MVT::ValueType RegisterVT = getRegisterType(VT); 4467ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4468ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNoEnd = NumRegs + RegNo; 4469ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<SDOperand, 4> Results; 4470ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (; RegNo != RegNoEnd; ++RegNo) 4471ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Results.push_back(Res.getValue(RegNo)); 4472ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SDOperand ReturnValue = 4473ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, 4474ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman AssertOp); 4475ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman ReturnValues.push_back(ReturnValue); 4476ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4477ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Res = ReturnValues.size() == 1 ? ReturnValues.front() : 4478ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getNode(ISD::MERGE_VALUES, 4479ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&RetTys[0], RetTys.size()), 4480ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman &ReturnValues[0], ReturnValues.size()); 4481f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4482b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4483b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4484f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4485f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 448650381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4487171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4488171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4489d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4490171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4491171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 44920aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate BegemanSDOperand TargetLowering::CustomPromoteOperation(SDOperand Op, 44930aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman SelectionDAG &DAG) { 44940aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman assert(0 && "CustomPromoteOperation not implemented for this target!"); 44950aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman abort(); 44960aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman return SDOperand(); 44970aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman} 44980aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 44997041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 45007041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 45017041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 45021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerunsigned SelectionDAGISel::MakeReg(MVT::ValueType VT) { 450484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 45051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4507495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4508c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4509ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen AU.addRequired<CollectorModuleMetadata>(); 4510c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4511495a0b51915eb763576874f29192820b731edc22Chris Lattner} 45121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4513c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner 4514bad7f48c7070444eeb767c169f8bbed86b2c1ae1Chris Lattner 45151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 45165f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 45175f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 45185f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 45191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 4520ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (MF.getFunction()->hasCollector()) 4521ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = &getAnalysis<CollectorModuleMetadata>().get(*MF.getFunction()); 4522ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 4523ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = 0; 452484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner RegInfo = &MF.getRegInfo(); 4525832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 45261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 45281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45291532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 45301532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 45311532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 45321532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 45339fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 45349fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 45351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectBasicBlock(I, MF, FuncInfo); 4536edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4537ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4538ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4539ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 454084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner if (!RegInfo->livein_empty()) 454184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 454284bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner E = RegInfo->livein_end(); I != E; ++I) 4543ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4544ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4545f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4546f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4547f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4548f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4549f40708223e409a152834b1553c6883ff2035b957Duncan Sands 45501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 45511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45536833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattnervoid SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) { 4554571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 455518c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4556d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 455718c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 455886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 4559b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 456023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue RFV(TLI, Reg, V->getType()); 456123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SDOperand Chain = DAG.getEntryNode(); 456223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RFV.getCopyToRegs(Op, DAG, Chain, 0); 456323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman PendingExports.push_back(Chain); 45641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4566068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 456786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan GohmanLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) { 45681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 456915699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 45700afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4571bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4572bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner std::vector<SDOperand> Args = TLI.LowerArguments(F, SDL.DAG); 4573bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4574bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4575bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4576bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner AI != E; ++AI, ++a) 4577bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 4578bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDL.setValue(AI, Args[a]); 4579f7179bb56ea49e627cdc531ea73d7b6940e87372Evan Cheng 4580bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4581bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4582251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4583251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 458486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(AI, VMI->second); 4585bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 45860afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4587bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4588bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4589966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4590bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4591068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4592068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4593f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4594f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4595f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4596cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4597f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4598f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4599f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4600560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 4601560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 4602f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4603f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4604f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4605f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4606c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 460748abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 4608c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 4609c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 4610c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 4611c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand Terminator = DAG.getRoot(); 4612c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4613c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 4614c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 4615c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 4616c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4617c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4618c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 4619c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 4620c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer BI = prior(DAG.allnodes_end()); BI != BE; --BI) { 4621c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 4622c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpRet(Ret, 0); 4623c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpCall(static_cast<SDNode*>(BI), 0); 4624c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 4625c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 4626c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 4627c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 462848abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 4629c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 4630c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (isMarkedTailCall && 4631c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer (Ret==NULL || 4632c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG))) { 4633c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SmallVector<SDOperand, 32> Ops; 4634c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 4635c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for(SDNode::op_iterator I =OpCall.Val->op_begin(), 4636c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer E=OpCall.Val->op_end(); I!=E; I++, idx++) { 4637c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 4638c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 4639c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer else 4640c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 4641c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4642c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 4643c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4644c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4645c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 4646c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 4647c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4648068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 4649068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 4650f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4651ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo, GCI); 4652068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4653bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 4654ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 465586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman LowerArguments(LLVMBB, SDL); 46561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 46581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 46591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4660f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 46619fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 46621532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI && BB->isLandingPad()) { 4663f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 4664f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 4665f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 4666f40708223e409a152834b1553c6883ff2035b957Duncan Sands DAG.setRoot(DAG.getNode(ISD::LABEL, MVT::Other, DAG.getEntryNode(), 4667bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(LabelID, MVT::i32), 4668bb81d97feb396a8bb21d074db1c57e9f66525f40Evan Cheng DAG.getConstant(1, MVT::i32))); 4669f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4670e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 4671e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 4672e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4673e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4674e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 4675e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 4676e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 4677e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 4678f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 4679f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 4680f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 4681f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 4682cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 4683cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 4684cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 4685cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 4686cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 4687cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 4688cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 4689f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 4690f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4691f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 4692f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 4693f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 4694cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 4695f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 4696f40708223e409a152834b1553c6883ff2035b957Duncan Sands 4697f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 4698f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 4699f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 47009fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 47019fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 47029fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 47031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 47041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 47051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 47061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 4707f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 47081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 4709f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 47101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 4711f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 47129f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 47131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 471486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(I, VMI->second); 47151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 47181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 47191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 47201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 47211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 47221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 4723edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 47248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 47251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 47271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 4728d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 47298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 47308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 47318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 47328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 47338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4734532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 4735532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 47361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 47371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 4738d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 47398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 4740d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 47418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 47428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 47438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 47448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 47458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 47468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 47478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 47481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 47491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 47511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 47521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 47531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 47548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 47558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 47568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 47578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 47588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 47598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 47603f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 47618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 47628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 47638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 47648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 476586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(C, RegOut); 47661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 47688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 47698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 47708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 47718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 47728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 47738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 47748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 477586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(PHIOp, Reg); 47767e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 47771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 47798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 47808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 47818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MVT::ValueType VT = TLI.getValueType(PN->getType()); 47827f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4783b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 47848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 47858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 47861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 47871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 47881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 47891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 4790f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 4791a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 4792f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 479337efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 4794f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 4795f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 47963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 47973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 47984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 47994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 48004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 4801a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 480286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(SDL.getControlRoot()); 4803c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 4804c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 4805c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 4806c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 4807c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 4808c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer CheckDAGForTailCallsAndFixThem(DAG, TLI); 48091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4811f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 4812417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Lowered selection DAG:\n"; 4813417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4814417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4815af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 48165f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(false, *AA); 48172300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4818417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 48191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4820f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 48211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 48221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 482301d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#if 0 // Enable this some day. 482401d029b82cb08367d81aa10cdc94d05360466649Chris Lattner DAG.LegalizeTypes(); 482501d029b82cb08367d81aa10cdc94d05360466649Chris Lattner // Someday even later, enable a dag combine pass here. 482601d029b82cb08367d81aa10cdc94d05360466649Chris Lattner#endif 4827ac9dc08c7f0ae60c125624d72c3022025d79ee9eChris Lattner DAG.Legalize(); 4828f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4829832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 48301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 4831f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4832af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 48335f43f92c69aae9837064cf08291db1b36a82789fDan Gohman DAG.Combine(true, *AA); 48342300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 4835417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 4836417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 4837417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 4838a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 4839552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 4840a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 4841a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 48421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InstructionSelectBasicBlock(DAG); 4843f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4844832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 48451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 4846f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 4847f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4848f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 4849f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 4850f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 4851f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 485244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG DAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 4853f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 4854f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4855f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 4856f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 4857f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 48581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4859f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 4860f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 4861f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 48624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 48644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 48654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 48664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 48674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 4868f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 4869a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 48701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 48714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 4872f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 4873f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 4874f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 4875f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 48769ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 48779ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 48789ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 4879f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 4880f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 48811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 48824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 48844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 48854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 48864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 48874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 4888ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 48894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 48904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 48914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 48924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 48934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 48944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 48954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 48964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 48974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 48984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 48994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAG BSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 49004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 4901ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo, GCI); 49024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 49034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 49044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 49054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 49064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 49074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 49084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 49094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 49104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 49114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 49124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 49134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 49144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 49154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 49164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 49174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 49184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 49204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 49214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 49224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 49234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 49244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 49254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 49264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 49274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 49284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 49299ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49309ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49319ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent)); 49329ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49339ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49349ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases. 49359ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 49364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 49384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 49394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 49404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 49414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 49429ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49439ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49449ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 49454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 49509453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 49519453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 49529453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 49533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 49543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 49553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 49563a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG HSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 49573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 4958ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 49593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 49603a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 49613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 49623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 49633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 49643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 49653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 49664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 49673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 49683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAG JSDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 49693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 4970ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo, GCI); 497137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 49723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 49733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 497437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 49753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 49763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 49773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 49783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 497937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 498037efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 498137efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 498237efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 498337efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 498437efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 49854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 49863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 49879ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49889ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49899ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB)); 4990f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 49914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 4992f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 49939ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 49949ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 49959ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 499637efe6764568a3829fee26aba532283131d1a104Nate Begeman } 499737efe6764568a3829fee26aba532283131d1a104Nate Begeman } 499837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 499937efe6764568a3829fee26aba532283131d1a104Nate Begeman 5000b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 5001b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 5002b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5003b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 5004b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5005b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 5006b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 50079ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 50089ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 50099ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5010b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5011b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5012b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 5013f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 5014f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 5015d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 501644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey SelectionDAG SDAG(TLI, MF, getAnalysisToUpdate<MachineModuleInfo>()); 5017f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 5018ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo, GCI); 5019d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5020f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 5021f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 5022f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 5023d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5024f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 5025f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 5026f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 5027f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 5028d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5029d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 5030d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 5031d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 5032d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 503357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 5034d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 5035d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 5036d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 5037d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 5038d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 5039d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 50409ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn]. 50419ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 50429ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB)); 5043d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 5044d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5045d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5046f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5047d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5048d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 504957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 505057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5051d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5052d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 50532452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 505457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5055f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 505657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 5057a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 50581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5059a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 506013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 5061a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng//===----------------------------------------------------------------------===// 5062a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// ScheduleAndEmitDAG - Pick a safe ordering and emit instructions for each 5063a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 5064a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengvoid SelectionDAGISel::ScheduleAndEmitDAG(SelectionDAG &DAG) { 5065a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 506613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 5067eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 506813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 506913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 5070eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 50719373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 50724ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 507313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 50749ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey ScheduleDAG *SL = Ctor(this, &DAG, BB); 5075a3818e6f9a62db0c5b6aee28e44c30d5f96c9fa4Chris Lattner BB = SL->Run(); 50763e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 50773e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman if (ViewSUnitDAGs) SL->viewGraph(); 50783e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 5079cccf1232a69e2d78516c61a97e7bfa26acefb714Evan Cheng delete SL; 5080a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 50810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 508203fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 50839ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 50849ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 50859ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 50869ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 5087755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5088755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 5089755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5090755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 5091755480681c795d585c73556c028b6143c46bda86Chris Lattner 5092755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 5093755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5094755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 5095755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5096755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 5097dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 50982e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 50992e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5100755480681c795d585c73556c028b6143c46bda86Chris Lattner 5101755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5102755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5103755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5104755480681c795d585c73556c028b6143c46bda86Chris Lattner 5105755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 51062e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5107755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5108755480681c795d585c73556c028b6143c46bda86Chris Lattner 5109755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5110755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 51112e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5112ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5113755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5114755480681c795d585c73556c028b6143c46bda86Chris Lattner 5115755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5116755480681c795d585c73556c028b6143c46bda86Chris Lattner 5117755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5118755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5119755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5120755480681c795d585c73556c028b6143c46bda86Chris Lattner 5121755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5122755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5123755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5124755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5125755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 51262e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 51272e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 51282e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5129755480681c795d585c73556c028b6143c46bda86Chris Lattner 5130755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5131755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5132755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5133755480681c795d585c73556c028b6143c46bda86Chris Lattner 5134755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 51352e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5136755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5137755480681c795d585c73556c028b6143c46bda86Chris Lattner 5138755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5139755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 51402e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5141755480681c795d585c73556c028b6143c46bda86Chris Lattner 51422e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 5143ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5144755480681c795d585c73556c028b6143c46bda86Chris Lattner 5145755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5146755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5147755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5148755480681c795d585c73556c028b6143c46bda86Chris Lattner 5149755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5150755480681c795d585c73556c028b6143c46bda86Chris Lattner 5151755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5152755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5153755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5154755480681c795d585c73556c028b6143c46bda86Chris Lattner 51559ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 51560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 51570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 51580e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 51590e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 51600e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 51610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 51620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 51640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 51650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 51670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 51680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 51690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51700e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 51710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 51720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 51730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 51740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 51750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 51760e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 51770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 51780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 51790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 51800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5181832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 51820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 51830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 51840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 51864b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner MVT::ValueType IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 518736d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 51884b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 51890e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 51900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 51910e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 51920e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 51930e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 51940e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 51950e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 51960e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 51970e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5198794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 51991997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5200