SelectionDAGISel.cpp revision 5e84368b26415b3bb7f3f8d9cff3e05938dd82d0
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" 45a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 46db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 47db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/MathExtras.h" 48db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 497e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 5370587ea813986bb0dbef71610091d496e28c22a6Chris LattnerEnableValueProp("enable-value-prop", cl::Hidden); 5470587ea813986bb0dbef71610091d496e28c22a6Chris Lattnerstatic cl::opt<bool> 5570587ea813986bb0dbef71610091d496e28c22a6Chris LattnerEnableLegalizeTypes("enable-legalize-types", cl::Hidden); 56ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 57ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 58da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 597944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 60a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 61a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 62a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 63a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 64a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 653e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 663e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 675bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 687944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 693e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic const bool ViewISelDAGs = 0, ViewSchedDAGs = 0, ViewSUnitDAGs = 0; 707944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 717944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 72eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 73eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 74eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 75eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 76eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 77eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 78eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 79eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 80eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 81eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 82eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 83eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 84844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 85844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 86844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 87844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 88844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 89844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 9013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 91844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 92844731a7f1909f55935e3514c9e713a62d67662eDan GohmandefaultListDAGScheduler("default", " Best scheduler for the target", 93844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 944ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 955c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengnamespace { struct SDISelAsmOperandInfo; } 96bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 971d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// ComputeLinearIndex - Given an LLVM IR aggregate type and a sequence 981d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// insertvalue or extractvalue indices that identify a member, return 991d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// the linearized index of the start of the member. 1001d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 1011d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanstatic unsigned ComputeLinearIndex(const TargetLowering &TLI, const Type *Ty, 1021d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const unsigned *Indices, 1031d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const unsigned *IndicesEnd, 1041d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned CurIndex = 0) { 1051d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Base case: We're done. 1068f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && Indices == IndicesEnd) 1071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman return CurIndex; 1081d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 1091d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Given a struct type, recursively traverse the elements. 1101d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (const StructType *STy = dyn_cast<StructType>(Ty)) { 1118f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman for (StructType::element_iterator EB = STy->element_begin(), 1128f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman EI = EB, 1131d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EE = STy->element_end(); 1141d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI != EE; ++EI) { 1158f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && *Indices == unsigned(EI - EB)) 1168f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return ComputeLinearIndex(TLI, *EI, Indices+1, IndicesEnd, CurIndex); 1178f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman CurIndex = ComputeLinearIndex(TLI, *EI, 0, 0, CurIndex); 1181d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Given an array type, recursively traverse the elements. 1211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 1221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *EltTy = ATy->getElementType(); 1231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) { 1248f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && *Indices == i) 1258f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return ComputeLinearIndex(TLI, EltTy, Indices+1, IndicesEnd, CurIndex); 1268f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman CurIndex = ComputeLinearIndex(TLI, EltTy, 0, 0, CurIndex); 1271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // We haven't found the type we're looking for, so keep searching. 1308f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return CurIndex + 1; 1311d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman} 1321d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 133f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// ComputeValueVTs - Given an LLVM IR type, compute a sequence of 13483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands/// MVTs that represent all the individual underlying 135f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// non-aggregate types that comprise it. 1361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 1371d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// If Offsets is non-null, it points to a vector to be filled in 1381d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// with the in-memory offsets of each of the individual values. 1391d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 140f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnerstatic void ComputeValueVTs(const TargetLowering &TLI, const Type *Ty, 1411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVectorImpl<MVT> &ValueVTs, 1421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVectorImpl<uint64_t> *Offsets = 0, 1431d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman uint64_t StartingOffset = 0) { 144f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given a struct type, recursively traverse the elements. 145f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const StructType *STy = dyn_cast<StructType>(Ty)) { 1461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const StructLayout *SL = TLI.getTargetData()->getStructLayout(STy); 1471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (StructType::element_iterator EB = STy->element_begin(), 1481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI = EB, 1491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EE = STy->element_end(); 1501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI != EE; ++EI) 1511d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, *EI, ValueVTs, Offsets, 1521d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman StartingOffset + SL->getElementOffset(EI - EB)); 153f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 154f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner } 155f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given an array type, recursively traverse the elements. 156f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 157f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner const Type *EltTy = ATy->getElementType(); 1581d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman uint64_t EltSize = TLI.getTargetData()->getABITypeSize(EltTy); 159f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) 1601d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, EltTy, ValueVTs, Offsets, 1611d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman StartingOffset + i * EltSize); 162f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 16323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 16483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands // Base case: we can get an MVT for this LLVM IR type. 165f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner ValueVTs.push_back(TLI.getValueType(Ty)); 1661d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (Offsets) 1671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Offsets->push_back(StartingOffset); 168f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner} 16923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 170f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnernamespace { 1710fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegsForValue - This struct represents the registers (physical or virtual) 1720fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// that a particular set of values is assigned, and the type information about 1730fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// the value. The most common situation is to represent one value at a time, 1740fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// but struct or array values are handled element-wise as multiple values. 1750fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// The splitting of aggregates is performed recursively, so that we never 1760fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have aggregate-typed registers. The values at this point do not necessarily 1770fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have legal types, so each value may require one or more registers of some 1780fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// legal type. 1790fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 1809525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 18123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// TLI - The TargetLowering object. 1820fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 18323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const TargetLowering *TLI; 18423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 1850fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs - The value types of the values, which may not be legal, and 1860fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// may need be promoted or synthesized from one or more registers. 1870fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 18883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 189864635ad7b3046d3042311423071152c613961deChris Lattner 1900fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegVTs - The value types of the registers. This is the same size as 1910fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs and it records, for each value, what the type of the assigned 1920fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// register or registers are. (Individual values are never synthesized 1930fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// from more than one type of register.) 1940fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 1950fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// With virtual registers, the contents of RegVTs is redundant with TLI's 1960fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// getRegisterType member function, however when with physical registers 1970fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// it is necessary to have a separate record of the types. 198864635ad7b3046d3042311423071152c613961deChris Lattner /// 19983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RegVTs; 200864635ad7b3046d3042311423071152c613961deChris Lattner 2010fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Regs - This list holds the registers assigned to the values. 2020fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Each legal or promoted value requires one register, and each 2030fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// expanded value requires multiple registers. 2040fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2050fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman SmallVector<unsigned, 4> Regs; 206864635ad7b3046d3042311423071152c613961deChris Lattner 20723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue() : TLI(0) {} 208864635ad7b3046d3042311423071152c613961deChris Lattner 20923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 210b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 21183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT regvt, MVT valuevt) 2120fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {} 21323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 214b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 21583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const SmallVector<MVT, 4> ®vts, 21683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const SmallVector<MVT, 4> &valuevts) 2170fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {} 21823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 21923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned Reg, const Type *Ty) : TLI(&tli) { 22023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(tli, Ty, ValueVTs); 22123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 222b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 22383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 22423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 22583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI->getRegisterType(ValueVT); 22623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 22723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Regs.push_back(Reg + i); 22823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegVTs.push_back(RegisterVT); 22923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Reg += NumRegs; 23023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 231864635ad7b3046d3042311423071152c613961deChris Lattner } 232864635ad7b3046d3042311423071152c613961deChris Lattner 23341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner /// append - Add the specified values to this one. 23441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner void append(const RegsForValue &RHS) { 23541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner TLI = RHS.TLI; 23641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end()); 23741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end()); 23841f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner Regs.append(RHS.Regs.begin(), RHS.Regs.end()); 23941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } 24041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 24141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 242864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 24323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// this value and returns the result as a ValueVTs value. This uses 244864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 245b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 246864635ad7b3046d3042311423071152c613961deChris Lattner SDOperand getCopyFromRegs(SelectionDAG &DAG, 247b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 248c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 249c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 250c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 251c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 252b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 253c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 254b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const; 255c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 256c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 257c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 258c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 259c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 2609f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const; 261864635ad7b3046d3042311423071152c613961deChris Lattner }; 262864635ad7b3046d3042311423071152c613961deChris Lattner} 2634ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 2641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 2651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 2669373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 2679373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 2689373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 2699373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 2704576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng MachineBasicBlock *BB, 2714576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng bool Fast) { 2729373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 2739373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2749373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 2754576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng return createTDListDAGScheduler(IS, DAG, BB, Fast); 2769373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 2779373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 2789373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 2794576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng return createBURRListDAGScheduler(IS, DAG, BB, Fast); 2809373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 2819373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 2829373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2839373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2849373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 2851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 2861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 287f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 288f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 2891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 2901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 29284bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo; 2931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 2951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 2971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 2981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 3001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 3011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 3029f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 3031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 3051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 3061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 3071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 3081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 309f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 310f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 311f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 312f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 313f40708223e409a152834b1553c6883ff2035b957Duncan Sands 31483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned MakeReg(MVT VT) { 31584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT)); 3161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 317571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 318571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 319571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 320571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 321571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 322571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 323edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 3253c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 3271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 3281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 331ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 332ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner struct LiveOutInfo { 333ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits; 334ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne, KnownZero; 335ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LiveOutInfo() : NumSignBits(0) {} 336ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner }; 337ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 338ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// LiveOutRegInfo - Information about live out vregs, indexed by their 339ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// register number offset by 'FirstVirtualRegister'. 340ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner std::vector<LiveOutInfo> LiveOutRegInfo; 3411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 3421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 344cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 345cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 346cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 347f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 3488806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 3498806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 350f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 351f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 352f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 354f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 355ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth/// switch or atomic instruction, which may expand to multiple basic blocks. 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 3581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 3591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 360f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 361571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 362f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 3631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 3641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 3651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 367bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 370bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 371bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 372bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 373f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 374bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 375bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 376bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 377bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 379edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 38084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) { 3811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 382bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 383bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 38416ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 38516ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 386bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 387bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 3881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 389bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 390bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 391bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 3922aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 3931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 3941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 395b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 3961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 397514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 398ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 399d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 400ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 401a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 402b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 403d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 4041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 4056266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 4061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4082aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 4092aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 4121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 4131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 4141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 4161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 4171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 4182aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 4190e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB); 4201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 4210e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MF.push_back(MBB); 4221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 4241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 4251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 4268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 4278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 4288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 42983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(PN->getType()); 4307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 4328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 433c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 434b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 435c0f64ffab93d11fb27a3b8a0707b77400918a20eEvan Cheng BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 4368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 4371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4403c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 4413c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 4423c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 44310a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 44410a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// In the case that the given value has struct or array type, this function 44510a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// will assign registers for each member or element. 44610a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 4473c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 44883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 449b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner ComputeValueVTs(TLI, V->getType(), ValueVTs); 45095b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 45123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned FirstReg = 0; 452b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 45383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 45483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI.getRegisterType(ValueVT); 4558c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 456b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumRegs = TLI.getNumRegisters(ValueVT); 45723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 45823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned R = MakeReg(RegisterVT); 45923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman if (!FirstReg) FirstReg = R; 46023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 46123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 46223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return FirstReg; 4633c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 4641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 4681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 4691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 4731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4740da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DenseMap<const Value*, SDOperand> NodeMap; 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 476d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 477d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 478d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 479d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 480a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVector<SDOperand, 8> PendingLoads; 481d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 48286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingExports - CopyToReg nodes that copy values to virtual registers 48386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// for export to other blocks need to be emitted before any terminator 48486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instruction, but they have no other ordering requirements. We bunch them 48586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// up and the emit a single tokenfactor for them just before terminator 48686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instructions. 48786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman std::vector<SDOperand> PendingExports; 48886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 4895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 4905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 4915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 4925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 4935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 4945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 4955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 4965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 4975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 4985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 4995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 5005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 5015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 5025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 5035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 5045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 5055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 5074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 5084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 5094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 5104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 5124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 5134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 5164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 5175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 5185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 519f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 520f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 521f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 522f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 523f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 524f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 525f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 526f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 527f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 528f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 529f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 530f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 531f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 532f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 533f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 534f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 535f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 536b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 537b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 5385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 5405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 541f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 5424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 5435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 5445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 5455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 5465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 547f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 548f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 5495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 5514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 5524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 5534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 5544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 557f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 5591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 5601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 5611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 5621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 5631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 564a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 5655f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 5661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 567f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 568f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 569f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 5703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 5713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 5723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 5734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 574f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 5761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 5771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 578ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 579ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen /// GCI - Garbage collection metadata for the function. 580ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *GCI; 5811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 5835f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 584ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FunctionLoweringInfo &funcinfo, 585ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *gci) 5865f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 587ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FuncInfo(funcinfo), GCI(gci) { 5881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 5891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 59086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getRoot - Return the current virtual root of the Selection DAG, 59186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// flushing any PendingLoad items. This must be done before emitting 59286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// a store or any other node that may need to be ordered after any 59386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// prior load instructions. 594a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 595a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner SDOperand getRoot() { 596d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 597d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 598edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 599d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 600d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root = PendingLoads[0]; 601d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 602d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 603d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 604d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 605d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 606d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 607bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 608bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 609d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 610d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 611d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 612a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 613a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 61486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getControlRoot - Similar to getRoot, but instead of flushing all the 61586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingLoad items, flush all the PendingExports items. It is necessary 61686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// to do this before emitting a terminator instruction. 61786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// 61886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand getControlRoot() { 61986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Root = DAG.getRoot(); 62086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 62186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports.empty()) 62286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 62386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 62486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman // Turn all of the CopyToReg chains into one factored node. 62586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (Root.getOpcode() != ISD::EntryToken) { 62686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned i = 0, e = PendingExports.size(); 62786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (; i != e; ++i) { 62886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(PendingExports[i].Val->getNumOperands() > 1); 62986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports[i].Val->getOperand(0) == Root) 63086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman break; // Don't add the root if we already indirectly depend on it. 63186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 63286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 63386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (i == e) 63486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Root); 63586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 63686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 63786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 63886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman &PendingExports[0], 63986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.size()); 64086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.clear(); 64186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(Root); 64286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 64386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 64486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 64586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman void CopyValueToVirtualRegister(Value *V, unsigned Reg); 646571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 6471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 6481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 6501e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 6511e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 6521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 6531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 6541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 6561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 6571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 6581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 6591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 6631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 664199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand getValue(const Value *V); 6651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6660da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner void setValue(const Value *V, SDOperand NewN) { 6671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand &N = NodeMap[V]; 6681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 6690da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 6701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6714e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 6725c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 673e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 674e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 675f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 676571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 677571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 678571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 6798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 680571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 6816f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands void LowerCallTo(CallSite CS, SDOperand Callee, bool IsTailCall, 682070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 683dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 6841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 6851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 6861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 687f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 6881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 6891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 690b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 691dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 692b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 693b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 694b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 695dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 696b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 697b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 698b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 699dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 700b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 701b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 702b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 7034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 7044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 7054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 7064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 707f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 7084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 7094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 7104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 7114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 71237efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 7133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 7143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 715f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 7161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 717b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 718b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 7191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7207f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 721e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 7225fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 7237f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 7247f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 7251628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 7267f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 72701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 728b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 7291628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 7307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 7317f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 7321628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 7337f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 7341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7357f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 7367f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 7377f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 7387f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 7397f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 7407f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 7417f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 7427f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 7437f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 74424d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 7453822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 7463822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 74745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 74845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 749b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVICmp(User &I); 750b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVFCmp(User &I); 7513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 7523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 7533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 7543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 7553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 7563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 7573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 7583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 7593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 7603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 7613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 7623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 7633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 7641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7652bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 7662bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 7673e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 768c7029805ef35ce9805931067b841e6af11db382eChris Lattner 7691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitExtractValue(ExtractValueInst &I); 7701d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitInsertValue(InsertValueInst &I); 771041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 7721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 7731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 7741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 7761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 7771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 7781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 7791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 7801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 7811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 782fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 783c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 7840eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 7851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 7871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 7881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 7891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 7901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 791ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman void visitGetResult(GetResultInst &I); 79240a04216daaaee119665e023019c005306ec48acDevang Patel 7931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 7941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 7951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 7961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 7981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 7991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 8001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 80163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 80263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangprivate: 80363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang inline const char *implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op); 80463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 8051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 8061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 8071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 809b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyFromParts - Create a value that contains the specified legal parts 810b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// combined into the value they represent. If the parts combine to a type 811b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// larger then ValueVT then AssertOp can be used to specify whether the extra 812b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 8134468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner/// (ISD::AssertSext). 8146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic SDOperand getCopyFromParts(SelectionDAG &DAG, 8156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman const SDOperand *Parts, 8166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 81783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 81883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT, 8194468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner ISD::NodeType AssertOp = ISD::DELETED_NODE) { 820014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts > 0 && "No parts to assemble!"); 821014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TargetLowering &TLI = DAG.getTargetLoweringInfo(); 822014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand Val = Parts[0]; 823014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 824014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts > 1) { 825014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the value from multiple parts. 82683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 82783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 82883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned ValueBits = ValueVT.getSizeInBits(); 829014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 830014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the power of 2 part. 831014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = NumParts & (NumParts - 1) ? 832014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1 << Log2_32(NumParts) : NumParts; 833014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = PartBits * RoundParts; 83483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RoundVT = RoundBits == ValueBits ? 83583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT : MVT::getIntegerVT(RoundBits); 836014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand Lo, Hi; 837014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 838014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts > 2) { 83983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT HalfVT = MVT::getIntegerVT(RoundBits/2); 840014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT); 841014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2, 842014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, HalfVT); 8436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 844014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Parts[0]; 845014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = Parts[1]; 8466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 847014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 848014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 849014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi); 850014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 851014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts < NumParts) { 852014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the trailing non-power-of-2 part. 853014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 85483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OddVT = MVT::getIntegerVT(OddParts * PartBits); 855014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT); 856014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 857014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Combine the round and odd parts. 858014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Val; 859014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 860014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 86183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT TotalVT = MVT::getIntegerVT(NumParts * PartBits); 862014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi); 863014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::SHL, TotalVT, Hi, 86483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands DAG.getConstant(Lo.getValueType().getSizeInBits(), 865014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 866014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo); 867014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi); 868014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 869014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 870014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Handle a multi-element vector. 87183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 872014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumIntermediates; 873014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumRegs = 874014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 875014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands RegisterVT); 876014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 87735213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 878014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 879014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == Parts[0].getValueType() && 880014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Part type doesn't match part!"); 881014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 882014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the parts into intermediate operands. 883014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SmallVector<SDOperand, 8> Ops(NumIntermediates); 884014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumIntermediates == NumParts) { 885014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the register was not expanded, truncate or copy the value, 886014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // as appropriate. 887014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumParts; ++i) 888014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 889014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 890014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts > 0) { 891014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the intermediate type was expanded, build the intermediate operands 892014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // from the parts. 893014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts % NumIntermediates == 0 && 894014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Must expand into a divisible number of parts!"); 895014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned Factor = NumParts / NumIntermediates; 896014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumIntermediates; ++i) 897014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 898014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 899014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 900014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 901014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 902014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // operands. 90383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands Val = DAG.getNode(IntermediateVT.isVector() ? 904014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, 905014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT, &Ops[0], NumIntermediates); 9066183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 907014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 909014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // There is now one part, held in Val. Correct it to match ValueVT. 910014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT = Val.getValueType(); 9116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 912014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) 913014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return Val; 914014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 91583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 91683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.isVector() && "Unknown vector conversion!"); 917014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 9186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 92083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (ValueVT.isVector()) { 92183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 92283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 923014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Only trivial scalar-to-vector conversions should get here!"); 924014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 925014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 92783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && 92883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.isInteger()) { 9298e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(PartVT)) { 930014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // For a truncate, see if we have any information to 931014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // indicate whether the truncated bits will always be 932014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // zero or sign-extension. 933014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (AssertOp != ISD::DELETED_NODE) 934014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(AssertOp, PartVT, Val, 935014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getValueType(ValueVT)); 936014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 937014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 938014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 939014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 941014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 94283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 9438e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(Val.getValueType())) 9444468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner // FP_ROUND's are always exact here. 945d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val, 9464468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner DAG.getIntPtrConstant(1)); 947d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val); 948d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner } 949014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 95083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) 951014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 952014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 953014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 954d27c991cebe48fdf82b5d9eec6c2a1a244f82622Chris Lattner return SDOperand(); 9556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 9566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 957b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyToParts - Create a series of nodes that contain the specified value 958b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// split into legal parts. If the parts contain more bits than Val, then, for 959b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// integers, ExtendKind can be used to specify how to generate the extra bits. 9606183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 9616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand Val, 9626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SDOperand *Parts, 9636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 96483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 965b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 96625ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 96783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PtrVT = TLI.getPointerTy(); 96883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = Val.getValueType(); 96983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 970014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 971014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 972014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!NumParts) 973014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 974014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 97583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 976014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) { 977014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "No-op copy with multiple parts!"); 978014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 979014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 980014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 981014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 98283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (NumParts * PartBits > ValueVT.getSizeInBits()) { 983014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover more bits than the value has, promote the value. 98483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 985014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "Do not know what to promote to!"); 986014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 98783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartVT.isInteger() && ValueVT.isInteger()) { 98883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 989014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ExtendKind, ValueVT, Val); 990014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 991014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 992014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 99383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartBits == ValueVT.getSizeInBits()) { 994014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Different types of the same size. 995014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && PartVT != ValueVT); 996014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 99783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (NumParts * PartBits < ValueVT.getSizeInBits()) { 998014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover less bits than value has, truncate the value. 99983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && ValueVT.isInteger()) { 100083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1001014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1002014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1003014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1004014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1005014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 10066183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1007014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The value may have changed - recompute ValueVT. 1008014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = Val.getValueType(); 100983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(NumParts * PartBits == ValueVT.getSizeInBits() && 1010014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Failed to tile the value with PartVT!"); 1011014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1012014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 1013014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(PartVT == ValueVT && "Type conversion failed!"); 1014014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 10156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 10166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1018014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Expand the value into multiple parts. 1019014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts & (NumParts - 1)) { 1020014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is not a power of 2. Split off and copy the tail. 102183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(PartVT.isInteger() && ValueVT.isInteger() && 1022014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Do not know what to expand to!"); 1023014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = 1 << Log2_32(NumParts); 1024014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = RoundParts * PartBits; 1025014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 1026014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands SDOperand OddVal = DAG.getNode(ISD::SRL, ValueVT, Val, 1027014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(RoundBits, 1028014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 1029014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT); 1030014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1031014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The odd parts were reversed by getCopyToParts - unreverse them. 1032014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts + RoundParts, Parts + NumParts); 1033014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands NumParts = RoundParts; 103483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1035014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1036014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1037014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1038014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is a power of 2. Repeatedly bisect the value using 1039014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // EXTRACT_ELEMENT. 104025eb043759c23b61769108f78382eb9701c41db2Duncan Sands Parts[0] = DAG.getNode(ISD::BIT_CONVERT, 104183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT::getIntegerVT(ValueVT.getSizeInBits()), 104225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Val); 1043014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 1044014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i < NumParts; i += StepSize) { 1045014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ThisBits = StepSize * PartBits / 2; 104683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::getIntegerVT (ThisBits); 104725eb043759c23b61769108f78382eb9701c41db2Duncan Sands SDOperand &Part0 = Parts[i]; 104825eb043759c23b61769108f78382eb9701c41db2Duncan Sands SDOperand &Part1 = Parts[i+StepSize/2]; 104925eb043759c23b61769108f78382eb9701c41db2Duncan Sands 105025eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 105125eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(1, PtrVT)); 105225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 105325eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(0, PtrVT)); 105425eb043759c23b61769108f78382eb9701c41db2Duncan Sands 105525eb043759c23b61769108f78382eb9701c41db2Duncan Sands if (ThisBits == PartBits && ThisVT != PartVT) { 105625eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0); 105725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1); 105825eb043759c23b61769108f78382eb9701c41db2Duncan Sands } 1059014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1060014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1061014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1062014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1063014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts, Parts + NumParts); 1064014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1065014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1066014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1067014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1068014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Vector ValueVT. 1069014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 10706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 107183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 10726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 1073014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 107483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 107583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 1076a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 1077a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 1078a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 10796183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1081014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 10826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 10836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 10846183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 108783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 10886183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 10896183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 10906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 10916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 10926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 109383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned NumElements = ValueVT.getVectorNumElements(); 10946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 109635213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 10976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 10986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 10996183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 11006183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman SmallVector<SDOperand, 8> Ops(NumIntermediates); 11016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 110283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (IntermediateVT.isVector()) 11036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 11046183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 11056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 110625ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 11076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 11086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 11096183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 111025ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 11116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 11136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 11146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 11156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 11166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 1117532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 11186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 11196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 11206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 11216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 11226183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 11236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 11246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 1125532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 11266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 11286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1130199862b74973198c2ab5a139f664c86713e7b579Chris LattnerSDOperand SelectionDAGLowering::getValue(const Value *V) { 1131199862b74973198c2ab5a139f664c86713e7b579Chris Lattner SDOperand &N = NodeMap[V]; 1132199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 1133199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1134199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 113583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(V->getType(), true); 1136b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1137b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) 1138b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstant(CI->getValue(), VT); 1139b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1140b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) 1141199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 1142b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1143b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (isa<ConstantPointerNull>(C)) 1144199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 1145b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1146b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) 1147b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 1148b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 11491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C) && !isa<VectorType>(V->getType()) && 11501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman !V->getType()->isAggregateType()) 11516833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 1152b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1153b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 1154b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner visit(CE->getOpcode(), *CE); 1155b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SDOperand N1 = NodeMap[V]; 1156b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 1157b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N1; 1158b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner } 1159b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 11601d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) { 11611d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<SDOperand, 4> Constants; 11621d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end(); 11631d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman OI != OE; ++OI) { 11641d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDNode *Val = getValue(*OI).Val; 11654bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i) 11661d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants.push_back(SDOperand(Val, i)); 11671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 11684bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands return DAG.getMergeValues(&Constants[0], Constants.size()); 11691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 11701d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 11711d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (const ArrayType *ATy = dyn_cast<ArrayType>(C->getType())) { 11721d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 11731d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman "Unknown array constant!"); 11741d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumElts = ATy->getNumElements(); 11758a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumElts == 0) 11768a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return SDOperand(); // empty array 11771d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT EltVT = TLI.getValueType(ATy->getElementType()); 11781d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<SDOperand, 4> Constants(NumElts); 11791d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0, e = NumElts; i != e; ++i) { 11801d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C)) 11811d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getNode(ISD::UNDEF, EltVT); 11821d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (EltVT.isFloatingPoint()) 11831d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstantFP(0, EltVT); 11841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else 11851d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstant(0, EltVT); 11861d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 11874bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands return DAG.getMergeValues(&Constants[0], Constants.size()); 11881d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 11891d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 11901d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (const StructType *STy = dyn_cast<StructType>(C->getType())) { 11911d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 11921d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman "Unknown struct constant!"); 11931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumElts = STy->getNumElements(); 11948a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumElts == 0) 11958a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return SDOperand(); // empty struct 11961d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<SDOperand, 4> Constants(NumElts); 11971d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0, e = NumElts; i != e; ++i) { 11981d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT EltVT = TLI.getValueType(STy->getElementType(i)); 11991d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C)) 12001d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getNode(ISD::UNDEF, EltVT); 12011d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (EltVT.isFloatingPoint()) 12021d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstantFP(0, EltVT); 12031d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else 12041d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstant(0, EltVT); 12051d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12064bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands return DAG.getMergeValues(&Constants[0], Constants.size()); 12071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12081d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 12096833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner const VectorType *VecTy = cast<VectorType>(V->getType()); 1210b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumElements = VecTy->getNumElements(); 1211b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 12126833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // Now that we know the number and type of the elements, get that number of 12136833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // elements into the Ops array based on what kind of constant it is. 12146833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SmallVector<SDOperand, 16> Ops; 1215b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 1216b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 1217b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.push_back(getValue(CP->getOperand(i))); 1218199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 12196833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 12206833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Unknown vector constant!"); 122183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(VecTy->getElementType()); 12226833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 1223b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SDOperand Op; 12246833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C)) 12256833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getNode(ISD::UNDEF, EltVT); 122683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands else if (EltVT.isFloatingPoint()) 12276833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstantFP(0, EltVT); 1228b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner else 12296833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstant(0, EltVT); 1230b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.assign(NumElements, Op); 1231199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1232b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1233b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // Create a BUILD_VECTOR node. 1234b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 1235199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1236199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1237b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // If this is a static alloca, generate it as the frameindex instead of 1238b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // computation. 1239199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 1240199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 1241b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 1242199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 1243199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 1244199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1245199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1246251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 1247251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 1248199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 12496833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner RegsForValue RFV(TLI, InReg, V->getType()); 1250b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Chain = DAG.getEntryNode(); 1251b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 1252199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 1253199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1254199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 12551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 12561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 125786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot())); 12581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 12591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1260b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1261bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> NewValues; 126286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman NewValues.push_back(getControlRoot()); 126386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 1264ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman SDOperand RetOp = getValue(I.getOperand(i)); 1265b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1266ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman SmallVector<MVT, 4> ValueVTs; 1267ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ComputeValueVTs(TLI, I.getOperand(i)->getType(), ValueVTs); 1268ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned j = 0, f = ValueVTs.size(); j != f; ++j) { 1269ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT VT = ValueVTs[j]; 1270ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1271ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // FIXME: C calling convention requires the return type to be promoted to 1272ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // at least 32-bit. But this is not necessary for non-C calling conventions. 1273ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.isInteger()) { 1274ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT MinVT = TLI.getRegisterType(MVT::i32); 1275ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.bitsLT(MinVT)) 1276ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman VT = MinVT; 1277ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1278b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1279ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman unsigned NumParts = TLI.getNumRegisters(VT); 1280ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT PartVT = TLI.getRegisterType(VT); 1281ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 1282ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1283ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1284ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman const Function *F = I.getParent()->getParent(); 1285ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (F->paramHasAttr(0, ParamAttr::SExt)) 1286ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 1287ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman else if (F->paramHasAttr(0, ParamAttr::ZExt)) 1288ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 1289ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1290ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman getCopyToParts(DAG, SDOperand(RetOp.Val, RetOp.ResNo + j), 1291ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman &Parts[0], NumParts, PartVT, ExtendKind); 1292ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1293ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned i = 0; i < NumParts; ++i) { 1294ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(Parts[i]); 1295ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy())); 1296ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1297ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 12981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1299bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 1300bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 13011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1303571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 1304571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 1305571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 1306571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 1307571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 1308571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 1309571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1310571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 1311571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 1312571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1313571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 131486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(V, Reg); 1315571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1316571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 13178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 13188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 13198c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 13208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 13218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 13228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 13238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 13248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13258c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 13278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 13288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 13318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 13328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 13338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 13348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 13378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 13388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 13418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 13438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13446a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 13456a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 13466a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 13476a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 13486a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 13496a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1350571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1351571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1352571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1353571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1354571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1355571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1356571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1357e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1358571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1359e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1360e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 13616a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 13626a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 13636a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1364571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1365571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1366e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1367e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1368e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1369e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 13705a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 13715a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 13725a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 13735a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 13745a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1375e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1376e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1377e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1378e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1379e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1380e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1381e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1382e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1383e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1384e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1385e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1386e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1387e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1388e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1389e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1390e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1391e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1392e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1393e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1394e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1395e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1396e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1397e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1398e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1399e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1400e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1401e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 14026bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 14036bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 1404e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1405e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1406e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1407e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1408e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1409e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1410e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1411e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1412e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1413e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1414e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1415e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1416e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 14170da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1418e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1419571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1420571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1421571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 14225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1423571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1424571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1425571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1426571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1427571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 14286b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 14295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1430571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1431571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1432571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1433571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1434d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1435d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1436571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 14370e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineFunction &MF = DAG.getMachineFunction(); 14380e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock()); 14390e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurBB->getParent()->insert(++BBI, TmpBB); 1440571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1441d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1442d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1443d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1444d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1445d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1446d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1447d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1448d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1449571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1450d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1451d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1452d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1453d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1454d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1455d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1456d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1457d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1458d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1459d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1460d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1461d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1462d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1463d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1464d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1465d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1466d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1467d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1468d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1469d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1470d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1471d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1472571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1473571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1474df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1475df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1476df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1477df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1478df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1479df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1480df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 14810ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 14820ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 14830ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 14840ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 14850ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 14860ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 14870ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 14880ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 14890ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1490df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1491df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1492df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 14931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 14941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 14951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 14961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 14971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 14981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 14991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 15001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 15011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 15021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 15042d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update machine-CFG edges. 15052d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Succ0MBB); 15062d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 15071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 15081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 150986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1510dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 151157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 151257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 151357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 151457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 151557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 151657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 151757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1518571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1519571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1520571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1521571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1522571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1523571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1524571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1525571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1526571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1527571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1528571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1529571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1530571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1531571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1532571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1533571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1534571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1535571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1536d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1537571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1538571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 15390ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 15400ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 15410ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 15420ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 15430ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1544df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1545df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1546df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1547df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1548df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1549df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1550df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1551df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1552df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1553df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1554df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 15555a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 15565a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 15570ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 15580ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 15590ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 15600e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMBB->getParent()->erase(SwitchCases[i].ThisBB); 15610ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1562df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1563571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1564571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 15652452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 15662452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 15676b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 15685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 15692452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 15702452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 15712452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 15721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 15731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1574f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1575f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1576f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 157757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand Cond; 157857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SDOperand CondLHS = getValue(CB.CmpLHS); 157957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 15805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 15815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 15825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 15835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 15845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 15855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 15865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 15875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand True = DAG.getConstant(1, CondLHS.getValueType()); 15885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 15895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 15905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 15915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 15925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 15935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 15955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 15965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 15975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand CmpOp = getValue(CB.CmpMHS); 159883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = CmpOp.getValueType(); 15993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 16015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 16025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 16035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 16045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 16055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 16065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16092d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update successor info 16102d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.TrueBB); 16112d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.FalseBB); 16122d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1613f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1614f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1615f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1616f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1617f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1618f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1619f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1620f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1621f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 162257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 162357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1624f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDOperand True = DAG.getConstant(1, Cond.getValueType()); 1625f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1626f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 162786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond, 162857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 162957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.FalseBB == NextBlock) 1630f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1631f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman else 1632f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 163357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.FalseBB))); 1634f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1635f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 16363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 163737efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 163837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1639f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 164083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PTy = TLI.getPointerTy(); 164186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy); 16423d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng SDOperand Table = DAG.getJumpTable(JT.JTI, PTy); 16433d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 16443d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 16453d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 164637efe6764568a3829fee26aba532283131d1a104Nate Begeman} 164737efe6764568a3829fee26aba532283131d1a104Nate Begeman 16483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 16493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 16503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 16513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 16523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 16533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 16543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 16553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SwitchOp = getValue(JTH.SValue); 165683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 16573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 16583a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 16593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16603a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 16613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 16623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 16633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 16643a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 16658e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 16663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 16673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 16683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 16693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 167186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp); 16723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 16733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 16753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 16763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 16775b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 16783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 16793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 16803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 16823a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 16833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 16843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 16853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 16863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 16873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SDOperand BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 16893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 16903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 16923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 16933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 16943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 16954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 16964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 16974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 16983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 16993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 17014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 17024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 17034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 17044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchOp = getValue(B.SValue); 170583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 17064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 17074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 17084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 17105b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 17114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 17124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 17134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand ShiftOp; 17158e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getShiftAmountTy())) 17164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 17174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 17194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 17214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SDOperand SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 17224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 17234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 17244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 172686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal); 17274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 17284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 17304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 17354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 17372d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17382d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.Default); 17392d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(MBB); 17402d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17412d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson SDOperand BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 17422d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(B.Default)); 17432d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 17454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 17464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 17484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 17494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 17514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 17524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 17544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 17554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 17564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 17574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 1758ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDOperand SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg, 1759ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner TLI.getPointerTy()); 17604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1761ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDOperand AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), SwitchVal, 1762ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DAG.getConstant(B.Mask, TLI.getPointerTy())); 17635b8f82e35b51bf007de07a7ca9347d804084ddf8Scott Michel SDOperand AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp, 17644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 17654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 17662d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17672d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.TargetBB); 17682d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(NextMBB); 17692d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 177086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDOperand BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), 17714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 17724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 17744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 17794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 17844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 17854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 17874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 17883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1789b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1790b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1791b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1792f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 17939fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1794fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1795fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1796fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 17976f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1798f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1799f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1800f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1801f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1802f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1803f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 180486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(&I, VMI->second); 1805f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 18069fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1807f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1808f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1809f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 18102d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 18112d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Drop into normal successor. 18122d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 18132d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(Return))); 1814b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1815b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1816b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1817b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1818b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 18195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1820b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1821dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1822b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1823b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1824b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1825dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1826dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1827dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1828dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 18294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1830dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 18315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1832b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1833b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1834b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1835b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1836b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1837b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1838b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1839b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1840b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1841b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1842b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1843b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1844b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1845b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1846b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1847b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1848b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 18495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1850b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1851b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1852b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 18535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1854b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1855b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1856b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1857b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1858b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1859b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1860b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1861b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1862b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1863b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1864b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1865b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1866b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 18670e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock()); 18680e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FallThrough); 1869b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1870b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1871b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1872b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 18735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 18755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 18765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 18775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 18785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 18795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 18805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 18815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 18825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 18835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 18845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 18855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1886b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1887b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1888b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1889b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1890b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1891b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1892b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1893b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1894b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1895b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1896b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1897b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1898dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1899dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1900b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1901b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 19027294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 19037294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov return (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 19047294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 19057294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 19067294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1907b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1908dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1909b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1910b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1911b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1912dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1913dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1914dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 19165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 19175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 19195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 19205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 19215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1922dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19237294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1924dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1925dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 19275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1928dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1929dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 19315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 19324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 19335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1934b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1935b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1936dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1937b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1938b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1939b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1940b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1941b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1942b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1943b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1944b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1945b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1946b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1947b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1948b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1949b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1950b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 19510e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB); 19520e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, JumpTableBB); 1953b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1954b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1955b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1956b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 19574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1958b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1959b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1960b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1961b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 19625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 19635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 19645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 19655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 19675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 19685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 19695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1970b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1971b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1972b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 19735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1974b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1975b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 19765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1977b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1978b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1979b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1980b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1981b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 1982b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1983b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1984b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1985b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 1986b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 1987b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 1988b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1989b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 1990b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 1991f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 1992b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 1993b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 1994b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 1995b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 1996b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1997b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 1998b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1999dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2000b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2001b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2002b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 2003b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 2004dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 2005b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 2006b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 2007b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 2008b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 2009b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 2010b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 2011b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2012b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 2013b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 2014b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 2015b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2016b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 2017b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 2018b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2019b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 2020b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 2021b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 2022b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2023b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 2024b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 2025b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 20265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 20275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 20284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 20295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 2030b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2031b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 2032b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 20335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 20345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 20355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 20365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 20375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 20395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 20404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 20414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 20424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 2043b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 20445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 20455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 20465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 20474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 2048b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 2049b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 205054e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 20514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 20524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 20534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 20544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 20554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 20564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 2057b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 20584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 20594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 2060b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 20635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 2064b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20657294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 20667294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 20677294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 20687294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 20697294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 20707294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 2071b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2072b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 2073b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 20745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 2075b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 2076b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2077b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 2078b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 2079b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 2080b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 2081b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 2082b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 2083b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 20845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 20855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 20865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 20875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 2088b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 20890e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB); 20900e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, TrueBB); 2091b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 2092b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2093b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2094b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 2095b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 2096b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 2097b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 2098b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 20995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 21005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 21015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 2102b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 21030e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 21040e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FalseBB); 2105b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 2106b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2107b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2108b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 2109b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 2110b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 21115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 21125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 2113b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2114b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2115b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 2116b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 2117b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 2118dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2119dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2120b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2121b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 21224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 21234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 21244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 21254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 21264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 21274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 21283ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 212983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned IntPtrBits = TLI.getPointerTy().getSizeInBits(); 21304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 21324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 21334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 21354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 21364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 21374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 21394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 21404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 21414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 21424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 21434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 21444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 21454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 21464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 21494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 21504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 21514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 21524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 21534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 21544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 21554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 21574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 21584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 21604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 21614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 21624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 21634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 21644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 21654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 21664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 21674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 2168ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 21694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 21704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 21714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 21724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 21734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 21754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 21764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 21784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 21794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 21804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 2181e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 21824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 21834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 21844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 21854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 21884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 21894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 21914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 21924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 21934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 21944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 21954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 21974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 21984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 21994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 22004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 22034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 22044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 2206e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 22074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 22084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 22124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 22144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 22164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 22174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 22184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 22204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 22224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 22234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 22244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 22254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22260e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 22270e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, CaseBB); 22284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 22294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 22304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 22314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 2234efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 22354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 22364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 22384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 22394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 22414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 22434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 22444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 224686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman/// Clusterify - Transform simple list of Cases into list of CaseRange's 22475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 22485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 22495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 22505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 22525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 22535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 22545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 22555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 22565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 22575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2258b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 22595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 22615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 2262a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 2263a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 226427a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 22655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 22665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 22675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 22685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 22695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 22715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 22725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 22735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 22745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 22755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 22765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 22775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 22785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 22795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 22815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 22825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 22835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 22845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 22855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 22875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 22885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 2290f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 2291f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 2292f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 2293c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 22945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 2295d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 2296f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 2297f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 22985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 2299f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 2300c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2301f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 23022d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Default); 2303d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 230486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 2305d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 23062d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 2307f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 2308f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2309f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 2310f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 2311f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 2312f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 23135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 23145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 23155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 23165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 2317c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2318f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 2319f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 2320f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 23215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 232237efe6764568a3829fee26aba532283131d1a104Nate Begeman 23233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 2324b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 23253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 23263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 23273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 23283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 23293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 23303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 23313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 23324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 23334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 23344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 23363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 2337dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 2338dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2339dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 23404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 23413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 23423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2343dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2344dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2345dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2346dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2347dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2348dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2349f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2350f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2351f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 23523a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2353b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2354b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 235524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 23569d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 23577f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 23587f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 23597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2360c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2361c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 23629e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2363c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2364c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2365c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng SDOperand Op2 = getValue(I.getOperand(1)); 2366c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2367c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2368c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 23697f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23717f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23727f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 237301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 23749e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 237501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 237601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 237701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 237801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 23797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23807f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 23817f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2382b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2383b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 23847f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 23851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op1 = getValue(I.getOperand(0)); 23861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Op2 = getValue(I.getOperand(1)); 238724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 238824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 23891628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 23901628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2391e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2392e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2393e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2394e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 23958e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (TLI.getShiftAmountTy().bitsLT(Op2.getValueType())) 2396832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 23978e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (TLI.getShiftAmountTy().bitsGT(Op2.getValueType())) 2398832254e1c2387c0cbeb0a820b8315fbe85cb003aReid Spencer Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 2399e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 24001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 24011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 240345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2404e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2405e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2406e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2407e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2408e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2409e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2410e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 241145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2412e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 241345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 241445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 241545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 241645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 241745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 241845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 241945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 242045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 242145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 242245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 242345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 242445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 242545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 242645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 242745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 242845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 242945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 243045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 243145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2432e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2433e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2434e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2435e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2436e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2437e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op1 = getValue(I.getOperand(0)); 2438e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer SDOperand Op2 = getValue(I.getOperand(1)); 2439e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2440e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2441e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2442e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2443e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2444e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2445e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2446e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2447e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2448cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2449cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2450e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2451e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2452e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2453e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2454e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2455e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2456e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 245745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 245845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2459e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 246045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 246145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2462e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2463e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2464e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2465e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2466e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 24671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2469b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVICmp(User &I) { 2470b43e9c196542acc80c9e4643809661065710848fNate Begeman ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2471b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VICmpInst *IC = dyn_cast<VICmpInst>(&I)) 2472b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = IC->getPredicate(); 2473b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2474b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = ICmpInst::Predicate(IC->getPredicate()); 2475b43e9c196542acc80c9e4643809661065710848fNate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2476b43e9c196542acc80c9e4643809661065710848fNate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2477b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Opcode; 2478b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2479b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 2480b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 2481b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 2482b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 2483b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 2484b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 2485b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 2486b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 2487b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 2488b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 2489b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2490b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid ICmp predicate value"); 2491b43e9c196542acc80c9e4643809661065710848fNate Begeman Opcode = ISD::SETEQ; 2492b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2493b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2494b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(Op1.getValueType(), Op1, Op2, Opcode)); 2495b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2496b43e9c196542acc80c9e4643809661065710848fNate Begeman 2497b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVFCmp(User &I) { 2498b43e9c196542acc80c9e4643809661065710848fNate Begeman FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2499b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VFCmpInst *FC = dyn_cast<VFCmpInst>(&I)) 2500b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FC->getPredicate(); 2501b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2502b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FCmpInst::Predicate(FC->getPredicate()); 2503b43e9c196542acc80c9e4643809661065710848fNate Begeman SDOperand Op1 = getValue(I.getOperand(0)); 2504b43e9c196542acc80c9e4643809661065710848fNate Begeman SDOperand Op2 = getValue(I.getOperand(1)); 2505b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Condition, FOC, FPC; 2506b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2507b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2508b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2509b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2510b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2511b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2512b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2513b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2514b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2515b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2516b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2517b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2518b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2519b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2520b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2521b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2522b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 2523b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2524b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid VFCmp predicate value"); 2525b43e9c196542acc80c9e4643809661065710848fNate Begeman FOC = FPC = ISD::SETFALSE; 2526b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2527b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2528b43e9c196542acc80c9e4643809661065710848fNate Begeman if (FiniteOnlyFPMath()) 2529b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FOC; 2530b43e9c196542acc80c9e4643809661065710848fNate Begeman else 2531b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FPC; 2532b43e9c196542acc80c9e4643809661065710848fNate Begeman 253383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2534b43e9c196542acc80c9e4643809661065710848fNate Begeman 2535b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(DestVT, Op1, Op2, Condition)); 2536b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2537b43e9c196542acc80c9e4643809661065710848fNate Begeman 25381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 25391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Cond = getValue(I.getOperand(0)); 25401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand TrueVal = getValue(I.getOperand(1)); 25411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand FalseVal = getValue(I.getOperand(2)); 25427f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 25437f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 25441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 25483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 25493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 255083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25513da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 25523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 25553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 25563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 25573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 255883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 25603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 25633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 25643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 25653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 256683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 25683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 25713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 25723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 257383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25740bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0))); 25753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 25783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 25793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 258083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 25823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 25853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 25863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 258783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 25893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 25923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 25933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 259483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 25963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 25993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 26003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 260183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 26033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 26063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 26073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 260883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 26103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 26133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 26143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 26151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 261683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 261783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand Result; 26198e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 26203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 26213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 26233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 26243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 26253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 26283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 26293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 26303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 263183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 263283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26338e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 26343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 26353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 26373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 26383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 26413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer SDOperand N = getValue(I.getOperand(0)); 264283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 26453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 26463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 26473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 26483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 26501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26522bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2653c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2654c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InVal = getValue(I.getOperand(1)); 2655c7029805ef35ce9805931067b841e6af11db382eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2656c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2657c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26587f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 26597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 26607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2661c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2662c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26632bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2664384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InVec = getValue(I.getOperand(0)); 2665384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner SDOperand InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2666384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 26677f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2668384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2669384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2670c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26713e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 26723e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V1 = getValue(I.getOperand(0)); 26733e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand V2 = getValue(I.getOperand(1)); 26743e104b11168da4692b69cc6b236c1da22adff959Chris Lattner SDOperand Mask = getValue(I.getOperand(2)); 26753e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 26767f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 26777f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 26787f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 26793e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 26803e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 26811d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitInsertValue(InsertValueInst &I) { 26821d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 26831d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op1 = I.getOperand(1); 26841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = I.getType(); 26851d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = Op1->getType(); 26861d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool IntoUndef = isa<UndefValue>(Op0); 26871d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool FromUndef = isa<UndefValue>(Op1); 26881d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 26891d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 26901d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 26911d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 26921d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> AggValueVTs; 26931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, AggTy, AggValueVTs); 26941d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 26951d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 26961d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 26971d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumAggValues = AggValueVTs.size(); 26981d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 26991d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<SDOperand, 4> Values(NumAggValues); 27001d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27011d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand Agg = getValue(Op0); 27021d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand Val = getValue(Op1); 27031d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned i = 0; 27041d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy the beginning value(s) from the original aggregate. 27051d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex; ++i) 27061d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 27071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand(Agg.Val, Agg.ResNo + i); 27081d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy values from the inserted value(s). 27091d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex + NumValValues; ++i) 27101d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = FromUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 27111d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand(Val.Val, Val.ResNo + i - LinearIndex); 27121d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy remaining value(s) from the original aggregate. 27131d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != NumAggValues; ++i) 27141d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 27151d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand(Agg.Val, Agg.ResNo + i); 27161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2717f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&AggValueVTs[0], NumAggValues), 2718f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumAggValues)); 2719041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2720041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 27211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitExtractValue(ExtractValueInst &I) { 27221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 27231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = Op0->getType(); 27241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = I.getType(); 27251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool OutOfUndef = isa<UndefValue>(Op0); 27261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 27281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 27291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27301d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 27311d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 27321d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27331d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 27341d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<SDOperand, 4> Values(NumValValues); 27351d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand Agg = getValue(Op0); 27371d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy out the selected value(s). 27381d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i) 27391d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i - LinearIndex] = 2740dded0fd398bf744454b2c9c95b68f4a27025f880Dan Gohman OutOfUndef ? DAG.getNode(ISD::UNDEF, Agg.Val->getValueType(Agg.ResNo + i)) : 2741dded0fd398bf744454b2c9c95b68f4a27025f880Dan Gohman SDOperand(Agg.Val, Agg.ResNo + i); 27421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2743f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValValueVTs[0], NumValValues), 2744f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValValues)); 2745041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2746041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 27473e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 27491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand N = getValue(I.getOperand(0)); 27501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 27511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 27531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 27541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2755c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2756b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 27571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 27581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2759b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 27601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 27610bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offset)); 27621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 27631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 27641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 27651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 27667c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27677c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 27687c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2769b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 277047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2771a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 27720bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 27730bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offs)); 27747c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 27757c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 27767c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27777c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2778a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 27797c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner SDOperand IdxN = getValue(Idx); 27807c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27817c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 27827c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 27838e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IdxN.getValueType().bitsLT(N.getValueType())) { 278447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 27858e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands } else if (IdxN.getValueType().bitsGT(N.getValueType())) 27867c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 27877c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27887c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 27897c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 27907c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 27917c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 27927c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 27936b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 27941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 27957c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 27961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 27977c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27980bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner SDOperand Scale = DAG.getIntPtrConstant(ElementSize); 27997c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 28007c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 28011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 28041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 28071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 28081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 28091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 28101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 28111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2813514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 281458092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2815d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 281658092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 28171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand AllocSize = getValue(I.getArraySize()); 281983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 28208e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(AllocSize.getValueType())) 282168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 28228e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(AllocSize.getValueType())) 282368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 28241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 282568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 28260bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(TySize)); 28271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28284515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 28294515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 28304515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 28311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 28321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 28334515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 28341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 28354515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 28364515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 28374515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 28384515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 28390bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(StackAlign-1)); 28404515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 28414515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 28420bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 28431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28440bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner SDOperand Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 284583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2846f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2847f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 28480da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 28490da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 28501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 28521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 28531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 28541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 28578a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Value *SV = I.getOperand(0); 28588a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SDOperand Ptr = getValue(SV); 28598a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 28608a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Type *Ty = I.getType(); 28618a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman bool isVolatile = I.isVolatile(); 28628a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned Alignment = I.getAlignment(); 28638a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 28648a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<MVT, 4> ValueVTs; 28658a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<uint64_t, 4> Offsets; 28668a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets); 28678a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned NumValues = ValueVTs.size(); 28688a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 28698a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 2870edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2871d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner SDOperand Root; 2872d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 2873d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 2874d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else { 2875d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2876d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2877d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 287828b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 28791d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<SDOperand, 4> Values(NumValues); 28801d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<SDOperand, 4> Chains(NumValues); 28811d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 28821d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) { 28831d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand L = DAG.getLoad(ValueVTs[i], Root, 28841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 28851d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 28861d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SV, Offsets[i], 28871d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 28881d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = L; 28891d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Chains[i] = L.getValue(1); 28901d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 28911d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 28921d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 28931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman &Chains[0], NumValues); 289428b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner if (isVolatile) 28951d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.setRoot(Chain); 2896d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner else 28971d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman PendingLoads.push_back(Chain); 28981d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2899f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], NumValues), 2900f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValues)); 29011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 29051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 29061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(SrcV); 29071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Value *PtrV = I.getOperand(1); 29081d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand Ptr = getValue(PtrV); 29091d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29101d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValueVTs; 29111d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<uint64_t, 4> Offsets; 29121d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets); 29131d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValues = ValueVTs.size(); 29148a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 29158a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 29161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29171d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDOperand Root = getRoot(); 29181d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<SDOperand, 4> Chains(NumValues); 29191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 29201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool isVolatile = I.isVolatile(); 29211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned Alignment = I.getAlignment(); 29221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) 29231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Chains[i] = DAG.getStore(Root, SDOperand(Src.Val, Src.ResNo + i), 29241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 29251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 29261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman PtrV, Offsets[i], 29271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 29281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumValues)); 29301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29320eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 29330eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 29340eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 29350eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 2936a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 2937a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2938a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 29390eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2940bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> Ops; 2941e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2942e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2943e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2944e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2945e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2946e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2947e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2948e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 29490eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29500eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 29510eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 29520eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29530eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 29540eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 29550eade319cdb72e24c11d068728a98083737c6435Chris Lattner SDOperand Op = getValue(I.getOperand(i)); 29560eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 29570eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 29580eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 29590eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 29600eade319cdb72e24c11d068728a98083737c6435Chris Lattner 296183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands std::vector<MVT> VTs; 29620eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 296383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(I.getType()); 296483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (VT.isVector()) { 29659d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 296683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(DestTy->getElementType()); 29670eade319cdb72e24c11d068728a98083737c6435Chris Lattner 296883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands VT = MVT::getVectorVT(EltVT, DestTy->getNumElements()); 29690eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 29700eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 29710eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29720eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 29730eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 29740eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 29750eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 29760eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 29770eade319cdb72e24c11d068728a98083737c6435Chris Lattner 297883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTList = DAG.getNodeValueTypes(VTs); 2979f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 29800eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 298148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner SDOperand Result; 298248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 2983f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 2984f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 298548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 2986f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 2987f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 298848b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 2989f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 2990f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 299148b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 2992e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 2993e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner SDOperand Chain = Result.getValue(Result.Val->getNumValues()-1); 2994e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 2995e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 2996e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 2997e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 2998e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 29990eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 30009d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 300183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(PTy); 30027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 30030eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30040eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 30050eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30060eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 30070eade319cdb72e24c11d068728a98083737c6435Chris Lattner 3008b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 3009cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 30100b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov V = V->stripPointerCasts(); 3011b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 30124c71dfe356716e6bc1993ef5efdced08b68fe612Anton Korobeynikov assert ((GV || isa<ConstantPointerNull>(V)) && 3013cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 3014cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 3015cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 3016cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3017f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 3018cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 3019f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 3020f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 3021f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 3022f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 3023f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 3024f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 3025f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 3026f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 3027f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3028f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 3029f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 3030f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 3031cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 3032cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3033cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 3034cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 3035cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 30366590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 3037cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 3038cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3039cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 3040cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 3041cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 3042cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3043cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3044cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 3045cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3046cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 30476590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 30486590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 30496590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 30506590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 30516590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 30526590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 30536590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 30546590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 30556590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 30566590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 30576590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 3058cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3059cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 3060cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3061f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 3062cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3063cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 3064cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 3065cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 3066cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3067f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3068cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3069f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 3070f40708223e409a152834b1553c6883ff2035b957Duncan Sands 307163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 307263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang/// Inlined utility function to implement binary input atomic intrinsics for 307363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// visitIntrinsicCall: I is a call instruction 307463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// Op is the associated NodeType for I 307563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangconst char * 307663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P WangSelectionDAGLowering::implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op) { 307763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang SDOperand Root = getRoot(); 307863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang SDOperand L = DAG.getAtomic(Op, Root, 307963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang getValue(I.getOperand(1)), 3080fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(2)), 308128873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 308263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang setValue(&I, L); 308363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang DAG.setRoot(L.getValue(1)); 308463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return 0; 308563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang} 308663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 3087c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 3088c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 3089c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 3090c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 3091c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 3092c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 30930eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 30940eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 30950eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 30960eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 3097c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 3098c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 3099c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 3100bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 3101bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 3102bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3103bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3104bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 3105bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 3106bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3107bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3108c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 3109d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 3110c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 3111c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 3112d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 3113c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 311403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 3115707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memcpy_i64: { 3116707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 3117707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 3118707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 3119707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3120707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3121707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 312203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3123707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 312403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 3125707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memset_i64: { 3126707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 3127707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 3128707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 3129707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3130707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align, 3131707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0)); 313203dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3133707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 313403dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 3135707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memmove_i64: { 3136707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op1 = getValue(I.getOperand(1)); 3137707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op2 = getValue(I.getOperand(2)); 3138707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman SDOperand Op3 = getValue(I.getOperand(3)); 3139707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3140707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3141707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // If the source and destination are known to not be aliases, we can 3142707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // lower memmove as memcpy. 3143707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman uint64_t Size = -1ULL; 3144707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 3145707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman Size = C->getValue(); 3146707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 3147707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman AliasAnalysis::NoAlias) { 3148707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3149707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 3150707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman return 0; 3151707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 3152707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3153707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align, 3154707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 315503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3156707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 315786cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 315844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 315943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 316044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 316144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 3162ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 31637f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman DAG.setRoot(DAG.getDbgStopPoint(getRoot(), 31647f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getLine(), 31657f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getColumn(), 31667f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman cast<CompileUnitDesc>(DD))); 316786cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 316843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3169b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 317036ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 317143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 317244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 317343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 317444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 317544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 31764406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 317743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 317843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3179b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 318043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 318143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 318244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 318343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 318444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 318544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 31864406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 318743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 318843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3189b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 319043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 319143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 319244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 31931b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (!MMI) return 0; 319443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 31951b08bbca5592351a940bcd164bdec724ee954326Evan Cheng Value *SP = FSI.getSubprogram(); 31961b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (SP && MMI->Verify(SP)) { 31971b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is 31981b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // what (most?) gdb expects. 31991b08bbca5592351a940bcd164bdec724ee954326Evan Cheng DebugInfoDesc *DD = MMI->getDescFor(SP); 32001b08bbca5592351a940bcd164bdec724ee954326Evan Cheng assert(DD && "Not a debug information descriptor"); 32011b08bbca5592351a940bcd164bdec724ee954326Evan Cheng SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD); 32021b08bbca5592351a940bcd164bdec724ee954326Evan Cheng const CompileUnitDesc *CompileUnit = Subprogram->getFile(); 320399fe47bc81d53762454ff112ab34378b00299b5aDan Gohman unsigned SrcFile = MMI->RecordSource(CompileUnit); 32041b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // Record the source line but does create a label. It will be emitted 32051b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // at asm emission time. 32061b08bbca5592351a940bcd164bdec724ee954326Evan Cheng MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile); 320743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 320843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3209b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 321043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 321143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 321244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 321343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 3214a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng Value *Variable = DI.getVariable(); 3215a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng if (MMI && Variable && MMI->Verify(Variable)) 3216a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(), 3217a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng getValue(DI.getAddress()), getValue(Variable))); 321843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 321943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 3220c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3221b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 32221532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (!CurMBB->isLandingPad()) { 32231532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // FIXME: Mark exception register as live in. Hack for PR1508. 32241532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen unsigned Reg = TLI.getExceptionAddressRegister(); 32251532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (Reg) CurMBB->addLiveIn(Reg); 3226735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 32271532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Insert the EXCEPTIONADDR instruction. 32281532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 32291532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Ops[1]; 32301532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Ops[0] = DAG.getRoot(); 32311532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 32321532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, Op); 32331532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.setRoot(Op.getValue(1)); 3234b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3235b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3236b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 32378806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 32388806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 3239b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 324083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 32418806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 32428806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 32431532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 3244f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 3245f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 3246e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 3247f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 3248f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 3249f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 3250902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 3251902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 3252902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 3253e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 3254735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3255735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 32568806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 3257735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Ops[2]; 3258735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 3259735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 3260735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey SDOperand Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 3261735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 3262735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 32637a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 32648806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 3265b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3266b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3267b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3268b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 32698806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 32708806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 32718806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 3272b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 327383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 32748806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 3275735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3276735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 3277735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 3278cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 32793b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 3280735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 32818806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 32827a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 3283f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 32848806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 3285b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3286b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3287b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3288b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3289b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 32902365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 32912365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 32922365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 32931532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 32942365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 32952365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 32962365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 329786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman getControlRoot(), 32982365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 32992365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 33002365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 33012365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 33022365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33032365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33042365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33052365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33062365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33072365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 33082365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 33092365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 33102365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33112365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33122365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33132365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33142365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33152365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 331683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = getValue(I.getOperand(1)).getValueType(); 33171532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand CfaArg; 33188e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 33191532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::TRUNCATE, 33201532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 33211532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen else 33221532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 33231532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 33241532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen 33251532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDOperand Offset = DAG.getNode(ISD::ADD, 33261532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33271532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 33281532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy()), 33291532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg); 33301532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, DAG.getNode(ISD::ADD, 33311532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33321532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAMEADDR, 33331532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33341532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getConstant(0, 33351532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy())), 33361532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Offset)); 33372365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33382365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33392365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33409ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 3341c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 3342c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 3343c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 3344c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 33459ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 33466ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 33476ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 33486ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 33496ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 33506ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 3351ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 3352ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 3353ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3354ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3355ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3356ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 3357ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 3358ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3359ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3360ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3361ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 3362ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 3363ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3364ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 3365ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 3366ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3367c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 3368c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 3369c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 3370c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3371c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 33728b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 3373bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 3374f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 3375f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 3376f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 33778b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 33788b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 337951b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 33808b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 3381c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 33823f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 3383f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 3384f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 3385f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 3386f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 3387f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 3388f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 33893f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 3390addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 3391a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 3392d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 3393d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 3394d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 3395d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 3396a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 3397a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 339883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3399a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTTZ, Ty, Arg); 3400a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3401c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3402a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3403a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 3404a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 340583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3406a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTLZ, Ty, Arg); 3407a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3408c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3409a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3410a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 3411a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand Arg = getValue(I.getOperand(1)); 341283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3413a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer SDOperand result = DAG.getNode(ISD::CTPOP, Ty, Arg); 3414a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3415c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3416a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3417140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 3418bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SDOperand Op = getRoot(); 3419f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDOperand Tmp = DAG.getNode(ISD::STACKSAVE, 3420f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 3421140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 3422140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 3423140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 3424140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 342539a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 342639a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 342739a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 3428140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 342939a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 343024e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 343124e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 343224e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 343336397f50343639ce9a25996f2d790c656791ab92Duncan Sands 343436397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 34350b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts()); 343636397f50343639ce9a25996f2d790c656791ab92Duncan Sands 343736397f50343639ce9a25996f2d790c656791ab92Duncan Sands SDOperand Ops[6]; 343836397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 343936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 344036397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 344136397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 344236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 344336397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 344436397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3445f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands SDOperand Tmp = DAG.getNode(ISD::TRAMPOLINE, 3446f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 3447f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 3448f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 3449f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 3450f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 3451f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 345236397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 345336397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 3454ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3455ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcroot: 3456ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (GCI) { 3457ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Value *Alloca = I.getOperand(1); 3458ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Constant *TypeMap = cast<Constant>(I.getOperand(2)); 3459ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3460ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val); 3461ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI->addStackRoot(FI->getIndex(), TypeMap); 3462ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen } 3463ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3464ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3465ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcread: 3466ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcwrite: 3467ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen assert(0 && "Collector failed to lower gcread/gcwrite intrinsics!"); 3468ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3469ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3470917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 34711a0248690aaa9f7baaf1247e5f65a1c0c9e3783cDan Gohman setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32)); 3472917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 3473917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 347466fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov 347566fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov case Intrinsic::trap: { 347666fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot())); 347766fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov return 0; 347866fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov } 347927b7db549e4c5bff4579d209304de5628513edebEvan Cheng case Intrinsic::prefetch: { 348027b7db549e4c5bff4579d209304de5628513edebEvan Cheng SDOperand Ops[4]; 348127b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[0] = getRoot(); 348227b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[1] = getValue(I.getOperand(1)); 348327b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[2] = getValue(I.getOperand(2)); 348427b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[3] = getValue(I.getOperand(3)); 348527b7db549e4c5bff4579d209304de5628513edebEvan Cheng DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4)); 348627b7db549e4c5bff4579d209304de5628513edebEvan Cheng return 0; 348727b7db549e4c5bff4579d209304de5628513edebEvan Cheng } 348827b7db549e4c5bff4579d209304de5628513edebEvan Cheng 348922c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth case Intrinsic::memory_barrier: { 349022c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth SDOperand Ops[6]; 349122c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[0] = getRoot(); 349222c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth for (int x = 1; x < 6; ++x) 349322c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[x] = getValue(I.getOperand(x)); 349422c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth 349522c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6)); 349622c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth return 0; 349722c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth } 349828873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_cmp_swap: { 3499ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth SDOperand Root = getRoot(); 350028873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang SDOperand L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, Root, 3501ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3502ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(2)), 3503fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(3)), 350428873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 3505ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3506ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3507ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3508ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 350928873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_add: 351028873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD); 351128873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_sub: 351228873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB); 351363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_and: 351463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND); 351563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_or: 351663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR); 351763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_xor: 351863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR); 3519507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth case Intrinsic::atomic_load_nand: 3520507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND); 352163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_min: 352263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN); 352363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_max: 352463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX); 352563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umin: 352663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN); 352763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umax: 352863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX); 352963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_swap: 353063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP); 3531c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3532c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 3533c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3534c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 35356f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sandsvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDOperand Callee, 35361da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 3537070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 35386f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 3539735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 3540070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 3541070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 35426f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3543735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 3544735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 35456f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 35466f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 35476f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 35486f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands SDOperand ArgNode = getValue(*i); 35496f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 35506f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 35516f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 35526f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 35536f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 35546f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 35556f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 35566f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 35576f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 355808e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen Entry.Alignment = CS.getParamAlignment(attrInd); 3559735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 3560735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 3561735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 35621532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3563070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 3564070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 3565070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 3566a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // Both PendingLoads and PendingExports must be flushed here; 3567a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // this call might not return. 3568a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen (void)getRoot(); 35694406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getControlRoot(), BeginLabel)); 3570070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 35716f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3572735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey std::pair<SDOperand,SDOperand> Result = 35736f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 35746f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 357500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CS.paramHasAttr(0, ParamAttr::ZExt), 35766f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 3577735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 35786f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 35796f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 3580735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 3581070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 35821532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3583070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 3584070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 3585070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 35864406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getRoot(), EndLabel)); 3587070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 35886f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 3589070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 3590070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 3591735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 3592735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3593735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 35941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 359564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 3596c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 359787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3598c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3599c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3600c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3601c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 360287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 360387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 360487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 360587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 360687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 360787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 360887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 360987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 361087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 361187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 361287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 361387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 361487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 361587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 361687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 361787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand LHS = getValue(I.getOperand(1)); 361887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand RHS = getValue(I.getOperand(2)); 361987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 362087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 362187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 362287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 362387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 362487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 36252f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 36262f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 362787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 362887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 362987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 363087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 363187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 363287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 363387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 363487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 363587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 36362f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 36372f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 363887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 363987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 364087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 364187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 364287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 364387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 364487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 364587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 364687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 36472f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 36482f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 364987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 365087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 365187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 365287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner SDOperand Tmp = getValue(I.getOperand(1)); 365387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 365487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3655f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3656c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 365787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3658ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3659fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3660ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3661c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3662edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 366364e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner SDOperand Callee; 366464e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 366564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 366664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 366764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3668070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 36696f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 36701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 36711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3672735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3673ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohmanvoid SelectionDAGLowering::visitGetResult(GetResultInst &I) { 367467780f108ccb509dffe3ff63d3826ea6accb1bb1Dan Gohman if (isa<UndefValue>(I.getOperand(0))) { 36753dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman SDOperand Undef = DAG.getNode(ISD::UNDEF, TLI.getValueType(I.getType())); 36763dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman setValue(&I, Undef); 36776833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return; 36783dc34f682dfdfbf75c2b883e21a953d41df4f3a0Dan Gohman } 36796833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 36806833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // To add support for individual return values with aggregate types, 36816833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // we'd need a way to take a getresult index and determine which 36826833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // values of the Call SDNode are associated with it. 36836833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert(TLI.getValueType(I.getType(), true) != MVT::Other && 36846833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Individual return values must not be aggregates!"); 36856833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 36866833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand Call = getValue(I.getOperand(0)); 36876833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner setValue(&I, SDOperand(Call.Val, I.getIndex())); 3688ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman} 3689ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 3690ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 3691b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3692b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3693b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3694b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3695ead0d88ad7659dabd66cc3149af97d98256fca84Chris LattnerSDOperand RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 36966833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand &Chain, 36976833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand *Flag) const { 369823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Assemble the legal parts into the final values. 369923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 4> Values(ValueVTs.size()); 37006833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SmallVector<SDOperand, 8> Parts; 37016833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 370223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Copy the legal parts from the registers. 370383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 370423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 370583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 370623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 37076833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Parts.resize(NumRegs); 370823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 37096833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand P; 37106833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 37116833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT); 37126833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 37136833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag); 371423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman *Flag = P.getValue(2); 37156833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 37166833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = P.getValue(1); 3717ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3718ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If the source register was virtual and if we know something about it, 3719ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // add an assert node. 3720ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) && 3721ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT.isInteger() && !RegisterVT.isVector()) { 3722ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister; 3723ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 3724ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FLI.LiveOutRegInfo.size() > SlotNo) { 3725ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo]; 3726ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3727ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned RegSize = RegisterVT.getSizeInBits(); 3728ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits = LOI.NumSignBits; 3729ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes(); 3730ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3731ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // FIXME: We capture more information than the dag can represent. For 3732ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // now, just use the tightest assertzext/assertsext possible. 3733ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner bool isSExt = true; 3734ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT FromVT(MVT::Other); 3735ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits == RegSize) 3736ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1 3737ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-1) 3738ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1 3739ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-8) 3740ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8 3741ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-9) 3742ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8 3743ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-16) 3744ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16 3745ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-17) 3746ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16 3747ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-32) 3748ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32 3749ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-33) 3750ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32 3751ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3752ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FromVT != MVT::Other) { 3753ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, 3754ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT, P, DAG.getValueType(FromVT)); 3755ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3756ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3757ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3758ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3759ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 376023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Parts[Part+i] = P; 376123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3762b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 376323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Values[Value] = getCopyFromParts(DAG, &Parts[Part], NumRegs, RegisterVT, 376423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ValueVT); 376523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumRegs; 376623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 37674bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands 3768f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands return DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], ValueVTs.size()), 3769f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], ValueVTs.size()); 3770b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3771b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3772b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3773b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 3774b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3775b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3776b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohmanvoid RegsForValue::getCopyToRegs(SDOperand Val, SelectionDAG &DAG, 3777b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand &Chain, SDOperand *Flag) const { 3778b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 377923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = Regs.size(); 378023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 8> Parts(NumRegs); 37816833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 378283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 378323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumParts = TLI->getNumRegisters(ValueVT); 378483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 378523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 378623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman getCopyToParts(DAG, Val.getValue(Val.ResNo + Value), 378723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Parts[Part], NumParts, RegisterVT); 378823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumParts; 378923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3790b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3791b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 379223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SmallVector<SDOperand, 8> Chains(NumRegs); 379323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 37946833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner SDOperand Part; 37956833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 37966833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 37976833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 37986833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag); 3799b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 38006833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 38016833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chains[i] = Part.getValue(0); 3802c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 38036833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 380433bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng if (NumRegs == 1 || Flag) 380533bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is 380633bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // flagged to it. That is the CopyToReg nodes and the user are considered 380733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // a single scheduling unit. If we create a TokenFactor and return it as 380833bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // chain, then the TokenFactor is both a predecessor (operand) of the 380933bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // user as well as a successor (the TF operands are flagged to the user). 381033bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c1, f1 = CopyToReg 381133bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c2, f2 = CopyToReg 381233bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c3 = TokenFactor c1, c2 381333bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // ... 381433bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // = op c3, ..., f2 381533bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng Chain = Chains[NumRegs-1]; 38166833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else 38176833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 3818c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3819864635ad7b3046d3042311423071152c613961deChris Lattner 3820c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3821c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3822c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3823c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 38249f6637db10642fae51fa3628b7833c6999f7fdb3Chris Lattner std::vector<SDOperand> &Ops) const { 382583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 38264b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 38276833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) { 38286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]); 382983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 38306833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned i = 0; i != NumRegs; ++i) 38316833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT)); 383223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3833c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3834864635ad7b3046d3042311423071152c613961deChris Lattner 3835864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3836864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3837864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3838864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 38399b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 38406f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetLowering &TLI, 38416f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI) { 384283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT FoundVT = MVT::Other; 3843f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 38446f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 38456f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman E = TRI->regclass_end(); RCI != E; ++RCI) { 384683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::Other; 3847f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 38489b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 38499b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 38509b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 38519b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 38529b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 38539b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3854f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3855f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3856f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 38578e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) { 3858f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3859f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3860f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 38619b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 38629b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 38639b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3864f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 38659b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3866864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3867864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3868864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3869864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 38709b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 38719b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3872f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3873f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3874f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3875f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3876f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3877f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3878f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3879864635ad7b3046d3042311423071152c613961deChris Lattner } 3880f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3881864635ad7b3046d3042311423071152c613961deChris Lattner} 3882864635ad7b3046d3042311423071152c613961deChris Lattner 3883bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3884bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3885bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3886bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 38875c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengstruct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo { 38885c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// CallOperand - If this is the result output operand or a clobber 38895c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// this is null, otherwise it is the incoming operand to the CallInst. 38905c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// This gets modified as the asm is processed. 3891bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner SDOperand CallOperand; 38925c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng 3893e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3894e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3895e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3896e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 389723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 38985c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 3899bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3900bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3901e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3902e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3903e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3904e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 39057cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner std::set<unsigned> &InputRegs, 39067cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) const { 39077cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isOutReg) { 39087cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 39097cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 39107cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39117cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isInReg) { 39127cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 39137cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 39147cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39157cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39167cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner 39177cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattnerprivate: 39187cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// MarkRegAndAliases - Mark the specified register and all aliases in the 39197cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// specified set. 39207cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 39217cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) { 39227cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 39237cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(Reg); 39247cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 39257cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (; *Aliases; ++Aliases) 39267cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(*Aliases); 39277cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 3928bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3929bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3930bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3931bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 39320fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// GetRegistersForValue - Assign registers (virtual or physical) for the 39330fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// specified operand. We prefer to assign virtual registers, to allow the 39340fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// register allocator handle the assignment process. However, if the asm uses 39350fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// features that we can't model on machineinstrs, we have SDISel do the 39360fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// allocation. This produces generally horrible, but correct, code. 39370fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 39380fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// OpInfo describes the operand. 39390fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// HasEarlyClobber is true if there are any early clobber constraints (=&r) 39400fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// or any explicitly clobbered registers. 39410fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// Input and OutputRegs are the set of already allocated physical registers. 39420fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 3943e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 39445c80760fdf71659c5bdf45cd85d173df454dfb41Evan ChengGetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 3945864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 39464e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3947e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3948e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3949e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3950e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3951e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3952e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3953e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3954e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3955e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3956e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3957e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3958e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3959e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3960e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3961e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3962e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3963e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3964e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3965e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3966e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3967e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3968e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3969e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3970e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3971e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3972b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SmallVector<unsigned, 4> Regs; 3973e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3974e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3975e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3976e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3977e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3978e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3979864635ad7b3046d3042311423071152c613961deChris Lattner 3980bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3981bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3982b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 398383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegVT; 398483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = OpInfo.ConstraintVT; 3985864635ad7b3046d3042311423071152c613961deChris Lattner 3986bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 39872a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 39882a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 3989864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 3990bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 3991864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 3992cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 3993cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 3994cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 3995cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 3996cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 3997864635ad7b3046d3042311423071152c613961deChris Lattner 3998864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 3999864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 4000864635ad7b3046d3042311423071152c613961deChris Lattner 4001864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 4002864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 4003864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 4004864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 400550871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Didn't find reg!"); 4006864635ad7b3046d3042311423071152c613961deChris Lattner 4007864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 4008864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 4009864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 401050871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Ran out of registers to allocate!"); 4011864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 4012864635ad7b3046d3042311423071152c613961deChris Lattner } 4013864635ad7b3046d3042311423071152c613961deChris Lattner } 401423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 40157cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 40167cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4017e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4018864635ad7b3046d3042311423071152c613961deChris Lattner } 4019864635ad7b3046d3042311423071152c613961deChris Lattner 40202a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 40212a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 40222a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 4023c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 4024c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 40252a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 40262a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 40272a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 4028e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 4029e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 4030e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 4031e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 4032e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 40332a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 40343a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 4035bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 40363a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 40372a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40382a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 403984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo = MF.getRegInfo(); 40402a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 404184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second)); 40422a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 404323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 4044e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 40452a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 40462a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40472a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 40482a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 40492a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 40502a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40512a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 40522a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 40532a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 40542a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 4055bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 4056bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 40572a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 4058e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 40596f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 4060864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 4061864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 4062864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 40634e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 4064864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 4065864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 4066864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 4067864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 4068864635ad7b3046d3042311423071152c613961deChris Lattner continue; 4069864635ad7b3046d3042311423071152c613961deChris Lattner } 4070864635ad7b3046d3042311423071152c613961deChris Lattner 40714e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 40724e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 4073c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 40746f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman RC = isAllocatableRegister(Reg, MF, TLI, TRI); 4075c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 4076c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 4077c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 4078c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 4079c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 40804e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 40814e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 4082864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 4083864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 4084864635ad7b3046d3042311423071152c613961deChris Lattner 4085e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 4086864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 4087864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 4088864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 4089864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 4090e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 4091e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 4092864635ad7b3046d3042311423071152c613961deChris Lattner 409323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(), 4094e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 40957cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4096e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4097864635ad7b3046d3042311423071152c613961deChris Lattner } 40984e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 4099864635ad7b3046d3042311423071152c613961deChris Lattner 4100864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 41014e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 41024e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 41033ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 4104ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 4105ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 4106fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 4107fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 4108ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41090c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 41105c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng std::vector<SDISelAsmOperandInfo> ConstraintOperands; 4111ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4112ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Chain = getRoot(); 4113ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner SDOperand Flag; 4114ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41154e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 41160c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 41170c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 41180c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 41190c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 41200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 4121e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4122e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 4123e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 4124e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 4125e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 4126e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4127fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 4128acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner unsigned ResNo = 0; // ResNo - The result number of the next output. 41290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 41305c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 41315c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 41320c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 413383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OpVT = MVT::Other; 41341efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 41350c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 41360c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 41371efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 4138acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // Indirect outputs just consume an argument. 4139acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (OpInfo.isIndirect) { 4140fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 4141acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner break; 4142acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } 4143acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // The return value of the call is this value. As such, there is no 4144acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // corresponding argument. 4145acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 4146acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (const StructType *STy = dyn_cast<StructType>(CS.getType())) { 4147acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(STy->getElementType(ResNo)); 4148acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } else { 4149acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(ResNo == 0 && "Asm only has one result!"); 4150acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(CS.getType()); 41511efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 4152acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner ++ResNo; 41531efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41541efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 4155fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 41561efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41571efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 41580c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 41591efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41601efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 41610c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 41620c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 4163eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 41640c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 4165507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) 4166507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]); 4167eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 4168eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 4169eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 4170eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 4171eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 4172eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 4173eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 4174eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 41754fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman // If OpTy is not a single value, it may be a struct/union that we 4176eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 41774fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman if (!OpTy->isSingleValueType() && OpTy->isSized()) { 4178eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 4179eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 4180eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 4181eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 4182eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 4183eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 4184eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 4185eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 4186eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 4187eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 4188eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 41896995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 4190eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 4191eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 41920c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 41930c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 41941efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 41950c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 41962a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 41973ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 41985a09690446a36f94f990db7d18d9b9ac8587888aChris Lattner TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG); 41991efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 4200e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 4201e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 420209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 42030fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner // If we see a clobber of a register, it is an early clobber. 420469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (!SawEarlyClobber && 420569e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.Type == InlineAsm::isClobber && 420669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) { 420769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // Note that we want to ignore things that we don't trick here, like 420869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // dirflag, fpsr, flags, etc. 420969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 421069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 421169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintVT); 421269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (PhysReg.first || PhysReg.second) { 421369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // This is a register we know of. 421469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner SawEarlyClobber = true; 421569e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 421669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 42170fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner 421809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 421909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 422009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 422109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 422209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 422309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 422409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 422509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 422609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 422709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 422809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 422909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 423009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 423109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 423209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 423309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 423409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 423509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 423609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 423709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 423809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 423909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 4240514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 424109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 424209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 424309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 424409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 424509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 424609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 424709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 424809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 424909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 425009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 425109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 425209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 425309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 425409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 4255e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 4256e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 4257e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 4258e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 42590c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42600c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 42610c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 42620c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 4263e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 4264e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 4265e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 42665c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 4267e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4268e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 4269e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 4270e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 4271e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 4272e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 4273e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 42740c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 42750c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<SDOperand> AsmNodeOperands; 42760c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back(SDOperand()); // reserve space for input chain 42770c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 42780c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 42790c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 42802cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 42810f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 42820f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 4283864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 428441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 42850c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 4286864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 42870f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 42880c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 42895c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 42901efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 42910c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 42922cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 4293c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 4294c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 4295f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 429609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 429722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 429822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 429922873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4300c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4301c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 430209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 430322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 430422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 430522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 43062a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 430722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 4308864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 4309864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 4310e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 4311a47c6c37034f4e57bc8187e959da4eadb6e24afaDuncan Sands cerr << "Couldn't allocate output reg for constraint '" 43120c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 4313d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 4314d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 43152cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 431641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // If this is an indirect operand, store through the pointer after the 431741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // asm. 431841f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner if (OpInfo.isIndirect) { 4319e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 43200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 432141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } else { 432241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // This is the result value of the call. 432341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 432441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // Concatenate this output onto the outputs list. 432541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RetValRegs.append(OpInfo.AssignedRegs); 43262cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 43276656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 43286656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 43296656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 4330e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 4331e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 43326656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 43336656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 43346656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 43350c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner SDOperand InOperandVal = OpInfo.CallOperand; 43363d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 43370c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 43382223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 43392223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 43400c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 43413d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 4342c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 4343c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 4344c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 4345c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 4346c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 4347c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4348c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4349a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 4350a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 4351c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 4352c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 4353c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 4354c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4355c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4356c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4357527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 4358527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 4359527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 436023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.TLI = &TLI; 43611fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType()); 43621fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.RegVTs.push_back(AsmNodeOperands[CurOp+1].getValueType()); 4363527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 4364527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 4365527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 4366527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 4367527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 4368c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4369527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 4370b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 4371527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 4372527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 4373527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 4374527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 4375f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner assert((NumOps >> 3) == 1 && "Unexpected number of operands"); 4376f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner // Add information to the INLINEASM node to know about this input. 4377f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4378f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4379f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner TLI.getPointerTy())); 4380f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 4381f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner break; 4382c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 438387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 438487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 43852a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 43860c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 438744b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 438844b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 438948884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner std::vector<SDOperand> Ops; 439048884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 439148884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 439248884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 4393832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 43940c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 439553069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 439653069fbbae2558a3138df24776448791fea3aceeChris Lattner } 4397c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 439887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 439948884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 4400c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4401c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 440248884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 440387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 44042a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 440509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 440644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 440744b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 440844b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 440987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 441087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4411c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4412c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 441387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 4414c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 44152223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 441687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 44172a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 44182a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 44192a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 44200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 442144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 442287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 442387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 4424e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 4425e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 442687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4427b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 442887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4429e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 4430e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 44316656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 44326656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4433c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 4434c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 4435c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 4436e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 4437e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 4438e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 44396656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 44406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4441c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 44426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4443ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4444ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 4445ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 4446ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 4447ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4448f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 4449f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 4450bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 4451ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 4452ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 44536656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 44546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 44553a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 4456b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 44573fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 44583fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // If any of the results of the inline asm is a vector, it may have the 44593fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // wrong width/num elts. This can happen for register classes that can 44603fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // contain multiple different value types. The preg or vreg allocated may 44613fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // not have the same VT as was expected. Convert it to the right type with 44627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 44633fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner if (const StructType *ResSTy = dyn_cast<StructType>(CS.getType())) { 44643fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner for (unsigned i = 0, e = ResSTy->getNumElements(); i != e; ++i) { 446583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.Val->getValueType(i).isVector()) 44663fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, 44673fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner TLI.getValueType(ResSTy->getElementType(i)), Val); 44683fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } 44693fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } else { 447083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.getValueType().isVector()) 44713fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, TLI.getValueType(CS.getType()), 44723fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val); 44733a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 44743fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 4475fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 44763a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 44776656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 44786656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner std::vector<std::pair<SDOperand, Value*> > StoresToEmit; 44796656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 44806656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 44816656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 44826656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 4483864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 44846656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 4485b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman SDOperand OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 4486864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 44876656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4488ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 44896656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 4490bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner SmallVector<SDOperand, 8> OutChains; 44916656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 44920c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 44936656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 44948b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 44956656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 4496bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 4497bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 4498ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 4499ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 4500ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4501ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 45021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 45031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDOperand Src = getValue(I.getOperand(0)); 45041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 450583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 450668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 45078e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(Src.getValueType())) 450868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 45098e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(Src.getValueType())) 451068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 45111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 4513514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 45141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 45150bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner Src, DAG.getIntPtrConstant(ElementSize)); 45161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 451747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 451847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 451947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 452047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 452147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 4522cf5734dddd66af9388a171b44996505ede47feedChris Lattner 4523cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 452400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C, 452500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG); 4526cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 4527cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 45281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 453147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 453247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 453347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 453447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 453547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 453683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 4537cf5734dddd66af9388a171b44996505ede47feedChris Lattner std::pair<SDOperand,SDOperand> Result = 453800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, 453900fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CallingConv::C, true, 4540cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 4541cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 45421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4544ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 4545ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 4546025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 4547025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 4548025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 4549ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 4550025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 4551832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 4552832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 4553ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng << "TargetLowering::EmitInstrWithCustomInserter!\n"; 4554025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 4555025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 4556025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 4557025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 455839ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 4559acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 4560acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4561acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 456239ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 456339ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 45641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 4565acc398c195a697795bff3245943d104eb19192b9Nate Begeman SDOperand V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 4566acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 4567acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 4568acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 4569acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 45701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 4573acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 4574acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4575acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 45761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 4579acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 4580acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4581acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 4582acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 4583acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 45841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4586fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 4587fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 4588f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 4589f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 4590a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohmanvoid TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG, 4591a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVectorImpl<SDOperand> &ArgValues) { 4592fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 4593a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVector<SDOperand, 3+16> Ops; 45948c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 4595fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 4596fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 4597fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4598fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 4599a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVector<MVT, 16> RetVals; 46006aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 4601ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 4602ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 4603f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4604f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4605f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4606f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4607f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4608f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4609f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4610f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4611f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4612f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4613f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ZExt)) 4614f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4615f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::SExt)) 4616f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4617f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::InReg)) 4618f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4619f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::StructRet)) 4620f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4621f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ByVal)) { 4622f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4623f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(I->getType()); 4624f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4625f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4626f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4627f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should be passed from FE. BE will guess if 4628f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // this info is not there but there are cases it cannot get right. 4629f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.getParamAlignment(j)) 4630f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = F.getParamAlignment(j); 4631f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4632f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4633f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4634f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::Nest)) 4635f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4636f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4637b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4638f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT RegisterVT = getRegisterType(VT); 4639f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4640f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 4641f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman RetVals.push_back(RegisterVT); 4642f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4643f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumRegs > 1 && i == 0) 4644f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4645f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4646f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i > 0) 4647f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4648f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4649f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4650b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 4651fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 46523b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 46538c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 4654fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4655fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 4656f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 465786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner DAG.getVTList(&RetVals[0], RetVals.size()), 4658bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 465986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 466086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but 466186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // allows exposing the loads that may be part of the argument access to the 466286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // first DAGCombiner pass. 466386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner SDOperand TmpRes = LowerOperation(SDOperand(Result, 0), DAG); 466486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 466586ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // The number of results should match up, except that the lowered one may have 466686ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // an extra flag result. 466786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner assert((Result->getNumValues() == TmpRes.Val->getNumValues() || 466886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner (Result->getNumValues()+1 == TmpRes.Val->getNumValues() && 466986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag)) 467086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner && "Lowering produced unexpected number of results!"); 467186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner Result = TmpRes.Val; 467286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 467327a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 467427a70be55f8b63181598d144d034b396402be66eDan Gohman DAG.setRoot(SDOperand(Result, NumArgRegs)); 4675fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4676fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 4677fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 467847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 467947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 468047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 4681f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4682f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4683f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4684f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4685f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4686f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 4687f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4688f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 4689f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 4690f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned j = 0; j != NumParts; ++j) 4691f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Parts[j] = SDOperand(Result, i++); 4692f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4693f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE; 4694f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(Idx, ParamAttr::SExt)) 4695f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertSext; 4696f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 4697f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertZext; 4698f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4699a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman ArgValues.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT, 4700a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman AssertOp)); 4701f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4702fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 470327a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 4704fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 4705fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4706f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4707f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 4708f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 4709f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 4710f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 4711f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattnerstd::pair<SDOperand, SDOperand> 471200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan SandsTargetLowering::LowerCallTo(SDOperand Chain, const Type *RetTy, 471300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands bool RetSExt, bool RetZExt, bool isVarArg, 471400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands unsigned CallingConv, bool isTailCall, 4715f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner SDOperand Callee, 4716f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4717be384162c68641233deba8702666af51bdfd4b83Chris Lattner SmallVector<SDOperand, 32> Ops; 4718f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4719f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4720f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4721f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4722f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4723f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4724f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4725f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 4726f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4727f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, Args[i].Ty, ValueVTs); 4728f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4729f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4730f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4731f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4732f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SDOperand Op = SDOperand(Args[i].Node.Val, Args[i].Node.ResNo + Value); 4733f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4734f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4735f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4736f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4737f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isZExt) 4738f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4739f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 4740f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4741f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isInReg) 4742f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4743f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSRet) 4744f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4745f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isByVal) { 4746f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4747f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(Args[i].Ty); 4748f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4749f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4750f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4751f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should come from FE. BE will guess if this 4752f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // info is not there but there are cases it cannot get right. 4753f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].Alignment) 4754f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = Args[i].Alignment; 4755f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4756f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4757f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4758f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isNest) 4759f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4760f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4761f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4762f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 4763f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 4764f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<SDOperand, 4> Parts(NumParts); 4765f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 4766f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4767f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 4768f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 4769f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (Args[i].isZExt) 4770f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 4771f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4772f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind); 4773f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4774f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumParts; ++i) { 4775f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4776f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4777f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumParts > 1 && i == 0) 4778f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4779f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i != 0) 4780f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4781f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4782f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(Parts[i]); 4783f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4784f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 478527a70be55f8b63181598d144d034b396402be66eDan Gohman } 4786f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4787f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4788ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Figure out the result value types. We start by making a list of 478923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // the potentially illegal return value types. 479083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> LoweredRetTys; 479183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RetTys; 479223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(*this, RetTy, RetTys); 4793ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 479423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Then we translate that to a list of legal types. 479523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 479683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 479783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 4798ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4799ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4800ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(RegisterVT); 4801ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4802f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4803ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(MVT::Other); // Always has a chain. 4804f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4805b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4806be384162c68641233deba8702666af51bdfd4b83Chris Lattner SDOperand Res = DAG.getNode(ISD::CALL, 4807ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&LoweredRetTys[0], 4808ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.size()), 4809be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4810ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Chain = Res.getValue(LoweredRetTys.size() - 1); 4811b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4812b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4813b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 481400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 481500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 481600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands if (RetSExt) 481700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands AssertOp = ISD::AssertSext; 481800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands else if (RetZExt) 4819b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 482000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 4821ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<SDOperand, 4> ReturnValues; 4822ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNo = 0; 482323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 482483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 482583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 4826ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4827ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNoEnd = NumRegs + RegNo; 4828ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SmallVector<SDOperand, 4> Results; 4829ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (; RegNo != RegNoEnd; ++RegNo) 4830ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Results.push_back(Res.getValue(RegNo)); 4831ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman SDOperand ReturnValue = 4832ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, 4833ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman AssertOp); 4834ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman ReturnValues.push_back(ReturnValue); 4835ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4836f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands Res = DAG.getMergeValues(DAG.getVTList(&RetTys[0], RetTys.size()), 4837f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &ReturnValues[0], ReturnValues.size()); 4838f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4839b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4840b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4841f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4842f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 484350381b6c4180e9a2b983d4623da2e485cd768632Chris LattnerSDOperand TargetLowering::LowerOperation(SDOperand Op, SelectionDAG &DAG) { 4844171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4845171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4846d3f03e4b50feb6abfa9fec8b0aa705d45134c59eMisha Brukman return SDOperand(); 4847171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4848171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 48490aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 48507041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 48517041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 48527041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 48531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 485483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sandsunsigned SelectionDAGISel::MakeReg(MVT VT) { 485584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 48561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4858495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4859c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4860ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen AU.addRequired<CollectorModuleMetadata>(); 4861c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4862495a0b51915eb763576874f29192820b731edc22Chris Lattner} 48631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 48655f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 48665f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 48675f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 48681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 4869ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (MF.getFunction()->hasCollector()) 4870ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = &getAnalysis<CollectorModuleMetadata>().get(*MF.getFunction()); 4871ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 4872ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = 0; 487384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner RegInfo = &MF.getRegInfo(); 4874832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 48751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 48771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48781532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 48791532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 48801532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 48811532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 48829fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 48830e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman SelectAllBasicBlocks(Fn, MF, FuncInfo); 4884edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4885ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4886ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4887ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 488884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner if (!RegInfo->livein_empty()) 488984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 489084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner E = RegInfo->livein_end(); I != E; ++I) 4891ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4892ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4893f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4894f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4895f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4896f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4897f40708223e409a152834b1553c6883ff2035b957Duncan Sands 48981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 48991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 49001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49016833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattnervoid SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) { 4902571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SDOperand Op = getValue(V); 490318c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4904d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 490518c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 490686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 4907b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 490823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue RFV(TLI, Reg, V->getType()); 490923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman SDOperand Chain = DAG.getEntryNode(); 491023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RFV.getCopyToRegs(Op, DAG, Chain, 0); 491123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman PendingExports.push_back(Chain); 49121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 49131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4914068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 491586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan GohmanLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) { 49161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 491715699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 49180afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4919bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner SDOperand OldRoot = SDL.DAG.getRoot(); 4920a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVector<SDOperand, 16> Args; 4921a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman TLI.LowerArguments(F, SDL.DAG, Args); 4922bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4923bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4924bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4925f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AI != E; ++AI) { 4926f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4927f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(TLI, AI->getType(), ValueVTs); 4928f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumValues = ValueVTs.size(); 4929bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 49304bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands SDL.setValue(AI, SDL.DAG.getMergeValues(&Args[a], NumValues)); 4931bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4932bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4933251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4934251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 493586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(AI, VMI->second); 4936bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 49370afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4938f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman a += NumValues; 4939f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4940bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4941bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4942966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4943bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4944068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4945068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4946f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4947f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4948f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4949cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4950f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4951f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4952f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4953560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 4954560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 4955f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4956f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4957f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4958f40708223e409a152834b1553c6883ff2035b957Duncan Sands 495930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsFixedFrameObjectWithPosOffset - Check if object is a fixed frame object and 496030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// whether object offset >= 0. 496130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighoferstatic bool 496230e62c098b5841259f8026df1c5c45c7c1182a38Arnold SchwaighoferIsFixedFrameObjectWithPosOffset(MachineFrameInfo * MFI, SDOperand Op) { 496330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isa<FrameIndexSDNode>(Op)) return false; 496430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 496530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer FrameIndexSDNode * FrameIdxNode = dyn_cast<FrameIndexSDNode>(Op); 496630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer int FrameIdx = FrameIdxNode->getIndex(); 496730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return MFI->isFixedObjectIndex(FrameIdx) && 496830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MFI->getObjectOffset(FrameIdx) >= 0; 496930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 497030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 497130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsPossiblyOverwrittenArgumentOfTailCall - Check if the operand could 497230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// possibly be overwritten when lowering the outgoing arguments in a tail 497330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// call. Currently the implementation of this call is very conservative and 497430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// assumes all arguments sourcing from FORMAL_ARGUMENTS or a CopyFromReg with 497530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// virtual registers would be overwritten by direct lowering. 497630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighoferstatic bool IsPossiblyOverwrittenArgumentOfTailCall(SDOperand Op, 497730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo * MFI) { 497830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer RegisterSDNode * OpReg = NULL; 497930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Op.getOpcode() == ISD::FORMAL_ARGUMENTS || 498030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode()== ISD::CopyFromReg && 498130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg = dyn_cast<RegisterSDNode>(Op.getOperand(1))) && 498230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg->getReg() >= TargetRegisterInfo::FirstVirtualRegister)) || 498330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::LOAD && 498430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(1))) || 498530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::MERGE_VALUES && 498630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Op.getOperand(Op.ResNo).getOpcode() == ISD::LOAD && 498730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(Op.ResNo). 498830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getOperand(1)))) 498930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return true; 499030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return false; 499130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 499230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 4993c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 499448abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 4995c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 4996c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 4997c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 4998c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand Terminator = DAG.getRoot(); 4999c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5000c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 5001c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 5002c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 5003c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5004c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5005c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 5006c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 50070e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman BI = DAG.allnodes_end(); BI != BE; ) { 50080e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman --BI; 5009c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 5010c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDOperand OpRet(Ret, 0); 50110e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman SDOperand OpCall(BI, 0); 5012c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 5013c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 5014c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 5015c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 501648abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 5017c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 501830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isMarkedTailCall) continue; 501930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Ret==NULL || 502030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG)) { 502130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Not eligible. Mark CALL node as non tail call. 5022c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SmallVector<SDOperand, 32> Ops; 5023c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 502430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer for(SDNode::op_iterator I =OpCall.Val->op_begin(), 502530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer E = OpCall.Val->op_end(); I != E; I++, idx++) { 5026c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 5027c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 502830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer else 5029c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 5030c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5031c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 503230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } else { 503330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Look for tail call clobbered arguments. Emit a series of 503430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // copyto/copyfrom virtual register nodes to protect them. 503530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer SmallVector<SDOperand, 32> Ops; 503630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer SDOperand Chain = OpCall.getOperand(0), InFlag; 503730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned idx=0; 503830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer for(SDNode::op_iterator I = OpCall.Val->op_begin(), 503930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer E = OpCall.Val->op_end(); I != E; I++, idx++) { 504030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer SDOperand Arg = *I; 504130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (idx > 4 && (idx % 2)) { 504230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer bool isByVal = cast<ARG_FLAGSSDNode>(OpCall.getOperand(idx+1))-> 504330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getArgFlags().isByVal(); 504430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFunction &MF = DAG.getMachineFunction(); 504530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo *MFI = MF.getFrameInfo(); 504630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isByVal && 504730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsPossiblyOverwrittenArgumentOfTailCall(Arg, MFI)) { 504883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = Arg.getValueType(); 504930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned VReg = MF.getRegInfo(). 505030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer createVirtualRegister(TLI.getRegClassFor(VT)); 505130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = DAG.getCopyToReg(Chain, VReg, Arg, InFlag); 505230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Chain.getValue(1); 505330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Arg = DAG.getCopyFromReg(Chain, VReg, VT, InFlag); 505430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = Arg.getValue(1); 505530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Arg.getValue(2); 505630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 505730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 505830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops.push_back(Arg); 505930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 506030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Link in chain of CopyTo/CopyFromReg. 506130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops[0] = Chain; 506230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 5063c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5064c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5065c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5066c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 5067c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5068068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 5069068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 5070f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 5071ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo, GCI); 5072068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 5073bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 5074ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 507586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman LowerArguments(LLVMBB, SDL); 50761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 50771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 50781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 50791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5080f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 50819fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 50821532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI && BB->isLandingPad()) { 5083f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 5084f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 5085f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 50864406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, DAG.getEntryNode(), LabelID)); 5087f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5088e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 5089e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 5090e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 5091e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 5092e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 5093e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 5094e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 5095e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 5096f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 5097f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 5098f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 5099f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 5100cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 5101cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 5102cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 5103cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 5104cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 5105cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 5106cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 5107f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 5108f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5109f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 5110f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 5111f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 5112cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 5113f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 5114f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5115f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 5116f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 5117f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 51189fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 51199fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 51209fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 51211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 51221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 51231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 51241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 5125f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 51261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 5127f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 51281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 5129f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 51309f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 51311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 513286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(I, VMI->second); 51331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 51341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 51361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 51371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 51381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 51391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 51401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 5141edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 51428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 51431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 51451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 5146d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 51478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 51488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 51498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 51508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 51518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 5152532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 5153532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 51541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 51551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 5156d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 51578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 5158d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 51598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 51608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 51618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 51628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 51638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 51648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 51658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 51661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 51671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 51691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 51701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 51711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 51728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 51738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 51748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 51758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 51768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 51778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 51783f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 51798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 51808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 51818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 51828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 518386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(C, RegOut); 51841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 51858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 51868c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 51878c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 51888c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 51898c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 51908c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 51918c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 51928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 519386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(PHIOp, Reg); 51947e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 51951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 51968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 51978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 51988c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 519983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(PN->getType()); 52007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 5201b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 52028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 52038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 52041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 52051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 52061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 5208f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 5209a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 5210f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 521137efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 5212f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 5213f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 52143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 52153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 52164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 52174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 52184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5219a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 522086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(SDL.getControlRoot()); 5221c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5222c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 5223c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 5224c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 5225c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 5226c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer CheckDAGForTailCallsAndFixThem(DAG, TLI); 52271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 52281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5229ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnervoid SelectionDAGISel::ComputeLiveOutVRegInfo(SelectionDAG &DAG) { 5230ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 5231ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 5232ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5233ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.push_back(DAG.getRoot().Val); 5234ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5235ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 5236ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 5237ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 5238ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5239ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner while (!Worklist.empty()) { 5240ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDNode *N = Worklist.back(); 5241ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.pop_back(); 5242ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5243ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 5244ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 5245ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5246ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5247ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 5248ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 5249ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOperand(i).getValueType() == MVT::Other) 5250ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.push_back(N->getOperand(i).Val); 5251ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5252ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 5253ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 5254ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5255ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5256ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 5257ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 5258ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5259ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5260ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 5261ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDOperand Src = N->getOperand(2); 5262ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT SrcVT = Src.getValueType(); 5263ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 5264ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5265ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5266ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits = DAG.ComputeNumSignBits(Src); 5267ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 5268ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DAG.ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 5269ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5270ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 5271ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 5272ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 5273ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 5274ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (DestReg >= FLI.LiveOutRegInfo.size()) 5275ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FLI.LiveOutRegInfo.resize(DestReg+1); 5276ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[DestReg]; 5277ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 5278ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownOne = NumSignBits; 5279ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownZero = NumSignBits; 5280ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5281ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5282ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 5283ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5284f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 5285417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Lowered selection DAG:\n"; 5286417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 52875e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman std::string GroupName = "Instruction Selection and Scheduling"; 5288417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5289af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 5290ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 52915e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 5292ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(false, *AA); 5293ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5294ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(false, *AA); 5295ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 52962300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5297417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 52981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 5299f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 53001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 53011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 530270587ea813986bb0dbef71610091d496e28c22a6Chris Lattner if (EnableLegalizeTypes) {// Enable this some day. 530370587ea813986bb0dbef71610091d496e28c22a6Chris Lattner DAG.LegalizeTypes(); 530470587ea813986bb0dbef71610091d496e28c22a6Chris Lattner // TODO: enable a dag combine pass here. 530570587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 530670587ea813986bb0dbef71610091d496e28c22a6Chris Lattner 5307ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53085e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 5309ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Legalize(); 5310ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5311ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Legalize(); 5312ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5313f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5314832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 53151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 5316f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5317af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 5318ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53195e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 5320ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(true, *AA); 5321ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5322ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(true, *AA); 5323ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 53242300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5325417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 5326417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 5327417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5328a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewISelDAGs) DAG.viewGraph(); 5329ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5330f1a792bc59a4d65d0e346109c681768e07e62be5Evan Cheng if (!FastISel && EnableValueProp) 5331ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner ComputeLiveOutVRegInfo(DAG); 5332552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 5333a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 5334a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 5335ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53365e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 5337ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng InstructionSelect(DAG); 5338ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5339ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng InstructionSelect(DAG); 5340ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5341db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 53425e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 53435e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman ScheduleDAG *Scheduler; 53445e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 53455e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 53465e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler = Schedule(DAG); 53475e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 53485e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler = Schedule(DAG); 53495e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 53505e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 5351db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // Emit machine code to BB. This can change 'BB' to the last block being 5352db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 5353ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53545e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 53555e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 5356ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 53575e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 53585e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 53595e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 53605e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 53615e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 53625e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 53635e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 53645e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 53655e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 5366ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5367db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5368db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // Perform target specific isel post processing. 5369ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53705e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection Post Processing", GroupName); 5371ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng InstructionSelectPostProcessing(DAG); 5372ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5373ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng InstructionSelectPostProcessing(DAG); 5374ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5375f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5376832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 53771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 5378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 5379f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 53800e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn, MachineFunction &MF, 53810e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FunctionLoweringInfo &FuncInfo) { 53820e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman // Define AllNodes here so that memory allocation is reused for 53830e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman // each basic block. 53840e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman alist<SDNode, LargestSDNode> AllNodes; 53850e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 53860e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 53870e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman SelectBasicBlock(I, MF, FuncInfo, AllNodes); 53880e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman AllNodes.clear(); 53890e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman } 53900e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 53910e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 5392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 53930e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FunctionLoweringInfo &FuncInfo, 53940e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman alist<SDNode, LargestSDNode> &AllNodes) { 5395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 5396f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 5397ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG DAG(TLI, MF, FuncInfo, 53980e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 53990e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman AllNodes); 5400f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 5401f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5402f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 5403f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 5404f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 54051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5406f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 5407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 5408f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 54094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 54104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 54114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 54124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 54134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 54144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 5415f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5416a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 54171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 54184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 5419f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5420f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 5421f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5422f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 54239ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 54249ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 54259ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5426f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5427f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 54281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 54294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 54304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 54314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 54324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 5433ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG HSDAG(TLI, MF, FuncInfo, 54340e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 54350e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman AllNodes); 54364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 5437ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 54384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 54394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 54404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 54414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 54424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 54434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 54444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 54454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 54464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 54474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 5448ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG BSDAG(TLI, MF, FuncInfo, 54490e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 54500e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman AllNodes); 54514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 5452ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo, GCI); 54534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 54544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 54554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 54564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 54574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 54584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 54594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 54604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 54614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 54624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 54634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 54644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 54654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 54664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 54674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 54684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 54694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 54704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 54714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 54724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 54734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 54744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 54754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 54764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 54774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 54784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 54794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 54809ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 54819ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 54829ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent)); 54839ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 54849ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 54859ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases. 54869ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 54874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 54884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 54894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 54904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 54914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 54924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 54939ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 54949ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 54959ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 54964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 54974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 54984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 54994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55019453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 55029453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 55039453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 55043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 55053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 55063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 5507ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG HSDAG(TLI, MF, FuncInfo, 55080e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 55090e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman AllNodes); 55103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 5511ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 55123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 55133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 55143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 55153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 55163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 55173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 55183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 55194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 5521ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG JSDAG(TLI, MF, FuncInfo, 55220e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 55230e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman AllNodes); 55243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 5525ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo, GCI); 552637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 55273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 55283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 552937efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 55303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 55313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 55323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 55333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 553437efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 553537efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 553637efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 553737efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 553837efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 553937efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 55404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 55413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 55429ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 55439ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55449ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB)); 5545f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 55464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 5547f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 55489ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 55499ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55509ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 555137efe6764568a3829fee26aba532283131d1a104Nate Begeman } 555237efe6764568a3829fee26aba532283131d1a104Nate Begeman } 555337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 555437efe6764568a3829fee26aba532283131d1a104Nate Begeman 5555b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 5556b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 5557b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5558b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 5559b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5560b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 5561b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 55629ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 55639ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55649ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5565b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5566b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5567b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 5568f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 5569f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 5570d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 5571ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG SDAG(TLI, MF, FuncInfo, 55720e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 55730e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman AllNodes); 5574f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 5575ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo, GCI); 5576d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5577f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 5578f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 5579f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 5580d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5581f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 5582f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 5583f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 5584f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 5585d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5586d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 5587d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 5588d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 5589d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 559057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 5591d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 5592d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 5593d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 5594d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 5595d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 5596d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 55979ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn]. 55989ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 55999ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB)); 5600d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 5601d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5602d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5603f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5604d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5605d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 560657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 560757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5608d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5609d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 56102452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 561157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5612f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 561357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 5614a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 56151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5616a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 561713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 56185e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// Schedule - Pick a safe ordering for instructions for each 5619a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 56205e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 56215e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan GohmanScheduleDAG *SelectionDAGISel::Schedule(SelectionDAG &DAG) { 5622a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng if (ViewSchedDAGs) DAG.viewGraph(); 562313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 5624eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 562513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 562613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 5627eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 56289373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 56294ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 563013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 56315e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman ScheduleDAG *Scheduler = Ctor(this, &DAG, BB, FastISel); 56325e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler->Run(); 56333e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 56345e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 56355e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman return Scheduler; 5636a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 56370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 563803fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 56399ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 56409ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 56419ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 56429ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 5643755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5644755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 5645755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5646755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 5647755480681c795d585c73556c028b6143c46bda86Chris Lattner 5648755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 5649755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5650755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 5651755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5652755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckAndMask(SDOperand LHS, ConstantSDNode *RHS, 5653dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 56542e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 56552e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5656755480681c795d585c73556c028b6143c46bda86Chris Lattner 5657755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5658755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5659755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5660755480681c795d585c73556c028b6143c46bda86Chris Lattner 5661755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 56622e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5663755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5664755480681c795d585c73556c028b6143c46bda86Chris Lattner 5665755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5666755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 56672e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5668ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5669755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5670755480681c795d585c73556c028b6143c46bda86Chris Lattner 5671755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5672755480681c795d585c73556c028b6143c46bda86Chris Lattner 5673755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5674755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5675755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5676755480681c795d585c73556c028b6143c46bda86Chris Lattner 5677755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5678755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5679755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5680755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5681755480681c795d585c73556c028b6143c46bda86Chris Lattnerbool SelectionDAGISel::CheckOrMask(SDOperand LHS, ConstantSDNode *RHS, 56822e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 56832e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 56842e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5685755480681c795d585c73556c028b6143c46bda86Chris Lattner 5686755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5687755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5688755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5689755480681c795d585c73556c028b6143c46bda86Chris Lattner 5690755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 56912e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5692755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5693755480681c795d585c73556c028b6143c46bda86Chris Lattner 5694755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5695755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 56962e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5697755480681c795d585c73556c028b6143c46bda86Chris Lattner 56982e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 5699ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5700755480681c795d585c73556c028b6143c46bda86Chris Lattner 5701755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5702755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5703755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5704755480681c795d585c73556c028b6143c46bda86Chris Lattner 5705755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5706755480681c795d585c73556c028b6143c46bda86Chris Lattner 5707755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5708755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5709755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5710755480681c795d585c73556c028b6143c46bda86Chris Lattner 57119ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 57120e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 57130e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 57140e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 57150e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris LattnerSelectInlineAsmMemoryOperands(std::vector<SDOperand> &Ops, SelectionDAG &DAG) { 57160e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> InOps; 57170e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 57180e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57190e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 57200e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 57210e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 57230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 57240e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 57250e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57260e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 57270e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 57280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 57290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 57300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 57310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 57320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 57330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 57340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 57350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::vector<SDOperand> SelOps; 57360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5737832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 57380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 57390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 57400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 574283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 574336d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 57444b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 57450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 57460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 57470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 57480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 57490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 57510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 57520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 57530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5754794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 57551997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5756