SelectionDAGISel.cpp revision 3bc9c6f3e75dba02c1cc647b1f56ee1f39919046
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> 55f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan SandsEnableLegalizeTypes("enable-legalize-types", cl::Hidden); 56ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 57ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 58da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 597944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 60462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 61462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 62462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 63462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 64462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 65462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 66462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 67462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 68462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 69462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 70462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 71462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 72462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 73462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 74a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 75a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 76a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 77a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 78a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 793e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 803e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 815bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 827944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 83462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 84462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 85462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 86462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 87462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 887944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 897944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 90eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 91eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 92eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 93eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 94eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 95eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 96eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 97eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 98eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 99eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 100eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 101eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 102844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 103844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 104844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 105844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 106844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 107844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 10813ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 109844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 110844731a7f1909f55935e3514c9e713a62d67662eDan GohmandefaultListDAGScheduler("default", " Best scheduler for the target", 111844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1124ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1135c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengnamespace { struct SDISelAsmOperandInfo; } 114bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 1151d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// ComputeLinearIndex - Given an LLVM IR aggregate type and a sequence 1161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// insertvalue or extractvalue indices that identify a member, return 1171d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// the linearized index of the start of the member. 1181d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 1191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanstatic unsigned ComputeLinearIndex(const TargetLowering &TLI, const Type *Ty, 1201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const unsigned *Indices, 1211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const unsigned *IndicesEnd, 1221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned CurIndex = 0) { 1231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Base case: We're done. 1248f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && Indices == IndicesEnd) 1251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman return CurIndex; 1261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 1271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Given a struct type, recursively traverse the elements. 1281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (const StructType *STy = dyn_cast<StructType>(Ty)) { 1298f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman for (StructType::element_iterator EB = STy->element_begin(), 1308f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman EI = EB, 1311d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EE = STy->element_end(); 1321d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI != EE; ++EI) { 1338f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && *Indices == unsigned(EI - EB)) 1348f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return ComputeLinearIndex(TLI, *EI, Indices+1, IndicesEnd, CurIndex); 1358f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman CurIndex = ComputeLinearIndex(TLI, *EI, 0, 0, CurIndex); 1361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1371d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1381d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Given an array type, recursively traverse the elements. 1391d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 1401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *EltTy = ATy->getElementType(); 1411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) { 1428f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && *Indices == i) 1438f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return ComputeLinearIndex(TLI, EltTy, Indices+1, IndicesEnd, CurIndex); 1448f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman CurIndex = ComputeLinearIndex(TLI, EltTy, 0, 0, CurIndex); 1451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // We haven't found the type we're looking for, so keep searching. 1488f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return CurIndex + 1; 1491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman} 1501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 151f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// ComputeValueVTs - Given an LLVM IR type, compute a sequence of 15283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands/// MVTs that represent all the individual underlying 153f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// non-aggregate types that comprise it. 1541d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 1551d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// If Offsets is non-null, it points to a vector to be filled in 1561d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// with the in-memory offsets of each of the individual values. 1571d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 158f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnerstatic void ComputeValueVTs(const TargetLowering &TLI, const Type *Ty, 1591d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVectorImpl<MVT> &ValueVTs, 1601d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVectorImpl<uint64_t> *Offsets = 0, 1611d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman uint64_t StartingOffset = 0) { 162f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given a struct type, recursively traverse the elements. 163f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const StructType *STy = dyn_cast<StructType>(Ty)) { 1641d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const StructLayout *SL = TLI.getTargetData()->getStructLayout(STy); 1651d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (StructType::element_iterator EB = STy->element_begin(), 1661d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI = EB, 1671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EE = STy->element_end(); 1681d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI != EE; ++EI) 1691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, *EI, ValueVTs, Offsets, 1701d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman StartingOffset + SL->getElementOffset(EI - EB)); 171f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 172f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner } 173f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given an array type, recursively traverse the elements. 174f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 175f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner const Type *EltTy = ATy->getElementType(); 1761d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman uint64_t EltSize = TLI.getTargetData()->getABITypeSize(EltTy); 177f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) 1781d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, EltTy, ValueVTs, Offsets, 1791d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman StartingOffset + i * EltSize); 180f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 18123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 18283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands // Base case: we can get an MVT for this LLVM IR type. 183f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner ValueVTs.push_back(TLI.getValueType(Ty)); 1841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (Offsets) 1851d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Offsets->push_back(StartingOffset); 186f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner} 18723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 188f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnernamespace { 1890fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegsForValue - This struct represents the registers (physical or virtual) 1900fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// that a particular set of values is assigned, and the type information about 1910fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// the value. The most common situation is to represent one value at a time, 1920fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// but struct or array values are handled element-wise as multiple values. 1930fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// The splitting of aggregates is performed recursively, so that we never 1940fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have aggregate-typed registers. The values at this point do not necessarily 1950fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have legal types, so each value may require one or more registers of some 1960fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// legal type. 1970fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 1989525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 19923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// TLI - The TargetLowering object. 2000fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 20123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const TargetLowering *TLI; 20223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 2030fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs - The value types of the values, which may not be legal, and 2040fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// may need be promoted or synthesized from one or more registers. 2050fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 20683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 207864635ad7b3046d3042311423071152c613961deChris Lattner 2080fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegVTs - The value types of the registers. This is the same size as 2090fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs and it records, for each value, what the type of the assigned 2100fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// register or registers are. (Individual values are never synthesized 2110fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// from more than one type of register.) 2120fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2130fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// With virtual registers, the contents of RegVTs is redundant with TLI's 2140fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// getRegisterType member function, however when with physical registers 2150fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// it is necessary to have a separate record of the types. 216864635ad7b3046d3042311423071152c613961deChris Lattner /// 21783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RegVTs; 218864635ad7b3046d3042311423071152c613961deChris Lattner 2190fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Regs - This list holds the registers assigned to the values. 2200fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Each legal or promoted value requires one register, and each 2210fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// expanded value requires multiple registers. 2220fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2230fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman SmallVector<unsigned, 4> Regs; 224864635ad7b3046d3042311423071152c613961deChris Lattner 22523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue() : TLI(0) {} 226864635ad7b3046d3042311423071152c613961deChris Lattner 22723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 228b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 22983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT regvt, MVT valuevt) 2300fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {} 23123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 232b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 23383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const SmallVector<MVT, 4> ®vts, 23483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const SmallVector<MVT, 4> &valuevts) 2350fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {} 23623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 23723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned Reg, const Type *Ty) : TLI(&tli) { 23823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(tli, Ty, ValueVTs); 23923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 240b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 24183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 24223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 24383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI->getRegisterType(ValueVT); 24423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 24523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Regs.push_back(Reg + i); 24623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegVTs.push_back(RegisterVT); 24723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Reg += NumRegs; 24823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 249864635ad7b3046d3042311423071152c613961deChris Lattner } 250864635ad7b3046d3042311423071152c613961deChris Lattner 25141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner /// append - Add the specified values to this one. 25241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner void append(const RegsForValue &RHS) { 25341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner TLI = RHS.TLI; 25441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end()); 25541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end()); 25641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner Regs.append(RHS.Regs.begin(), RHS.Regs.end()); 25741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } 25841f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 25941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 260864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 26123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// this value and returns the result as a ValueVTs value. This uses 262864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 263b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 264475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getCopyFromRegs(SelectionDAG &DAG, 265475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const; 266c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 267c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 268c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 269c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 270b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 271475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void getCopyToRegs(SDValue Val, SelectionDAG &DAG, 272475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const; 273c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 274c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 275c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 276c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 277c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 278475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> &Ops) const; 279864635ad7b3046d3042311423071152c613961deChris Lattner }; 280864635ad7b3046d3042311423071152c613961deChris Lattner} 2814ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 2821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 2831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 2849373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 2859373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 2869373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 2879373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 2884576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng MachineBasicBlock *BB, 2894576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng bool Fast) { 2909373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 2919373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 2929373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 2934576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng return createTDListDAGScheduler(IS, DAG, BB, Fast); 2949373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 2959373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 2969373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 2974576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng return createBURRListDAGScheduler(IS, DAG, BB, Fast); 2989373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 2999373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 3009373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 3019373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 3029373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 3031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 3041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 305f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 306f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 3071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 3081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 3091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 31084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo; 3111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 3131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 3151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const BasicBlock*, MachineBasicBlock *> MBBMap; 3161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 3181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 3191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 3209f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 3211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 3231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 3241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 3251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<const AllocaInst*, int> StaticAllocaMap; 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 327f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 328f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 329f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 330f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 331f40708223e409a152834b1553c6883ff2035b957Duncan Sands 33283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned MakeReg(MVT VT) { 33384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT)); 3341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 335571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 336571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 337571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 338571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 339571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 340571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 341edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3423c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 3433c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 3451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 3461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 3471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 3481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 349ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 350ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner struct LiveOutInfo { 351ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits; 352ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne, KnownZero; 353ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LiveOutInfo() : NumSignBits(0) {} 354ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner }; 355ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 356ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// LiveOutRegInfo - Information about live out vregs, indexed by their 357ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// register number offset by 'FirstVirtualRegister'. 358ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner std::vector<LiveOutInfo> LiveOutRegInfo; 3591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 3601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 362cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 363cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 364cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 365f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 3668806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 3678806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 368f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 369f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 370f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 372f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 373ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth/// switch or atomic instruction, which may expand to multiple basic blocks. 3741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 3751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 3761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 3771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 378f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 379571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 3811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 3821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 3831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 385bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 387f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 388bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 389bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 390bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 391f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 392bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 393bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 394bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 395bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 3961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 397edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 39884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) { 3991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 400bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 401bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 40216ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 40316ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 404bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 405bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 4061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 407bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 408bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 409bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 4102aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 413b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 4141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 415514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 416ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 417d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 418ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 419a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 420b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 421d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 4221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 4236266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 4241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4262aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 4272aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 4291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 4301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 4311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 4321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 4341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 4362aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 4370e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB); 4381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 4390e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MF.push_back(MBB); 4401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 4431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 4448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 4458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 4468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 4488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 4496f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman 4506f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman SmallVector<MVT, 4> ValueVTs; 4516f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman ComputeValueVTs(TLI, PN->getType(), ValueVTs); 4526f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 4536f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman MVT VT = ValueVTs[vti]; 4546f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4556f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 4566f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 4576f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 4586f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman PHIReg += NumRegisters; 4596f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman } 4608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4643c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 4653c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 4663c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 46710a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 46810a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// In the case that the given value has struct or array type, this function 46910a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// will assign registers for each member or element. 47010a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 4713c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 47283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 473b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner ComputeValueVTs(TLI, V->getType(), ValueVTs); 47495b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 47523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned FirstReg = 0; 476b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 47783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 47883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI.getRegisterType(ValueVT); 4798c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 480b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumRegs = TLI.getNumRegisters(ValueVT); 48123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 48223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned R = MakeReg(RegisterVT); 48323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman if (!FirstReg) FirstReg = R; 48423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 48523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 48623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return FirstReg; 4873c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 4881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 4901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 4911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 4921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 4931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 4941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 4951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 4961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 4971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 498475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DenseMap<const Value*, SDValue> NodeMap; 4991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 500d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 501d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 502d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 503d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 504475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> PendingLoads; 505d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 50686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingExports - CopyToReg nodes that copy values to virtual registers 50786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// for export to other blocks need to be emitted before any terminator 50886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instruction, but they have no other ordering requirements. We bunch them 50986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// up and the emit a single tokenfactor for them just before terminator 51086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instructions. 511475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> PendingExports; 51286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 5135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 5145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 5155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 5165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 5175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 5185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 5195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 5215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 5225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 5235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 5245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 5255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 5265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 5275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 5285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 5295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 5314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 5324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 5334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 5344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 5364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 5374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 5404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 5415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 5425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 543f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 544f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 545f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 546f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 547f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 548f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 549f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 550f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 551f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 552f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 553f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 554f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 555f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 556f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 557f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 558f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 559f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 560b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 561b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 5625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 5645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 565f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 5664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 5675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 5685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 5695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 5705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 571f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 572f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 5735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 5754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 5764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 5774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 5784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 581f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 5831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 5841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 5851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 5861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 5871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 588a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 5895f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 5901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 591f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 592f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 593f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 5943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 5953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 5963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 5974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 598f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 6001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 6011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 602ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 603ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen /// GCI - Garbage collection metadata for the function. 604ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *GCI; 6051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 6075f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 608ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FunctionLoweringInfo &funcinfo, 609ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen CollectorMetadata *gci) 6105f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 611ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FuncInfo(funcinfo), GCI(gci) { 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 61486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getRoot - Return the current virtual root of the Selection DAG, 61586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// flushing any PendingLoad items. This must be done before emitting 61686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// a store or any other node that may need to be ordered after any 61786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// prior load instructions. 618a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 619475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getRoot() { 620d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 621d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 622edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 623d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 624475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = PendingLoads[0]; 625d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 626d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 627d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 628d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 629d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 630d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 631475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 632bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 633d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 634d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 635d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 636a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 637a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 63886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getControlRoot - Similar to getRoot, but instead of flushing all the 63986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingLoad items, flush all the PendingExports items. It is necessary 64086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// to do this before emitting a terminator instruction. 64186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// 642475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getControlRoot() { 643475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = DAG.getRoot(); 64486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 64586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports.empty()) 64686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 64786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 64886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman // Turn all of the CopyToReg chains into one factored node. 64986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (Root.getOpcode() != ISD::EntryToken) { 65086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned i = 0, e = PendingExports.size(); 65186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (; i != e; ++i) { 65286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(PendingExports[i].Val->getNumOperands() > 1); 65386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports[i].Val->getOperand(0) == Root) 65486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman break; // Don't add the root if we already indirectly depend on it. 65586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 65686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 65786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (i == e) 65886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Root); 65986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 66086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 66186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 66286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman &PendingExports[0], 66386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.size()); 66486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.clear(); 66586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(Root); 66686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 66786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 66886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 66986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman void CopyValueToVirtualRegister(Value *V, unsigned Reg); 670571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 6711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 6721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 6741e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 6751e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 6761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 6771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 6781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 6801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 6811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 6821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 6831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 6871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 688475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getValue(const Value *V); 6891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 690475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void setValue(const Value *V, SDValue NewN) { 691475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &N = NodeMap[V]; 6921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 6930da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 6941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6954e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 6965c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 697e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 698e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 699f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 700571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 701571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 702571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 7038c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 704571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 705475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void LowerCallTo(CallSite CS, SDValue Callee, bool IsTailCall, 706070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 707dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 7081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 7091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 7101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 711f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 7121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 7131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 714b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 715dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 716b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 717b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 718b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 719dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 720b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 721b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 722b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 723dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 724b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 725b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 726b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 7274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 7284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 7294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 7304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 731f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 7324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 7334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 7344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 7354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 73637efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 7373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 7383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 739f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 7401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 741b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 742b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 7431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7447f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 745e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 7465fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 7477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 7487f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 7491628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 7507f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 75101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 752b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 7531628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 7547f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 7557f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 7561628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 7577f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 7581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7597f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 7607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 7617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 7627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 7637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 7647f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 7657f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 7667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 7677f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 76824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 7693822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 7703822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 77145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 77245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 773b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVICmp(User &I); 774b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVFCmp(User &I); 7753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 7763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 7773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 7783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 7793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 7803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 7813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 7823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 7833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 7843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 7853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 7863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 7873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 7881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7892bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 7902bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 7913e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 792c7029805ef35ce9805931067b841e6af11db382eChris Lattner 7931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitExtractValue(ExtractValueInst &I); 7941d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitInsertValue(InsertValueInst &I); 795041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 7961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 7971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 7981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 8001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 8011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 8021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 8031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 8041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 8051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 806fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 807c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 8080eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 8091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 8111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 8121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 8131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 8141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 8161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 8171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 8181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 8201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 8211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 8221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 82363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 82463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangprivate: 82563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang inline const char *implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op); 82663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 8271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 8281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 8291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 831b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyFromParts - Create a value that contains the specified legal parts 832b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// combined into the value they represent. If the parts combine to a type 833b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// larger then ValueVT then AssertOp can be used to specify whether the extra 834b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 8354468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner/// (ISD::AssertSext). 836475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstatic SDValue getCopyFromParts(SelectionDAG &DAG, 837475871a144eb604ddaf37503397ba0941442e5fbDan Gohman const SDValue *Parts, 8386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 83983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 84083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT, 8414468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner ISD::NodeType AssertOp = ISD::DELETED_NODE) { 842014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts > 0 && "No parts to assemble!"); 843014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TargetLowering &TLI = DAG.getTargetLoweringInfo(); 844475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = Parts[0]; 845014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 846014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts > 1) { 847014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the value from multiple parts. 84883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 84983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 85083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned ValueBits = ValueVT.getSizeInBits(); 851014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 852014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the power of 2 part. 853014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = NumParts & (NumParts - 1) ? 854014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1 << Log2_32(NumParts) : NumParts; 855014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = PartBits * RoundParts; 85683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RoundVT = RoundBits == ValueBits ? 85783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT : MVT::getIntegerVT(RoundBits); 858475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Lo, Hi; 859014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 860014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts > 2) { 86183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT HalfVT = MVT::getIntegerVT(RoundBits/2); 862014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT); 863014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2, 864014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, HalfVT); 8656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 866014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Parts[0]; 867014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = Parts[1]; 8686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 869014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 870014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 871014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi); 872014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 873014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts < NumParts) { 874014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the trailing non-power-of-2 part. 875014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 87683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OddVT = MVT::getIntegerVT(OddParts * PartBits); 877014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT); 878014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 879014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Combine the round and odd parts. 880014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Val; 881014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 882014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 88383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT TotalVT = MVT::getIntegerVT(NumParts * PartBits); 884014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi); 885014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::SHL, TotalVT, Hi, 88683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands DAG.getConstant(Lo.getValueType().getSizeInBits(), 887014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 888014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo); 889014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi); 890014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 891014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 892014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Handle a multi-element vector. 89383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 894014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumIntermediates; 895014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumRegs = 896014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 897014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands RegisterVT); 898014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 89935213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 900014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 901014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == Parts[0].getValueType() && 902014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Part type doesn't match part!"); 903014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 904014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the parts into intermediate operands. 905475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops(NumIntermediates); 906014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumIntermediates == NumParts) { 907014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the register was not expanded, truncate or copy the value, 908014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // as appropriate. 909014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumParts; ++i) 910014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 911014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 912014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts > 0) { 913014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the intermediate type was expanded, build the intermediate operands 914014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // from the parts. 915014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts % NumIntermediates == 0 && 916014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Must expand into a divisible number of parts!"); 917014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned Factor = NumParts / NumIntermediates; 918014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumIntermediates; ++i) 919014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 920014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 921014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 922014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 923014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 924014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // operands. 92583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands Val = DAG.getNode(IntermediateVT.isVector() ? 926014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, 927014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT, &Ops[0], NumIntermediates); 9286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 929014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 931014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // There is now one part, held in Val. Correct it to match ValueVT. 932014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT = Val.getValueType(); 9336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 934014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) 935014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return Val; 936014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 93783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 93883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.isVector() && "Unknown vector conversion!"); 939014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 9406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 94283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (ValueVT.isVector()) { 94383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 94483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 945014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Only trivial scalar-to-vector conversions should get here!"); 946014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 947014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 94983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && 95083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.isInteger()) { 9518e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(PartVT)) { 952014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // For a truncate, see if we have any information to 953014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // indicate whether the truncated bits will always be 954014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // zero or sign-extension. 955014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (AssertOp != ISD::DELETED_NODE) 956014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(AssertOp, PartVT, Val, 957014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getValueType(ValueVT)); 958014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 959014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 960014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 961014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 963014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 96483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 9658e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(Val.getValueType())) 9664468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner // FP_ROUND's are always exact here. 967d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val, 9684468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner DAG.getIntPtrConstant(1)); 969d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val); 970d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner } 971014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 97283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) 973014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 974014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 975014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 976475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); 9776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 9786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 979b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyToParts - Create a series of nodes that contain the specified value 980b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// split into legal parts. If the parts contain more bits than Val, then, for 981b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// integers, ExtendKind can be used to specify how to generate the extra bits. 9826183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 983475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val, 984475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue *Parts, 9856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 98683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 987b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 98825ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 98983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PtrVT = TLI.getPointerTy(); 99083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = Val.getValueType(); 99183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 992014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 993014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 994014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!NumParts) 995014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 996014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 99783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 998014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) { 999014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "No-op copy with multiple parts!"); 1000014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 1001014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1002014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1003014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 100483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (NumParts * PartBits > ValueVT.getSizeInBits()) { 1005014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover more bits than the value has, promote the value. 100683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 1007014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "Do not know what to promote to!"); 1008014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 100983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartVT.isInteger() && ValueVT.isInteger()) { 101083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1011014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ExtendKind, ValueVT, Val); 1012014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1013014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1014014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 101583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartBits == ValueVT.getSizeInBits()) { 1016014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Different types of the same size. 1017014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && PartVT != ValueVT); 1018014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 101983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (NumParts * PartBits < ValueVT.getSizeInBits()) { 1020014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover less bits than value has, truncate the value. 102183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && ValueVT.isInteger()) { 102283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1023014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1024014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1025014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1026014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1027014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 10286183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1029014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The value may have changed - recompute ValueVT. 1030014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = Val.getValueType(); 103183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(NumParts * PartBits == ValueVT.getSizeInBits() && 1032014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Failed to tile the value with PartVT!"); 1033014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1034014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 1035014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(PartVT == ValueVT && "Type conversion failed!"); 1036014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 10376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 10386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1040014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Expand the value into multiple parts. 1041014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts & (NumParts - 1)) { 1042014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is not a power of 2. Split off and copy the tail. 104383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(PartVT.isInteger() && ValueVT.isInteger() && 1044014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Do not know what to expand to!"); 1045014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = 1 << Log2_32(NumParts); 1046014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = RoundParts * PartBits; 1047014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 1048475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OddVal = DAG.getNode(ISD::SRL, ValueVT, Val, 1049014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(RoundBits, 1050014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 1051014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT); 1052014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1053014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The odd parts were reversed by getCopyToParts - unreverse them. 1054014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts + RoundParts, Parts + NumParts); 1055014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands NumParts = RoundParts; 105683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1057014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1058014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1059014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1060014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is a power of 2. Repeatedly bisect the value using 1061014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // EXTRACT_ELEMENT. 106225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Parts[0] = DAG.getNode(ISD::BIT_CONVERT, 106383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT::getIntegerVT(ValueVT.getSizeInBits()), 106425eb043759c23b61769108f78382eb9701c41db2Duncan Sands Val); 1065014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 1066014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i < NumParts; i += StepSize) { 1067014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ThisBits = StepSize * PartBits / 2; 106883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::getIntegerVT (ThisBits); 1069475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Part0 = Parts[i]; 1070475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Part1 = Parts[i+StepSize/2]; 107125eb043759c23b61769108f78382eb9701c41db2Duncan Sands 107225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 107325eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(1, PtrVT)); 107425eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 107525eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(0, PtrVT)); 107625eb043759c23b61769108f78382eb9701c41db2Duncan Sands 107725eb043759c23b61769108f78382eb9701c41db2Duncan Sands if (ThisBits == PartBits && ThisVT != PartVT) { 107825eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0); 107925eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1); 108025eb043759c23b61769108f78382eb9701c41db2Duncan Sands } 1081014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1082014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1083014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1084014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1085014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts, Parts + NumParts); 1086014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1087014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1088014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1089014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1090014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Vector ValueVT. 1091014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 10926183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 109383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 10946183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 1095014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 109683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 109783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 1098a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 1099a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 1100a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 11016183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11026183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1103014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 11046183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 11056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 11066183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11086183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 110983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 11106183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 11116183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 11126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 11136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 11146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 111583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned NumElements = ValueVT.getVectorNumElements(); 11166183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 111835213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 11196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 11206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 1122475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops(NumIntermediates); 11236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 112483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (IntermediateVT.isVector()) 11256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 11266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 11276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 112825ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 11296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 11306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 11316183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 113225ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 11336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 11356183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 11366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 11376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 11386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 1139532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 11406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 11416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 11426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 11436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 11446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 11456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 11466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 1147532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 11486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 11506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1152475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue SelectionDAGLowering::getValue(const Value *V) { 1153475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &N = NodeMap[V]; 1154199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 1155199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1156199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 115783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(V->getType(), true); 1158b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1159b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) 1160b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstant(CI->getValue(), VT); 1161b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1162b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) 1163199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 1164b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1165b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (isa<ConstantPointerNull>(C)) 1166199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 1167b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1168b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) 1169b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 1170b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 11711d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C) && !isa<VectorType>(V->getType()) && 11721d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman !V->getType()->isAggregateType()) 11736833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 1174b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1175b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 1176b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner visit(CE->getOpcode(), *CE); 1177475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N1 = NodeMap[V]; 1178b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 1179b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N1; 1180b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner } 1181b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 11821d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) { 1183475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Constants; 11841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end(); 11851d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman OI != OE; ++OI) { 11861d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDNode *Val = getValue(*OI).Val; 11874bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i) 1188475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Constants.push_back(SDValue(Val, i)); 11891d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 11904bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands return DAG.getMergeValues(&Constants[0], Constants.size()); 11911d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 11921d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 11931f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman if (isa<StructType>(C->getType()) || isa<ArrayType>(C->getType())) { 11941d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 11951f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman "Unknown struct or array constant!"); 11961d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 11971f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman SmallVector<MVT, 4> ValueVTs; 11981f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman ComputeValueVTs(TLI, C->getType(), ValueVTs); 11991f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman unsigned NumElts = ValueVTs.size(); 12008a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumElts == 0) 1201475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); // empty struct 1202475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Constants(NumElts); 12031f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman for (unsigned i = 0; i != NumElts; ++i) { 12041f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman MVT EltVT = ValueVTs[i]; 12051d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C)) 12061d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getNode(ISD::UNDEF, EltVT); 12071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (EltVT.isFloatingPoint()) 12081d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstantFP(0, EltVT); 12091d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else 12101d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstant(0, EltVT); 12111d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12121f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman return DAG.getMergeValues(&Constants[0], NumElts); 12131d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12141d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 12156833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner const VectorType *VecTy = cast<VectorType>(V->getType()); 1216b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumElements = VecTy->getNumElements(); 1217b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 12186833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // Now that we know the number and type of the elements, get that number of 12196833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // elements into the Ops array based on what kind of constant it is. 1220475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 16> Ops; 1221b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 1222b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 1223b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.push_back(getValue(CP->getOperand(i))); 1224199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 12256833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 12266833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Unknown vector constant!"); 122783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(VecTy->getElementType()); 12286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 1229475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op; 12306833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C)) 12316833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getNode(ISD::UNDEF, EltVT); 123283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands else if (EltVT.isFloatingPoint()) 12336833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstantFP(0, EltVT); 1234b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner else 12356833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstant(0, EltVT); 1236b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.assign(NumElements, Op); 1237199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1238b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1239b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // Create a BUILD_VECTOR node. 1240b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 1241199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1242199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1243b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // If this is a static alloca, generate it as the frameindex instead of 1244b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // computation. 1245199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 1246199862b74973198c2ab5a139f664c86713e7b579Chris Lattner std::map<const AllocaInst*, int>::iterator SI = 1247b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 1248199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 1249199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 1250199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1251199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1252251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 1253251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 1254199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 12556833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner RegsForValue RFV(TLI, InReg, V->getType()); 1256475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getEntryNode(); 1257b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 1258199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 1259199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1260199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 12611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 12621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 126386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot())); 12641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 12651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1266b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1267475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> NewValues; 126886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman NewValues.push_back(getControlRoot()); 126986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 1270475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RetOp = getValue(I.getOperand(i)); 1271b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1272ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman SmallVector<MVT, 4> ValueVTs; 1273ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ComputeValueVTs(TLI, I.getOperand(i)->getType(), ValueVTs); 1274ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned j = 0, f = ValueVTs.size(); j != f; ++j) { 1275ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT VT = ValueVTs[j]; 1276ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1277ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // FIXME: C calling convention requires the return type to be promoted to 1278ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // at least 32-bit. But this is not necessary for non-C calling conventions. 1279ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.isInteger()) { 1280ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT MinVT = TLI.getRegisterType(MVT::i32); 1281ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.bitsLT(MinVT)) 1282ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman VT = MinVT; 1283ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1284b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1285ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman unsigned NumParts = TLI.getNumRegisters(VT); 1286ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT PartVT = TLI.getRegisterType(VT); 1287475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 1288ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1289ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1290ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman const Function *F = I.getParent()->getParent(); 1291ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (F->paramHasAttr(0, ParamAttr::SExt)) 1292ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 1293ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman else if (F->paramHasAttr(0, ParamAttr::ZExt)) 1294ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 1295ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1296475871a144eb604ddaf37503397ba0941442e5fbDan Gohman getCopyToParts(DAG, SDValue(RetOp.Val, RetOp.ResNo + j), 1297ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman &Parts[0], NumParts, PartVT, ExtendKind); 1298ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1299ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned i = 0; i < NumParts; ++i) { 1300ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(Parts[i]); 1301ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy())); 1302ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1303ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 13041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1305bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 1306bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 13071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1309571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 1310571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 1311571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 1312571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 1313571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 1314571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 1315571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1316571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 1317571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 1318571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1319571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 132086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(V, Reg); 1321571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1322571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 13238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 13248c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 13258c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 13268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 13278c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 13288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 13298c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 13308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 13338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 13348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 13378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 13388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 13398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 13408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 13438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 13448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 13478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 13498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13506a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 13516a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 13526a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 13536a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 13546a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 13556a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1356571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1357571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1358571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1359571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1360571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1361571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1362571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1363e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1364571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1365e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1366e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 13676a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 13686a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 13696a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1370571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1371571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1372e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1373e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1374e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1375e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 13765a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 13775a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 13785a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 13795a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 13805a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1381e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1382e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1383e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1384e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1385e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1386e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1387e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1388e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1389e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1390e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1391e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1392e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1393e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1394e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1395e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1396e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1397e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1398e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1399e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1400e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1401e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1402e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1403e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1404e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1405e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1406e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1407e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 14086bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 14096bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 1410e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1411e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1412e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1413e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1414e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1415e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1416e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1417e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1418e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1419e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1420e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1421e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1422e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 14230da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1424e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1425571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1426571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1427571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 14285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1429571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1430571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1431571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1432571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1433571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 14346b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 14355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1436571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1437571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1438571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1439571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1440d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1441d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1442571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 14430e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineFunction &MF = DAG.getMachineFunction(); 14440e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock()); 14450e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurBB->getParent()->insert(++BBI, TmpBB); 1446571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1447d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1448d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1449d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1450d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1451d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1452d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1453d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1454d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1455571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1456d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1457d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1458d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1459d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1460d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1461d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1462d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1463d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1464d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1465d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1466d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1467d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1468d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1469d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1470d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1471d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1472d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1473d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1474d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1475d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1476d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1477d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1478571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1479571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1480df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1481df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1482df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1483df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1484df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1485df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1486df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 14870ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 14880ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 14890ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 14900ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 14910ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 14920ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 14930ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 14940ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 14950ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1496df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1497df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1498df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 14991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 15001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 15011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 15021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 15041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 15051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 15061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 15071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 15081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 15102d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update machine-CFG edges. 15112d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Succ0MBB); 15122d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 15131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 15141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 151586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1516dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 151757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 151857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 151957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 152057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 152157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 152257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 152357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1524571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1525571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1526571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1527571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1528571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1529571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1530571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1531571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1532571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1533571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1534571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1535571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1536571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1537571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1538571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1539571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1540571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1541571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1542d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1543571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1544571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 15450ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 15460ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 15470ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 15480ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 15490ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1550df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1551df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1552df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1553df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1554df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1555df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1556df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1557df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1558df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1559df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1560df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 15615a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 15625a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 15630ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 15640ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 15650ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 15660e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMBB->getParent()->erase(SwitchCases[i].ThisBB); 15670ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1568df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1569571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1570571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 15712452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 15722452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 15736b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 15745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 15752452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 15762452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 15772452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 15781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 15791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1580f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1581f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1582f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 1583475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Cond; 1584475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CondLHS = getValue(CB.CmpLHS); 158557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 15865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 15875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 15885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 15895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 15905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 15915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 15925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 1593475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue True = DAG.getConstant(1, CondLHS.getValueType()); 15945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 15955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 15965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 15975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 15985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 15995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 16015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 16025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1603475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CmpOp = getValue(CB.CmpMHS); 160483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = CmpOp.getValueType(); 16053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 16075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 16085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 1609475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 16105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 16115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 16125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16152d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update successor info 16162d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.TrueBB); 16172d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.FalseBB); 16182d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1619f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1620f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1621f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1622f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1623f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1624f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1625f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1626f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1627f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 162857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 162957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1630475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue True = DAG.getConstant(1, Cond.getValueType()); 1631f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1632f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1633475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond, 163457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 1635bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson 1636bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson // If the branch was constant folded, fix up the CFG. 1637bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (BrCond.getOpcode() == ISD::BR) { 16383bc9c6f3e75dba02c1cc647b1f56ee1f39919046Owen Anderson CurMBB->removeSuccessor(CB.FalseBB); 1639f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1640bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson } else { 1641bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson // Otherwise, go ahead and insert the false branch. 1642bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (BrCond == getControlRoot()) 16433bc9c6f3e75dba02c1cc647b1f56ee1f39919046Owen Anderson CurMBB->removeSuccessor(CB.TrueBB); 1644bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson 1645bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (CB.FalseBB == NextBlock) 1646bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.setRoot(BrCond); 1647bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson else 1648bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 1649bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.getBasicBlock(CB.FalseBB))); 1650bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson } 1651f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1652f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 16533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 165437efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 165537efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1656f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 165783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PTy = TLI.getPointerTy(); 1658475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy); 1659475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Table = DAG.getJumpTable(JT.JTI, PTy); 16603d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 16613d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 16623d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 166337efe6764568a3829fee26aba532283131d1a104Nate Begeman} 166437efe6764568a3829fee26aba532283131d1a104Nate Begeman 16653a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 16663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 16673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 16683a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 16693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 16703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 16713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 1672475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchOp = getValue(JTH.SValue); 167383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 1674475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 16753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 16763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 16783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 16793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 16803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 16813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 16828e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 16833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 16843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 16853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 16863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1688475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp); 16893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 16903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 16923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 16933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 1694475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 16953a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 16963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 16973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 16993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 17043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1705475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 17063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 17073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 17093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 17103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 17113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 17124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 17134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 17153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 17163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 17184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 17194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 17204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 1721475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchOp = getValue(B.SValue); 172283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 1723475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 17244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 17254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 1727475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 17284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 17294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 17304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1731475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ShiftOp; 17328e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getShiftAmountTy())) 17334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 17344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 17364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 1738475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 17394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 17404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 17414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1743475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal); 17444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 17454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 17474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 17524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 17542d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17552d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.Default); 17562d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(MBB); 17572d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1758475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 17592d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(B.Default)); 17602d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 17624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 17634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 17654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 17664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 17684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 17694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 17714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 17724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 17734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 17744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 1775475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg, 1776ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner TLI.getPointerTy()); 17774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1778475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), SwitchVal, 1779ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DAG.getConstant(B.Mask, TLI.getPointerTy())); 1780475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp, 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 17832d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17842d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.TargetBB); 17852d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(NextMBB); 17862d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1787475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), 17884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 17894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 17914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 17964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 17984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 17994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 18004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 18014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 18024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 18044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 18053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1806b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1807b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1808b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1809f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 18109fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1811fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1812fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1813fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 18146f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1815f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1816f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1817f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1818f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1819f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1820f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 182186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(&I, VMI->second); 1822f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 18239fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1824f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1825f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1826f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 18272d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 18282d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Drop into normal successor. 18292d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 18302d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(Return))); 1831b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1832b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1833b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1834b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1835b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 18365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1837b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1838dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1839b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1840b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1841b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1842dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1843dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1844dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1845dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 18464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1847dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 18485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1849b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1850b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1851b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1852b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1853b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1854b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1855b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1856b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1857b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1858b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1859b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1860b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1861b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1862b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1863b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1864b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1865b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 18665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1867b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1868b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1869b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 18705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1871b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1872b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1873b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1874b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1875b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1876b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1877b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1878b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1879b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1880b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1881b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1882b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1883b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 18840e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock()); 18850e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FallThrough); 1886b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1887b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1888b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1889b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 18905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 18915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 18925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 18935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 18945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 18955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 18965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 18975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 18985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 18995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 19005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 19025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1903b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1904b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1905b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1906b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1907b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1908b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1909b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1910b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1911b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1912b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1913b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1914b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1915dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1916dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1917b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1918b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 19197294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 19207232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen return !DisableJumpTables && 19217232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 19227232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 19237294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 19247294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1925b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1926dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1927b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1928b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1929b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1930dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1931dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1932dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 19345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 19355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 19375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 19385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 19395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1940dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19417294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1942dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1943dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 19455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1946dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1947dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 19495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 19504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 19515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1952b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1953b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1954dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1955b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1956b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1957b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1958b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1959b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1960b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1961b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1962b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1963b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1964b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1965b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1966b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1967b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1968b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 19690e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB); 19700e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, JumpTableBB); 1971b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1972b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1973b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1974b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 19754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1976b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1977b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1978b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1979b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 19805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 19815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 19825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 19835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 19855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 19865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 19875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 1988b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1989b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 1990b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 19915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 1992b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1993b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 19945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 1995b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 1996b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 1997b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 1998b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 1999b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 2000b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2001b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2002b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2003b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 2004b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 2005b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 2006b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2007b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 2008b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 2009f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 2010b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 2011b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 2012b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2013b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 2014b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2015b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 2016b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2017dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2018b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2019b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2020b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 2021b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 2022dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 2023b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 2024b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 2025b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 2026b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 2027b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 2028b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 2029b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2030b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 2031b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 2032b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 2033b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2034b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 2035b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 2036b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2037b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 2038b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 2039b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 2040b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2041b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 2042b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 2043b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 20445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 20455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 20464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 20475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 2048b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2049b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 2050b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 20515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 20525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 20535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 20545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 20555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 20575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 20584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 20594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 20604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 2061b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 20625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 20635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 20645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 20654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 2066b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 2067b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 206854e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 20694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 20704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 20714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 20724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 20734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 20744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 2075b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 20764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 20774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 2078b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 20815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 2082b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20837294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 20847294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 20857294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 20867294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 20877294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 20887294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 2089b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2090b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 2091b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 20925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 2093b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 2094b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2095b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 2096b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 2097b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 2098b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 2099b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 2100b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 2101b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 21025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 21035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 21045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 21055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 2106b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 21070e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB); 21080e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, TrueBB); 2109b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 2110b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2111b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2112b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 2113b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 2114b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 2115b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 2116b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 21175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 21185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 21195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 2120b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 21210e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 21220e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FalseBB); 2123b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 2124b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2125b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2126b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 2127b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 2128b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 21295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 21305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 2131b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2132b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2133b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 2134b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 2135b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 2136dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2137dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2138b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2139b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 21404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 21414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 21424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 21434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 21444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 21454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 21463ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 214783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned IntPtrBits = TLI.getPointerTy().getSizeInBits(); 21484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 21504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 21514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 21534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 21544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 21554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 21574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 21584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 21594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 21604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 21614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 21624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 21634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 21644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 21674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 21684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 21694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 21704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 21714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 21724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 21734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 21754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 21764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 21784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 21794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 21804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 21814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 21824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 21834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 21844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 21854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 2186ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 21874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 21884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 21894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 21904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 21914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 21934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 21944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 21964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 21974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 21984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 2199e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 22004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 22014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 22024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 22034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 22064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 22074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 22094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 22104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 22114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 22124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 22134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 22154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 22164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 22174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 22184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 22214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 22224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 2224e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 22254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 22264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 22304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 22324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 22344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 22354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 22364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 22384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 22404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 22414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 22424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 22434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22440e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 22450e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, CaseBB); 22464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 22474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 22484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 22494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 2252efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 22534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 22544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 22564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 22574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 22594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 22614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 22624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 226486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman/// Clusterify - Transform simple list of Cases into list of CaseRange's 22655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 22665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 22675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 22685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 22705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 22715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 22725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 22735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 22745502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 22755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2276b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 22775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 22795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 2280a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 2281a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 228227a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 22835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 22845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 22855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 22865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 22875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 22895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 22905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 22915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 22925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 22935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 22945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 22955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 22965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 22975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 22995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 23005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 23015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 23025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 23035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 23055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 23065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 2308f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 2309f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 2310f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 2311c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 23125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 2313d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 2314f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 2315f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 23165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 2317f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 2318c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2319f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 23202d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Default); 2321d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 232286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 2323d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 23242d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 2325f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 2326f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2327f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 2328f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 2329f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 2330f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 23315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 23325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 23335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 23345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 2335c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2336f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 2337f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 2338f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 23395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 234037efe6764568a3829fee26aba532283131d1a104Nate Begeman 23413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 2342b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 23433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 23443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 23453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 23463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 23473a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 23483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 23493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 23504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 23514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 23524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23533a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 23543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 2355dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 2356dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2357dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 23584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 23593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 23603a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2361dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2362dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2363dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2364dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2365dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2366dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2367f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2368f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2369f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 23703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2371b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2372b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 237324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 23749d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 23757f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 23767f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 23777f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2378c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2379c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 23809e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2381c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2382c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2383475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2384c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2385c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2386c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 23877f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23887f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23897f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23907f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 239101b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 23929e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 2393475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 239401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 239501b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 239601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 23977f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 23987f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 23997f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2400b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2401b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 24027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 2403475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2404475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 240524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 240624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 24071628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 24081628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2409e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2410475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2411475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 24125bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman if (!isa<VectorType>(I.getType())) { 24135bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman if (TLI.getShiftAmountTy().bitsLT(Op2.getValueType())) 24145bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 24155bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman else if (TLI.getShiftAmountTy().bitsGT(Op2.getValueType())) 24165bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 24175bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman } 2418e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 24191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 24201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 242245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2423e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2424e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2425e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2426e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2427e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2428475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2429475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 243045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2431e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 243245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 243345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 243445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 243545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 243645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 243745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 243845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 243945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 244045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 244145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 244245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 244345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 244445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 244545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 244645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 244745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 244845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 244945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 245045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2451e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2452e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2453e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2454e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2455e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2456475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2457475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2458e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2459e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2460e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2461e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2462e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2463e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2464e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2465e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2466e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2467cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2468cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2469e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2470e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2471e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2472e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2473e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2474e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2475e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 247645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 247745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2478e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 247945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 248045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2481e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2482e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2483e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2484e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2485e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 24861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2488b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVICmp(User &I) { 2489b43e9c196542acc80c9e4643809661065710848fNate Begeman ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2490b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VICmpInst *IC = dyn_cast<VICmpInst>(&I)) 2491b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = IC->getPredicate(); 2492b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2493b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = ICmpInst::Predicate(IC->getPredicate()); 2494475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2495475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2496b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Opcode; 2497b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2498b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 2499b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 2500b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 2501b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 2502b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 2503b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 2504b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 2505b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 2506b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 2507b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 2508b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2509b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid ICmp predicate value"); 2510b43e9c196542acc80c9e4643809661065710848fNate Begeman Opcode = ISD::SETEQ; 2511b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2512b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2513b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(Op1.getValueType(), Op1, Op2, Opcode)); 2514b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2515b43e9c196542acc80c9e4643809661065710848fNate Begeman 2516b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVFCmp(User &I) { 2517b43e9c196542acc80c9e4643809661065710848fNate Begeman FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2518b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VFCmpInst *FC = dyn_cast<VFCmpInst>(&I)) 2519b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FC->getPredicate(); 2520b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2521b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FCmpInst::Predicate(FC->getPredicate()); 2522475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2523475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2524b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Condition, FOC, FPC; 2525b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2526b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2527b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2528b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2529b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2530b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2531b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2532b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2533b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2534b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2535b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2536b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2537b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2538b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2539b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2540b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2541b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 2542b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2543b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid VFCmp predicate value"); 2544b43e9c196542acc80c9e4643809661065710848fNate Begeman FOC = FPC = ISD::SETFALSE; 2545b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2546b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2547b43e9c196542acc80c9e4643809661065710848fNate Begeman if (FiniteOnlyFPMath()) 2548b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FOC; 2549b43e9c196542acc80c9e4643809661065710848fNate Begeman else 2550b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FPC; 2551b43e9c196542acc80c9e4643809661065710848fNate Begeman 255283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2553b43e9c196542acc80c9e4643809661065710848fNate Begeman 2554b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(DestVT, Op1, Op2, Condition)); 2555b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2556b43e9c196542acc80c9e4643809661065710848fNate Begeman 25571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 2558475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Cond = getValue(I.getOperand(0)); 2559475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue TrueVal = getValue(I.getOperand(1)); 2560475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue FalseVal = getValue(I.getOperand(2)); 25617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 25627f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 25631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 25673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 2568475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 256983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 25713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 25743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 25753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 2576475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 257783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 25793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 25823da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 25833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 2584475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 258583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 25873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 25903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 2591475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 259283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25930bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0))); 25943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 25973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 2598475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 259983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 26013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 26043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 2605475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 260683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 26083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 26113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 2612475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 261383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 26153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 26183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 2619475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 262083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 26223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 26253da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 2626475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 262783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 26293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 26323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 26333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 2634475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 263583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 263683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2637475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Result; 26388e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 26393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 26403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 26423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 26433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 26443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 26473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 26483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 2649475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 265083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 265183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26528e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 26533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 26543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 26563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 26573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26583da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 2660475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 266183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 26643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 26653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 26663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 26673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 26691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26712bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2672475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVec = getValue(I.getOperand(0)); 2673475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVal = getValue(I.getOperand(1)); 2674475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2675c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2676c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26777f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 26787f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 26797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2680c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2681c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26822bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2683475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVec = getValue(I.getOperand(0)); 2684475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2685384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 26867f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2687384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2688384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2689c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26903e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 2691475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V1 = getValue(I.getOperand(0)); 2692475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V2 = getValue(I.getOperand(1)); 2693475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Mask = getValue(I.getOperand(2)); 26943e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 26957f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 26967f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 26977f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 26983e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 26993e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27001d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitInsertValue(InsertValueInst &I) { 27011d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 27021d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op1 = I.getOperand(1); 27031d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = I.getType(); 27041d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = Op1->getType(); 27051d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool IntoUndef = isa<UndefValue>(Op0); 27061d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool FromUndef = isa<UndefValue>(Op1); 27071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27081d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 27091d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 27101d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27111d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> AggValueVTs; 27121d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, AggTy, AggValueVTs); 27131d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 27141d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 27151d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumAggValues = AggValueVTs.size(); 27171d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 2718475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumAggValues); 27191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2720475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Agg = getValue(Op0); 2721475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = getValue(Op1); 27221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned i = 0; 27231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy the beginning value(s) from the original aggregate. 27241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex; ++i) 27251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2726475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy values from the inserted value(s). 27281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex + NumValValues; ++i) 27291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = FromUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2730475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Val.Val, Val.ResNo + i - LinearIndex); 27311d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy remaining value(s) from the original aggregate. 27321d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != NumAggValues; ++i) 27331d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2734475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27351d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2736f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&AggValueVTs[0], NumAggValues), 2737f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumAggValues)); 2738041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2739041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 27401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitExtractValue(ExtractValueInst &I) { 27411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 27421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = Op0->getType(); 27431d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = I.getType(); 27441d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool OutOfUndef = isa<UndefValue>(Op0); 27451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 27471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 27481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 27501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 27511d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27521d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 2753475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumValValues); 27541d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2755475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Agg = getValue(Op0); 27561d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy out the selected value(s). 27571d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i) 27581d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i - LinearIndex] = 2759dded0fd398bf744454b2c9c95b68f4a27025f880Dan Gohman OutOfUndef ? DAG.getNode(ISD::UNDEF, Agg.Val->getValueType(Agg.ResNo + i)) : 2760475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27611d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2762f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValValueVTs[0], NumValValues), 2763f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValValues)); 2764041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2765041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 27663e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 2768475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 27691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 27701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 27721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 27731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2774c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2775b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 27761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 27771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2778b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 27791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 27800bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offset)); 27811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 27821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 27831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 27841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 27857c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27867c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 27877c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2788b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 278947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2790a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 27910bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 27920bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offs)); 27937c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 27947c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 27957c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27967c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2797a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 2798475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue IdxN = getValue(Idx); 27997c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 28007c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 28017c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 28028e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IdxN.getValueType().bitsLT(N.getValueType())) { 280347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 28048e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands } else if (IdxN.getValueType().bitsGT(N.getValueType())) 28057c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 28067c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 28077c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 28087c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 28097c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (isPowerOf2_64(ElementSize)) { 28107c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner unsigned Amt = Log2_64(ElementSize); 28117c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 28126b2d69655ace2788b244c8a4ebcfb6f2a926ad92Chris Lattner DAG.getConstant(Amt, TLI.getShiftAmountTy())); 28131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 28147c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 28151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28167c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 2817475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Scale = DAG.getIntPtrConstant(ElementSize); 28187c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 28197c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 28201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 28231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 28261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 28271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 28281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 28291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 28301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2832514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 283358092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2834d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 283558092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 28361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2837475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AllocSize = getValue(I.getArraySize()); 283883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 28398e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(AllocSize.getValueType())) 284068cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 28418e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(AllocSize.getValueType())) 284268cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 28431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 284468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 28450bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(TySize)); 28461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28474515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 28484515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 28494515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 28501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 28511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 28524515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 28531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 28544515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 28554515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 28564515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 28574515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 28580bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(StackAlign-1)); 28594515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 28604515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 28610bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 28621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2863475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 286483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2865f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2866475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 28670da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 28680da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 28691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 28711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 28721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 28731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 28768a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Value *SV = I.getOperand(0); 2877475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ptr = getValue(SV); 28788a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 28798a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Type *Ty = I.getType(); 28808a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman bool isVolatile = I.isVolatile(); 28818a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned Alignment = I.getAlignment(); 28828a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 28838a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<MVT, 4> ValueVTs; 28848a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<uint64_t, 4> Offsets; 28858a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets); 28868a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned NumValues = ValueVTs.size(); 28878a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 28888a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 2889edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2890475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root; 28918b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman bool ConstantMemory = false; 2892d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 28938b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman // Serialize volatile loads with other side effects. 2894d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 28958b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman else if (AA.pointsToConstantMemory(SV)) { 28968b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman // Do not serialize (non-volatile) loads of constant memory with anything. 28978b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman Root = DAG.getEntryNode(); 28988b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman ConstantMemory = true; 28998b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman } else { 2900d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2901d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2902d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 290328b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2904475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumValues); 2905475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Chains(NumValues); 29061d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 29071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) { 2908475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getLoad(ValueVTs[i], Root, 29091d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 29101d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 29111d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SV, Offsets[i], 29121d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 29131d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = L; 29141d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Chains[i] = L.getValue(1); 29151d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 29161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29178b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman if (!ConstantMemory) { 2918475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 29198b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman &Chains[0], NumValues); 29208b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman if (isVolatile) 29218b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman DAG.setRoot(Chain); 29228b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman else 29238b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman PendingLoads.push_back(Chain); 29248b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman } 29251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2926f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], NumValues), 2927f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValues)); 29281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 29321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 29331d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Value *PtrV = I.getOperand(1); 29341d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29351d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValueVTs; 29361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<uint64_t, 4> Offsets; 29371d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets); 29381d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValues = ValueVTs.size(); 29398a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 29408a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 29411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 294290d33ee746f354030a4144c4ffa028599663615bDan Gohman // Get the lowered operands. Note that we do this after 294390d33ee746f354030a4144c4ffa028599663615bDan Gohman // checking if NumResults is zero, because with zero results 294490d33ee746f354030a4144c4ffa028599663615bDan Gohman // the operands won't have values in the map. 294590d33ee746f354030a4144c4ffa028599663615bDan Gohman SDValue Src = getValue(SrcV); 294690d33ee746f354030a4144c4ffa028599663615bDan Gohman SDValue Ptr = getValue(PtrV); 294790d33ee746f354030a4144c4ffa028599663615bDan Gohman 2948475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 2949475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Chains(NumValues); 29501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 29511d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool isVolatile = I.isVolatile(); 29521d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned Alignment = I.getAlignment(); 29531d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) 2954475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Chains[i] = DAG.getStore(Root, SDValue(Src.Val, Src.ResNo + i), 29551d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 29561d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 29571d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman PtrV, Offsets[i], 29581d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 29591d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29601d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumValues)); 29611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29630eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 29640eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 29650eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 29660eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 2967a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 2968a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2969a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 29700eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2971475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops; 2972e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2973e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2974e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2975e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2976e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2977e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2978e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2979e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 29800eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29810eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 29820eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 29830eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29840eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 29850eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 2986475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getValue(I.getOperand(i)); 29870eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 29880eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 29890eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 29900eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 29910eade319cdb72e24c11d068728a98083737c6435Chris Lattner 299283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands std::vector<MVT> VTs; 29930eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 299483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(I.getType()); 299583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (VT.isVector()) { 29969d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 299783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(DestTy->getElementType()); 29980eade319cdb72e24c11d068728a98083737c6435Chris Lattner 299983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands VT = MVT::getVectorVT(EltVT, DestTy->getNumElements()); 30000eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 30010eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30020eade319cdb72e24c11d068728a98083737c6435Chris Lattner 30030eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 30040eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 30050eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30060eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 30070eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 30080eade319cdb72e24c11d068728a98083737c6435Chris Lattner 300983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTList = DAG.getNodeValueTypes(VTs); 3010f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 30110eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 3012475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Result; 301348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 3014f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 3015f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 301648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 3017f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 3018f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 301948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 3020f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 3021f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 302248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 3023e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 3024475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = Result.getValue(Result.Val->getNumValues()-1); 3025e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 3026e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 3027e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 3028e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 3029e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 30300eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 30319d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 303283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(PTy); 30337f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 30340eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30350eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 30360eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30370eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 30380eade319cdb72e24c11d068728a98083737c6435Chris Lattner 3039b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 3040cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 30410b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov V = V->stripPointerCasts(); 3042b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 30434c71dfe356716e6bc1993ef5efdced08b68fe612Anton Korobeynikov assert ((GV || isa<ConstantPointerNull>(V)) && 3044cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 3045cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 3046cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 3047cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3048f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 3049cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 3050f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 3051f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 3052f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 3053f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 3054f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 3055f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 3056f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 3057f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 3058f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3059f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 3060f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 3061f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 3062cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 3063cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3064cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 3065cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 3066cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 30676590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 3068cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 3069cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3070cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 3071cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 3072cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 3073cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3074cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3075cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 3076cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3077cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 30786590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 30796590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 30806590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 30816590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 30826590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 30836590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 30846590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 30856590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 30866590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 30876590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 30886590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 3089cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3090cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 3091cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3092f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 3093cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3094cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 3095cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 3096cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 3097cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3098f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3099cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3100f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 3101f40708223e409a152834b1553c6883ff2035b957Duncan Sands 310263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 310363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang/// Inlined utility function to implement binary input atomic intrinsics for 310463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// visitIntrinsicCall: I is a call instruction 310563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// Op is the associated NodeType for I 310663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangconst char * 310763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P WangSelectionDAGLowering::implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op) { 3108475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3109475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getAtomic(Op, Root, 311063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang getValue(I.getOperand(1)), 3111fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(2)), 311228873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 311363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang setValue(&I, L); 311463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang DAG.setRoot(L.getValue(1)); 311563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return 0; 311663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang} 311763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 3118c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 3119c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 3120c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 3121c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 3122c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 3123c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 31240eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 31250eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 31260eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 31270eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 3128c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 3129c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 3130c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 3131bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 3132bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 3133bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3134bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3135bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 3136bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 3137bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3138bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3139c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 3140d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 3141c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 3142c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 3143d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 3144c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 314503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 3146707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memcpy_i64: { 3147475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3148475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3149475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3150707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3151707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3152707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 315303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3154707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 315503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 3156707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memset_i64: { 3157475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3158475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3159475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3160707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3161707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align, 3162707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0)); 316303dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3164707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 316503dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 3166707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memmove_i64: { 3167475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3168475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3169475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3170707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3171707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3172707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // If the source and destination are known to not be aliases, we can 3173707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // lower memmove as memcpy. 3174707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman uint64_t Size = -1ULL; 3175707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 3176707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman Size = C->getValue(); 3177707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 3178707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman AliasAnalysis::NoAlias) { 3179707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3180707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 3181707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman return 0; 3182707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 3183707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3184707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align, 3185707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 318603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3187707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 318886cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 318944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 319043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 319144c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 319244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 3193ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 31947f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman DAG.setRoot(DAG.getDbgStopPoint(getRoot(), 31957f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getLine(), 31967f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getColumn(), 31977f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman cast<CompileUnitDesc>(DD))); 319886cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 319943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3200b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 320136ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 320243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 320344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 320443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 320544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 320644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 32074406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 320843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 320943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3210b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 321143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 321243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 321344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 321443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 321544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 321644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 32174406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 321843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 321943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3220b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 322143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 322243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 322344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 32241b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (!MMI) return 0; 322543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 32261b08bbca5592351a940bcd164bdec724ee954326Evan Cheng Value *SP = FSI.getSubprogram(); 32271b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (SP && MMI->Verify(SP)) { 32281b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is 32291b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // what (most?) gdb expects. 32301b08bbca5592351a940bcd164bdec724ee954326Evan Cheng DebugInfoDesc *DD = MMI->getDescFor(SP); 32311b08bbca5592351a940bcd164bdec724ee954326Evan Cheng assert(DD && "Not a debug information descriptor"); 32321b08bbca5592351a940bcd164bdec724ee954326Evan Cheng SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD); 32331b08bbca5592351a940bcd164bdec724ee954326Evan Cheng const CompileUnitDesc *CompileUnit = Subprogram->getFile(); 323499fe47bc81d53762454ff112ab34378b00299b5aDan Gohman unsigned SrcFile = MMI->RecordSource(CompileUnit); 32351b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // Record the source line but does create a label. It will be emitted 32361b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // at asm emission time. 32371b08bbca5592351a940bcd164bdec724ee954326Evan Cheng MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile); 323843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 323943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3240b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 324143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 324243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 324344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 324443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 3245a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng Value *Variable = DI.getVariable(); 3246a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng if (MMI && Variable && MMI->Verify(Variable)) 3247a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(), 3248a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng getValue(DI.getAddress()), getValue(Variable))); 324943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 325043970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 3251c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3252b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 32531532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (!CurMBB->isLandingPad()) { 32541532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // FIXME: Mark exception register as live in. Hack for PR1508. 32551532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen unsigned Reg = TLI.getExceptionAddressRegister(); 32561532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (Reg) CurMBB->addLiveIn(Reg); 3257735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 32581532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Insert the EXCEPTIONADDR instruction. 32591532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 3260475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[1]; 32611532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Ops[0] = DAG.getRoot(); 3262475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 32631532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, Op); 32641532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.setRoot(Op.getValue(1)); 3265b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3266b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3267b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 32688806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 32698806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 3270b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 327183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 32728806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 32738806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 32741532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 3275f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 3276f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 3277e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 3278f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 3279f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 3280f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 3281902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 3282902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 3283902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 3284e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 3285735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3286735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 32878806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 3288475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[2]; 3289735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 3290735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 3291475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 3292735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 3293735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 32947a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 32958806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 3296b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3297b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3298b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3299b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 33008806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 33018806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 33028806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 3303b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 330483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 33058806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 3306735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3307735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 3308735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 3309cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 33103b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 3311735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 33128806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 33137a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 3314f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 33158806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 3316b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3317b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3318b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3319b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3320b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 33212365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 33222365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 33232365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33241532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 33252365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 33262365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 33272365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 332886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman getControlRoot(), 33292365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 33302365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 33312365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 33322365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 33332365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33342365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33352365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33362365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33372365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33382365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 33392365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 33402365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 33412365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33422365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33432365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33442365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33452365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33462365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 334783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = getValue(I.getOperand(1)).getValueType(); 3348475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CfaArg; 33498e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 33501532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::TRUNCATE, 33511532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 33521532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen else 33531532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 33541532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 33551532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen 3356475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Offset = DAG.getNode(ISD::ADD, 33571532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33581532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 33591532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy()), 33601532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg); 33611532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, DAG.getNode(ISD::ADD, 33621532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33631532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAMEADDR, 33641532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33651532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getConstant(0, 33661532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy())), 33671532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Offset)); 33682365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33692365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33702365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33719ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 3372c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 3373c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 3374c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 3375c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 33769ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 33776ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 33786ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 33796ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 33806ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 33816ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 3382ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 3383ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 3384ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3385ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3386ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3387ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 3388ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 3389ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3390ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3391ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3392ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 3393ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 3394ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3395ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 3396ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 3397ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3398c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 3399475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 3400c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 3401c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3402c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 34038b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 3404475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getRoot(); 3405475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 3406f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 3407f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 34088b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 34098b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 341051b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 34118b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 3412c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 34133f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 3414f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 3415f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 3416f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 3417f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 3418f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 3419f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 34203f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 3421addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 3422a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 3423d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 3424d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 3425d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 3426d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 3427a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 3428475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 342983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3430475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTTZ, Ty, Arg); 3431a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3432c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3433a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3434a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 3435475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 343683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3437475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTLZ, Ty, Arg); 3438a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3439c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3440a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3441a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 3442475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 344383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3444475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTPOP, Ty, Arg); 3445a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3446c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3447a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3448140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 3449475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getRoot(); 3450475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::STACKSAVE, 3451f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 3452140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 3453140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 3454140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 3455140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 345639a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 3457475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 345839a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 3459140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 346039a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 346124e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 346224e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 346324e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 346436397f50343639ce9a25996f2d790c656791ab92Duncan Sands 346536397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 34660b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts()); 346736397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3468475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[6]; 346936397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 347036397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 347136397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 347236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 347336397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 347436397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 347536397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3476475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::TRAMPOLINE, 3477f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 3478f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 3479f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 3480f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 3481f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 3482f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 348336397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 348436397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 3485ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3486ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcroot: 3487ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (GCI) { 3488ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Value *Alloca = I.getOperand(1); 3489ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Constant *TypeMap = cast<Constant>(I.getOperand(2)); 3490ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3491ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val); 3492ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI->addStackRoot(FI->getIndex(), TypeMap); 3493ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen } 3494ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3495ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3496ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcread: 3497ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcwrite: 3498ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen assert(0 && "Collector failed to lower gcread/gcwrite intrinsics!"); 3499ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3500ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3501917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 35021a0248690aaa9f7baaf1247e5f65a1c0c9e3783cDan Gohman setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32)); 3503917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 3504917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 350566fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov 350666fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov case Intrinsic::trap: { 350766fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot())); 350866fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov return 0; 350966fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov } 351027b7db549e4c5bff4579d209304de5628513edebEvan Cheng case Intrinsic::prefetch: { 3511475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[4]; 351227b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[0] = getRoot(); 351327b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[1] = getValue(I.getOperand(1)); 351427b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[2] = getValue(I.getOperand(2)); 351527b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[3] = getValue(I.getOperand(3)); 351627b7db549e4c5bff4579d209304de5628513edebEvan Cheng DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4)); 351727b7db549e4c5bff4579d209304de5628513edebEvan Cheng return 0; 351827b7db549e4c5bff4579d209304de5628513edebEvan Cheng } 351927b7db549e4c5bff4579d209304de5628513edebEvan Cheng 352022c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth case Intrinsic::memory_barrier: { 3521475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[6]; 352222c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[0] = getRoot(); 352322c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth for (int x = 1; x < 6; ++x) 352422c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[x] = getValue(I.getOperand(x)); 352522c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth 352622c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6)); 352722c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth return 0; 352822c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth } 352928873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_cmp_swap: { 3530475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3531475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, Root, 3532ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3533ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(2)), 3534fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(3)), 353528873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 3536ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3537ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3538ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3539ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 354028873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_add: 354128873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD); 354228873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_sub: 354328873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB); 354463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_and: 354563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND); 354663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_or: 354763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR); 354863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_xor: 354963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR); 3550507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth case Intrinsic::atomic_load_nand: 3551507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND); 355263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_min: 355363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN); 355463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_max: 355563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX); 355663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umin: 355763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN); 355863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umax: 355963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX); 356063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_swap: 356163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP); 3562c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3563c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 3564c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3565c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3566475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDValue Callee, 35671da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 3568070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 35696f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 3570735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 3571070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 3572070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 35736f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3574735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 3575735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 35766f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 35776f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 35786f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 3579475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ArgNode = getValue(*i); 35806f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 35816f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 35826f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 35836f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 35846f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 35856f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 35866f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 35876f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 35886f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 358908e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen Entry.Alignment = CS.getParamAlignment(attrInd); 3590735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 3591735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 3592735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 35931532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3594070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 3595070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 3596070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 3597a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // Both PendingLoads and PendingExports must be flushed here; 3598a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // this call might not return. 3599a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen (void)getRoot(); 36004406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getControlRoot(), BeginLabel)); 3601070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 36026f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3603475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 36046f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 36056f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 360600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CS.paramHasAttr(0, ParamAttr::ZExt), 36076f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 3608735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 36096f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 36106f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 3611735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 3612070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 36131532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3614070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 3615070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 3616070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 36174406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getRoot(), EndLabel)); 3618070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 36196f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 3620070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 3621070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 3622735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 3623735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3624735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 36251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 362664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 3627c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 362887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3629c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3630c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3631c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3632c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 363387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 363487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 363587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 363687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 363787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 363887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 363987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 364087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 364187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 364287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 364387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 364487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 364587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 364687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 364787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 3648475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue LHS = getValue(I.getOperand(1)); 3649475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RHS = getValue(I.getOperand(2)); 365087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 365187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 365287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 365387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 365487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 365587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 36562f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 36572f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 365887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 365987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 366087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3661475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 366287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 366387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 366487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 366587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 366687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 36672f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 36682f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 366987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 367087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 367187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3672475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 367387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 367487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 367587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 367687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 367787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 36782f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 36792f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 368087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 368187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 368287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3683475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 368487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 368587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3686f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3687c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 368887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3689ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3690fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3691ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3692c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3693edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3694475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Callee; 369564e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 369664e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 369764e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 369864e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3699070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 37006f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 37011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3703735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3704b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3705b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3706b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3707b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3708475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 3709475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, 3710475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue *Flag) const { 371123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Assemble the legal parts into the final values. 3712475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(ValueVTs.size()); 3713475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Parts; 37146833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 371523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Copy the legal parts from the registers. 371683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 371723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 371883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 371923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 37206833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Parts.resize(NumRegs); 372123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3722475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue P; 37236833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 37246833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT); 37256833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 37266833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag); 372723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman *Flag = P.getValue(2); 37286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 37296833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = P.getValue(1); 3730ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3731ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If the source register was virtual and if we know something about it, 3732ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // add an assert node. 3733ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) && 3734ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT.isInteger() && !RegisterVT.isVector()) { 3735ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister; 3736ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 3737ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FLI.LiveOutRegInfo.size() > SlotNo) { 3738ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo]; 3739ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3740ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned RegSize = RegisterVT.getSizeInBits(); 3741ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits = LOI.NumSignBits; 3742ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes(); 3743ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3744ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // FIXME: We capture more information than the dag can represent. For 3745ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // now, just use the tightest assertzext/assertsext possible. 3746ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner bool isSExt = true; 3747ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT FromVT(MVT::Other); 3748ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits == RegSize) 3749ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1 3750ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-1) 3751ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1 3752ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-8) 3753ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8 3754ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-9) 3755ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8 3756ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-16) 3757ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16 3758ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-17) 3759ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16 3760ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-32) 3761ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32 3762ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-33) 3763ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32 3764ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3765ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FromVT != MVT::Other) { 3766ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, 3767ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT, P, DAG.getValueType(FromVT)); 3768ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3769ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3770ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3771ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3772ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 377323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Parts[Part+i] = P; 377423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3775b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 377623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Values[Value] = getCopyFromParts(DAG, &Parts[Part], NumRegs, RegisterVT, 377723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ValueVT); 377823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumRegs; 377923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 37804bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands 3781f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands return DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], ValueVTs.size()), 3782f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], ValueVTs.size()); 3783b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3784b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3785b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3786b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 3787b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3788b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3789475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanvoid RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, 3790475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const { 3791b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 379223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = Regs.size(); 3793475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Parts(NumRegs); 37946833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 379583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 379623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumParts = TLI->getNumRegisters(ValueVT); 379783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 379823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 379923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman getCopyToParts(DAG, Val.getValue(Val.ResNo + Value), 380023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Parts[Part], NumParts, RegisterVT); 380123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumParts; 380223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3803b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3804b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 3805475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Chains(NumRegs); 380623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3807475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Part; 38086833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 38096833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 38106833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 38116833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag); 3812b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 38136833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 38146833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chains[i] = Part.getValue(0); 3815c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 38166833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 381733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng if (NumRegs == 1 || Flag) 381833bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is 381933bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // flagged to it. That is the CopyToReg nodes and the user are considered 382033bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // a single scheduling unit. If we create a TokenFactor and return it as 382133bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // chain, then the TokenFactor is both a predecessor (operand) of the 382233bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // user as well as a successor (the TF operands are flagged to the user). 382333bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c1, f1 = CopyToReg 382433bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c2, f2 = CopyToReg 382533bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c3 = TokenFactor c1, c2 382633bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // ... 382733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // = op c3, ..., f2 382833bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng Chain = Chains[NumRegs-1]; 38296833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else 38306833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 3831c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3832864635ad7b3046d3042311423071152c613961deChris Lattner 3833c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3834c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3835c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3836c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 3837475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> &Ops) const { 383883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 38394b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 38406833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) { 38416833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]); 384283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 38436833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned i = 0; i != NumRegs; ++i) 38446833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT)); 384523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3846c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3847864635ad7b3046d3042311423071152c613961deChris Lattner 3848864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3849864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3850864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3851864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 38529b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 38536f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetLowering &TLI, 38546f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI) { 385583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT FoundVT = MVT::Other; 3856f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 38576f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 38586f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman E = TRI->regclass_end(); RCI != E; ++RCI) { 385983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::Other; 3860f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 38619b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 38629b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 38639b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 38649b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 38659b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 38669b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3867f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3868f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3869f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 38708e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) { 3871f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3872f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3873f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 38749b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 38759b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 38769b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3877f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 38789b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3879864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3880864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3881864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3882864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 38839b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 38849b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3885f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3886f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3887f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3888f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3889f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3890f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3891f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3892864635ad7b3046d3042311423071152c613961deChris Lattner } 3893f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3894864635ad7b3046d3042311423071152c613961deChris Lattner} 3895864635ad7b3046d3042311423071152c613961deChris Lattner 3896bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3897bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3898bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3899bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 39005c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengstruct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo { 39015c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// CallOperand - If this is the result output operand or a clobber 39025c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// this is null, otherwise it is the incoming operand to the CallInst. 39035c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// This gets modified as the asm is processed. 3904475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CallOperand; 39055c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng 3906e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3907e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3908e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3909e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 391023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 39115c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 3912bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3913bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3914e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3915e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3916e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3917e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 39187cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner std::set<unsigned> &InputRegs, 39197cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) const { 39207cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isOutReg) { 39217cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 39227cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 39237cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39247cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isInReg) { 39257cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 39267cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 39277cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39287cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39297cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner 39307cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattnerprivate: 39317cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// MarkRegAndAliases - Mark the specified register and all aliases in the 39327cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// specified set. 39337cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 39347cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) { 39357cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 39367cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(Reg); 39377cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 39387cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (; *Aliases; ++Aliases) 39397cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(*Aliases); 39407cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 3941bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3942bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3943bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3944bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 39450fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// GetRegistersForValue - Assign registers (virtual or physical) for the 39460fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// specified operand. We prefer to assign virtual registers, to allow the 39470fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// register allocator handle the assignment process. However, if the asm uses 39480fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// features that we can't model on machineinstrs, we have SDISel do the 39490fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// allocation. This produces generally horrible, but correct, code. 39500fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 39510fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// OpInfo describes the operand. 39520fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// HasEarlyClobber is true if there are any early clobber constraints (=&r) 39530fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// or any explicitly clobbered registers. 39540fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// Input and OutputRegs are the set of already allocated physical registers. 39550fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 3956e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 39575c80760fdf71659c5bdf45cd85d173df454dfb41Evan ChengGetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 3958864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 39594e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3960e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3961e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3962e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3963e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3964e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3965e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3966e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3967e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3968e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3969e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3970e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3971e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3972e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3973e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3974e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3975e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3976e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3977e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3978e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3979e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3980e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3981e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3982e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3983e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3984e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3985b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SmallVector<unsigned, 4> Regs; 3986e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3987e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 3988e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 3989e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 3990e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 3991e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 3992864635ad7b3046d3042311423071152c613961deChris Lattner 3993bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 3994bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 3995b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 399683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegVT; 399783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = OpInfo.ConstraintVT; 3998864635ad7b3046d3042311423071152c613961deChris Lattner 3999bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 40002a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 40012a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 4002864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 4003bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 4004864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 4005cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 4006cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 4007cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 4008cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 4009cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 4010864635ad7b3046d3042311423071152c613961deChris Lattner 4011864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 4012864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 4013864635ad7b3046d3042311423071152c613961deChris Lattner 4014864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 4015864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 4016864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 4017864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 401850871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Didn't find reg!"); 4019864635ad7b3046d3042311423071152c613961deChris Lattner 4020864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 4021864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 4022864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 402350871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Ran out of registers to allocate!"); 4024864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 4025864635ad7b3046d3042311423071152c613961deChris Lattner } 4026864635ad7b3046d3042311423071152c613961deChris Lattner } 402723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 40287cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 40297cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4030e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4031864635ad7b3046d3042311423071152c613961deChris Lattner } 4032864635ad7b3046d3042311423071152c613961deChris Lattner 40332a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 40342a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 40352a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 4036c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 4037c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 40382a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 40392a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 40402a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 4041e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 4042e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 4043e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 4044e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 4045e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 40462a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 40473a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 4048bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 40493a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 40502a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40512a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 405284bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo = MF.getRegInfo(); 40532a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 405484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second)); 40552a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 405623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 4057e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 40582a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 40592a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 40612a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 40622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 40632a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40642a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 40652a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 40662a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 40672a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 4068bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 4069bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 40702a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 4071e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 40726f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 4073864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 4074864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 4075864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 40764e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 4077864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 4078864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 4079864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 4080864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 4081864635ad7b3046d3042311423071152c613961deChris Lattner continue; 4082864635ad7b3046d3042311423071152c613961deChris Lattner } 4083864635ad7b3046d3042311423071152c613961deChris Lattner 40844e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 40854e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 4086c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 40876f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman RC = isAllocatableRegister(Reg, MF, TLI, TRI); 4088c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 4089c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 4090c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 4091c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 4092c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 40934e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 40944e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 4095864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 4096864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 4097864635ad7b3046d3042311423071152c613961deChris Lattner 4098e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 4099864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 4100864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 4101864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 4102864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 4103e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 4104e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 4105864635ad7b3046d3042311423071152c613961deChris Lattner 410623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(), 4107e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 41087cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4109e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4110864635ad7b3046d3042311423071152c613961deChris Lattner } 41114e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 4112864635ad7b3046d3042311423071152c613961deChris Lattner 4113864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 41144e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 41154e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 41163ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 4117ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 4118ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 4119fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 4120fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 4121ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41220c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 41235c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng std::vector<SDISelAsmOperandInfo> ConstraintOperands; 4124ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4125475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = getRoot(); 4126475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Flag; 4127ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41284e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 41290c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 41300c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 41310c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 41320c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 41330c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 4134e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4135e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 4136e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 4137e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 4138e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 4139e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4140fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 4141acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner unsigned ResNo = 0; // ResNo - The result number of the next output. 41420c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 41435c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 41445c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 41450c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 414683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OpVT = MVT::Other; 41471efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 41480c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 41490c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 41501efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 4151acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // Indirect outputs just consume an argument. 4152acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (OpInfo.isIndirect) { 4153fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 4154acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner break; 4155acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } 4156acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // The return value of the call is this value. As such, there is no 4157acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // corresponding argument. 4158acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 4159acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (const StructType *STy = dyn_cast<StructType>(CS.getType())) { 4160acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(STy->getElementType(ResNo)); 4161acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } else { 4162acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(ResNo == 0 && "Asm only has one result!"); 4163acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(CS.getType()); 41641efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 4165acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner ++ResNo; 41661efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41671efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 4168fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 41691efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41701efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 41710c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 41721efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41731efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 41740c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 41750c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 4176eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 41770c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 4178507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) 4179507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]); 4180eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 4181eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 4182eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 4183eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 4184eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 4185eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 4186eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 4187eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 41884fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman // If OpTy is not a single value, it may be a struct/union that we 4189eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 41904fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman if (!OpTy->isSingleValueType() && OpTy->isSized()) { 4191eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 4192eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 4193eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 4194eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 4195eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 4196eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 4197eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 4198eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 4199eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 4200eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 4201eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 42026995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 4203eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 4204eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 42050c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42060c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42071efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 42080c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 42092a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 42103ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 42115a09690446a36f94f990db7d18d9b9ac8587888aChris Lattner TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG); 42121efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 4213e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 4214e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 421509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 42160fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner // If we see a clobber of a register, it is an early clobber. 421769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (!SawEarlyClobber && 421869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.Type == InlineAsm::isClobber && 421969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) { 422069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // Note that we want to ignore things that we don't trick here, like 422169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // dirflag, fpsr, flags, etc. 422269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 422369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 422469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintVT); 422569e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (PhysReg.first || PhysReg.second) { 422669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // This is a register we know of. 422769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner SawEarlyClobber = true; 422869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 422969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 42300fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner 423109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 423209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 423309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 423409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 423509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 423609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 423709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 423809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 423909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 424009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 424109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 424209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 424309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 424409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 424509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 424609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 424709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 424809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 424909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 425009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 425109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 425209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 4253514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 425409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 425509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 425609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 4257475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 425809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 425909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 426009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 426109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 426209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 426309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 426409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 426509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 426609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 426709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 4268e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 4269e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 4270e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 4271e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 42720c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42730c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 42740c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 42750c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 4276e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 4277e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 4278e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 42795c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 4280e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4281e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 4282e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 4283e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 4284e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 4285e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 4286e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 42870c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 4288475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> AsmNodeOperands; 4289475871a144eb604ddaf37503397ba0941442e5fbDan Gohman AsmNodeOperands.push_back(SDValue()); // reserve space for input chain 42900c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 42910c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 42920c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 42932cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 42940f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 42950f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 4296864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 429741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 42980c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 4299864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 43000f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 43010c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 43025c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 43031efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 43040c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 43052cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 4306c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 4307c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 4308f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 430909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 431022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 431122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 431222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4313c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4314c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 431509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 431622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 431722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 431822873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 43192a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 432022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 4321864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 4322864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 4323e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 4324a47c6c37034f4e57bc8187e959da4eadb6e24afaDuncan Sands cerr << "Couldn't allocate output reg for constraint '" 43250c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 4326d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 4327d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 43282cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 432941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // If this is an indirect operand, store through the pointer after the 433041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // asm. 433141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner if (OpInfo.isIndirect) { 4332e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 43330c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 433441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } else { 433541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // This is the result value of the call. 433641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 433741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // Concatenate this output onto the outputs list. 433841f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RetValRegs.append(OpInfo.AssignedRegs); 43392cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 43406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 43416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 43426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 4343e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 4344e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 43456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 43466656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 43476656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 4348475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InOperandVal = OpInfo.CallOperand; 43493d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 43500c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 43512223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 43522223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 43530c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 43543d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 4355c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 4356c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 4357c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 4358c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 4359c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 4360c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4361c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4362a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 4363a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 4364c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 4365c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 4366c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 4367c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4368c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4369c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4370527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 4371527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 4372527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 437323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.TLI = &TLI; 43741fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType()); 43751fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.RegVTs.push_back(AsmNodeOperands[CurOp+1].getValueType()); 4376527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 4377527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 4378527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 4379527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 4380527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 4381c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4382527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 4383b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 4384527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 4385527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 4386527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 4387527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 4388f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner assert((NumOps >> 3) == 1 && "Unexpected number of operands"); 4389f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner // Add information to the INLINEASM node to know about this input. 4390f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4391f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4392f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner TLI.getPointerTy())); 4393f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 4394f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner break; 4395c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 439687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 439787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 43982a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 43990c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 440044b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 440144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 4402475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> Ops; 440348884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 440448884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 440548884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 4406832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 44070c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 440853069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 440953069fbbae2558a3138df24776448791fea3aceeChris Lattner } 4410c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 441187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 441248884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 4413c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4414c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 441548884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 441687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 44172a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 441809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 441944b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 442044b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 442144b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 442287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 442387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4424c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4425c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 442687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 4427c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 44282223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 442987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 44302a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 44312a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 44322a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 44330c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 443444b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 443587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 443687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 4437e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 4438e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 443987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4440b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 444187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4442e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 4443e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 44446656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 44456656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4446c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 4447c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 4448c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 4449e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 4450e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 4451e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 44526656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 44536656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4454c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 44556656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4456ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4457ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 4458ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 4459ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 4460ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4461f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 4462f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 4463bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 4464ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 4465ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 44666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 44676656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 44683a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 4469475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 44703fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 44713fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // If any of the results of the inline asm is a vector, it may have the 44723fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // wrong width/num elts. This can happen for register classes that can 44733fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // contain multiple different value types. The preg or vreg allocated may 44743fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // not have the same VT as was expected. Convert it to the right type with 44757f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 44763fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner if (const StructType *ResSTy = dyn_cast<StructType>(CS.getType())) { 44773fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner for (unsigned i = 0, e = ResSTy->getNumElements(); i != e; ++i) { 447883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.Val->getValueType(i).isVector()) 44793fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, 44803fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner TLI.getValueType(ResSTy->getElementType(i)), Val); 44813fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } 44823fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } else { 448383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.getValueType().isVector()) 44843fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, TLI.getValueType(CS.getType()), 44853fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val); 44863a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 44873fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 4488fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 44893a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 44906656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 4491475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<std::pair<SDValue, Value*> > StoresToEmit; 44926656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 44936656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 44946656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 44956656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 4496864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 44976656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 4498475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 4499864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 45006656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4501ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 45026656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 4503475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> OutChains; 45046656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 45050c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 45066656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 45078b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 45086656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 4509bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 4510bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 4511ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 4512ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 4513ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4514ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 45151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 4516475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = getValue(I.getOperand(0)); 45171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 451883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 451968cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 45208e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(Src.getValueType())) 452168cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 45228e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(Src.getValueType())) 452368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 45241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 4526514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 45271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 45280bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner Src, DAG.getIntPtrConstant(ElementSize)); 45291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 453047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 453147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 453247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 453347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 453447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 4535cf5734dddd66af9388a171b44996505ede47feedChris Lattner 4536475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 453700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C, 453800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG); 4539cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 4540cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 45411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 454447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 454547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 454647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 454747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 454847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 454983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 4550475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 455100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, 455200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CallingConv::C, true, 4553cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 4554cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 45551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4557ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 4558ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 4559025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 4560025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 4561025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 4562ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 4563025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 4564832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 4565832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 4566ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng << "TargetLowering::EmitInstrWithCustomInserter!\n"; 4567025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 4568025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 4569025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 4570025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 457139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 4572acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 4573acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4574acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 457539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 457639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 45771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 4578475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 4579acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 4580acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 4581acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 4582acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 45831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 4586acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 4587acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4588acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 45891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 4592acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 4593acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4594acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 4595acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 4596acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 45971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4599fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 4600fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 4601f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 4602f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 4603a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohmanvoid TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG, 4604475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVectorImpl<SDValue> &ArgValues) { 4605fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 4606475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 3+16> Ops; 46078c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 4608fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 4609fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 4610fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4611fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 4612a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVector<MVT, 16> RetVals; 46136aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 4614ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 4615ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 4616f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4617f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4618f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4619f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4620f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4621f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4622f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4623f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4624f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4625f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4626f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ZExt)) 4627f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4628f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::SExt)) 4629f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4630f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::InReg)) 4631f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4632f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::StructRet)) 4633f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4634f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ByVal)) { 4635f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4636f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(I->getType()); 4637f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4638f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4639f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4640f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should be passed from FE. BE will guess if 4641f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // this info is not there but there are cases it cannot get right. 4642f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.getParamAlignment(j)) 4643f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = F.getParamAlignment(j); 4644f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4645f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4646f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4647f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::Nest)) 4648f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4649f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4650b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4651f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT RegisterVT = getRegisterType(VT); 4652f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4653f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 4654f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman RetVals.push_back(RegisterVT); 4655f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4656f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumRegs > 1 && i == 0) 4657f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4658f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4659f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i > 0) 4660f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4661f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4662f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4663b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 4664fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 46653b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 46668c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 4667fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4668fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 4669f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 467086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner DAG.getVTList(&RetVals[0], RetVals.size()), 4671bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 467286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 467386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but 467486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // allows exposing the loads that may be part of the argument access to the 467586ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // first DAGCombiner pass. 4676475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue TmpRes = LowerOperation(SDValue(Result, 0), DAG); 467786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 467886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // The number of results should match up, except that the lowered one may have 467986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // an extra flag result. 468086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner assert((Result->getNumValues() == TmpRes.Val->getNumValues() || 468186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner (Result->getNumValues()+1 == TmpRes.Val->getNumValues() && 468286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag)) 468386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner && "Lowering produced unexpected number of results!"); 46842dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman 46852dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman // The FORMAL_ARGUMENTS node itself is likely no longer needed. 46862dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman if (Result != TmpRes.Val && Result->use_empty()) { 46872dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman HandleSDNode Dummy(DAG.getRoot()); 46882dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman DAG.RemoveDeadNode(Result); 46892dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman } 46902dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman 469186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner Result = TmpRes.Val; 469286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 469327a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 4694475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DAG.setRoot(SDValue(Result, NumArgRegs)); 4695fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4696fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 4697fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 469847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 469947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 470047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 4701f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4702f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4703f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4704f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4705f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4706f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 4707f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4708f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 4709475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 4710f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned j = 0; j != NumParts; ++j) 4711475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Parts[j] = SDValue(Result, i++); 4712f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4713f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE; 4714f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(Idx, ParamAttr::SExt)) 4715f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertSext; 4716f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 4717f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertZext; 4718f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4719a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman ArgValues.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT, 4720a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman AssertOp)); 4721f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4722fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 472327a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 4724fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 4725fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4726f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4727f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 4728f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 4729f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 4730f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 4731475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstd::pair<SDValue, SDValue> 4732475871a144eb604ddaf37503397ba0941442e5fbDan GohmanTargetLowering::LowerCallTo(SDValue Chain, const Type *RetTy, 473300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands bool RetSExt, bool RetZExt, bool isVarArg, 473400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands unsigned CallingConv, bool isTailCall, 4735475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Callee, 4736f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4737475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 4738f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4739f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4740f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4741f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4742f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4743f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4744f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4745f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 4746f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4747f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, Args[i].Ty, ValueVTs); 4748f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4749f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4750f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4751f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4752475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = SDValue(Args[i].Node.Val, Args[i].Node.ResNo + Value); 4753f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4754f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4755f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4756f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4757f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isZExt) 4758f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4759f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 4760f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4761f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isInReg) 4762f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4763f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSRet) 4764f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4765f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isByVal) { 4766f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4767f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(Args[i].Ty); 4768f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4769f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4770f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4771f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should come from FE. BE will guess if this 4772f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // info is not there but there are cases it cannot get right. 4773f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].Alignment) 4774f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = Args[i].Alignment; 4775f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4776f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4777f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4778f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isNest) 4779f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4780f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4781f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4782f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 4783f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 4784475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 4785f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 4786f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4787f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 4788f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 4789f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (Args[i].isZExt) 4790f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 4791f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4792f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind); 4793f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4794f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumParts; ++i) { 4795f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4796f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4797f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumParts > 1 && i == 0) 4798f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4799f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i != 0) 4800f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4801f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4802f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(Parts[i]); 4803f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4804f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 480527a70be55f8b63181598d144d034b396402be66eDan Gohman } 4806f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4807f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4808ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Figure out the result value types. We start by making a list of 480923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // the potentially illegal return value types. 481083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> LoweredRetTys; 481183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RetTys; 481223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(*this, RetTy, RetTys); 4813ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 481423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Then we translate that to a list of legal types. 481523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 481683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 481783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 4818ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4819ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4820ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(RegisterVT); 4821ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4822f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4823ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(MVT::Other); // Always has a chain. 4824f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4825b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4826475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Res = DAG.getNode(ISD::CALL, 4827ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&LoweredRetTys[0], 4828ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.size()), 4829be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4830ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Chain = Res.getValue(LoweredRetTys.size() - 1); 4831b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4832b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4833b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 483400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 483500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 483600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands if (RetSExt) 483700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands AssertOp = ISD::AssertSext; 483800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands else if (RetZExt) 4839b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 484000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 4841475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> ReturnValues; 4842ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNo = 0; 484323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 484483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 484583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 4846ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4847ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNoEnd = NumRegs + RegNo; 4848475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Results; 4849ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (; RegNo != RegNoEnd; ++RegNo) 4850ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Results.push_back(Res.getValue(RegNo)); 4851475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ReturnValue = 4852ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, 4853ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman AssertOp); 4854ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman ReturnValues.push_back(ReturnValue); 4855ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4856f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands Res = DAG.getMergeValues(DAG.getVTList(&RetTys[0], RetTys.size()), 4857f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &ReturnValues[0], ReturnValues.size()); 4858f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4859b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4860b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4861f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4862f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4863475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) { 4864171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4865171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4866475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); 4867171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4868171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 48690aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 48707041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 48717041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 48727041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 48731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 487483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sandsunsigned SelectionDAGISel::MakeReg(MVT VT) { 487584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 48761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4878495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4879c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 4880ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen AU.addRequired<CollectorModuleMetadata>(); 4881c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4882495a0b51915eb763576874f29192820b731edc22Chris Lattner} 48831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 48855f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 48865f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 48875f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 48881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 4889ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen if (MF.getFunction()->hasCollector()) 4890ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = &getAnalysis<CollectorModuleMetadata>().get(*MF.getFunction()); 4891ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 4892ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen GCI = 0; 489384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner RegInfo = &MF.getRegInfo(); 4894832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 48951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 48971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48981532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 48991532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 49001532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 49011532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 49029fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 49030e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman SelectAllBasicBlocks(Fn, MF, FuncInfo); 4904edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4905ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4906ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4907ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 490884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner if (!RegInfo->livein_empty()) 490984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 491084bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner E = RegInfo->livein_end(); I != E; ++I) 4911ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4912ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4913f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4914f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4915f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4916f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4917f40708223e409a152834b1553c6883ff2035b957Duncan Sands 49181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 49191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 49201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49216833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattnervoid SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) { 4922475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getValue(V); 492318c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4924d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 492518c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 492686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 4927b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 492823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue RFV(TLI, Reg, V->getType()); 4929475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getEntryNode(); 493023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RFV.getCopyToRegs(Op, DAG, Chain, 0); 493123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman PendingExports.push_back(Chain); 49321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 49331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4934068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 493586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan GohmanLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) { 49361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 493715699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 49380afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4939475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OldRoot = SDL.DAG.getRoot(); 4940475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 16> Args; 4941a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman TLI.LowerArguments(F, SDL.DAG, Args); 4942bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4943bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4944bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4945f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AI != E; ++AI) { 4946f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4947f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(TLI, AI->getType(), ValueVTs); 4948f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumValues = ValueVTs.size(); 4949bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 49504bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands SDL.setValue(AI, SDL.DAG.getMergeValues(&Args[a], NumValues)); 4951bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4952bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4953251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4954251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 495586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(AI, VMI->second); 4956bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 49570afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4958f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman a += NumValues; 4959f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4960bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4961bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4962966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4963bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4964068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4965068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4966f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4967f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4968f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4969cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4970f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4971f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4972f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4973560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 4974560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 4975f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4976f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4977f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4978f40708223e409a152834b1553c6883ff2035b957Duncan Sands 497930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsFixedFrameObjectWithPosOffset - Check if object is a fixed frame object and 498030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// whether object offset >= 0. 498130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighoferstatic bool 4982475871a144eb604ddaf37503397ba0941442e5fbDan GohmanIsFixedFrameObjectWithPosOffset(MachineFrameInfo * MFI, SDValue Op) { 498330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isa<FrameIndexSDNode>(Op)) return false; 498430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 498530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer FrameIndexSDNode * FrameIdxNode = dyn_cast<FrameIndexSDNode>(Op); 498630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer int FrameIdx = FrameIdxNode->getIndex(); 498730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return MFI->isFixedObjectIndex(FrameIdx) && 498830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MFI->getObjectOffset(FrameIdx) >= 0; 498930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 499030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 499130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsPossiblyOverwrittenArgumentOfTailCall - Check if the operand could 499230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// possibly be overwritten when lowering the outgoing arguments in a tail 499330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// call. Currently the implementation of this call is very conservative and 499430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// assumes all arguments sourcing from FORMAL_ARGUMENTS or a CopyFromReg with 499530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// virtual registers would be overwritten by direct lowering. 4996475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstatic bool IsPossiblyOverwrittenArgumentOfTailCall(SDValue Op, 499730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo * MFI) { 499830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer RegisterSDNode * OpReg = NULL; 499930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Op.getOpcode() == ISD::FORMAL_ARGUMENTS || 500030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode()== ISD::CopyFromReg && 500130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg = dyn_cast<RegisterSDNode>(Op.getOperand(1))) && 500230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg->getReg() >= TargetRegisterInfo::FirstVirtualRegister)) || 500330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::LOAD && 500430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(1))) || 500530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::MERGE_VALUES && 500630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Op.getOperand(Op.ResNo).getOpcode() == ISD::LOAD && 500730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(Op.ResNo). 500830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getOperand(1)))) 500930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return true; 501030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return false; 501130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 501230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 5013c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 501448abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 5015c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 5016c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 5017c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 5018475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Terminator = DAG.getRoot(); 5019c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5020c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 5021c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 5022c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 5023c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5024c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5025c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 5026c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 50270e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman BI = DAG.allnodes_end(); BI != BE; ) { 50280e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman --BI; 5029c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 5030475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OpRet(Ret, 0); 5031475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OpCall(BI, 0); 5032c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 5033c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 5034c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 5035c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 503648abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 5037c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 503830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isMarkedTailCall) continue; 503930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Ret==NULL || 504030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG)) { 504130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Not eligible. Mark CALL node as non tail call. 5042475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5043c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 504430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer for(SDNode::op_iterator I =OpCall.Val->op_begin(), 504530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer E = OpCall.Val->op_end(); I != E; I++, idx++) { 5046c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 5047c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 504830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer else 5049c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 5050c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5051c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 505230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } else { 505330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Look for tail call clobbered arguments. Emit a series of 505430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // copyto/copyfrom virtual register nodes to protect them. 5055475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5056475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = OpCall.getOperand(0), InFlag; 505730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned idx=0; 505830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer for(SDNode::op_iterator I = OpCall.Val->op_begin(), 505930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer E = OpCall.Val->op_end(); I != E; I++, idx++) { 5060475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = *I; 506130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (idx > 4 && (idx % 2)) { 506230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer bool isByVal = cast<ARG_FLAGSSDNode>(OpCall.getOperand(idx+1))-> 506330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getArgFlags().isByVal(); 506430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFunction &MF = DAG.getMachineFunction(); 506530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo *MFI = MF.getFrameInfo(); 506630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isByVal && 506730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsPossiblyOverwrittenArgumentOfTailCall(Arg, MFI)) { 506883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = Arg.getValueType(); 506930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned VReg = MF.getRegInfo(). 507030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer createVirtualRegister(TLI.getRegClassFor(VT)); 507130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = DAG.getCopyToReg(Chain, VReg, Arg, InFlag); 507230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Chain.getValue(1); 507330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Arg = DAG.getCopyFromReg(Chain, VReg, VT, InFlag); 507430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = Arg.getValue(1); 507530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Arg.getValue(2); 507630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 507730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 507830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops.push_back(Arg); 507930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 508030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Link in chain of CopyTo/CopyFromReg. 508130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops[0] = Chain; 508230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 5083c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5084c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5085c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5086c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 5087c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5088068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel::BuildSelectionDAG(SelectionDAG &DAG, BasicBlock *LLVMBB, 5089068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 5090f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman FunctionLoweringInfo &FuncInfo) { 5091ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(DAG, TLI, *AA, FuncInfo, GCI); 5092068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 5093bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Lower any arguments needed in this block if this is the entry block. 5094ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman if (LLVMBB == &LLVMBB->getParent()->getEntryBlock()) 509586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman LowerArguments(LLVMBB, SDL); 50961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 50971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BB = FuncInfo.MBBMap[LLVMBB]; 50981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.setCurrentBasicBlock(BB); 50991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5100f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 51019fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 51021532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI && BB->isLandingPad()) { 5103f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Add a label to mark the beginning of the landing pad. Deletion of the 5104f40708223e409a152834b1553c6883ff2035b957Duncan Sands // landing pad can thus be detected via the MachineModuleInfo. 5105f40708223e409a152834b1553c6883ff2035b957Duncan Sands unsigned LabelID = MMI->addLandingPad(BB); 51064406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, DAG.getEntryNode(), LabelID)); 5107f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5108e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception register as live in. 5109e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng unsigned Reg = TLI.getExceptionAddressRegister(); 5110e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 5111e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 5112e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng // Mark exception selector register as live in. 5113e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng Reg = TLI.getExceptionSelectorRegister(); 5114e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng if (Reg) BB->addLiveIn(Reg); 5115e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng 5116f40708223e409a152834b1553c6883ff2035b957Duncan Sands // FIXME: Hack around an exception handling flaw (PR1508): the personality 5117f40708223e409a152834b1553c6883ff2035b957Duncan Sands // function and list of typeids logically belong to the invoke (or, if you 5118f40708223e409a152834b1553c6883ff2035b957Duncan Sands // like, the basic block containing the invoke), and need to be associated 5119f40708223e409a152834b1553c6883ff2035b957Duncan Sands // with it in the dwarf exception handling tables. Currently however the 5120cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // information is provided by an intrinsic (eh.selector) that can be moved 5121cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // to unexpected places by the optimizers: if the unwind edge is critical, 5122cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // then breaking it can result in the intrinsics being in the successor of 5123cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // the landing pad, not the landing pad itself. This results in exceptions 5124cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // not being caught because no typeids are associated with the invoke. 5125cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // This may not be the only way things can go wrong, but it is the only way 5126cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands // we try to work around for the moment. 5127f40708223e409a152834b1553c6883ff2035b957Duncan Sands BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 5128f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5129f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (Br && Br->isUnconditional()) { // Critical edge? 5130f40708223e409a152834b1553c6883ff2035b957Duncan Sands BasicBlock::iterator I, E; 5131f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 5132cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) 5133f40708223e409a152834b1553c6883ff2035b957Duncan Sands break; 5134f40708223e409a152834b1553c6883ff2035b957Duncan Sands 5135f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (I == E) 5136f40708223e409a152834b1553c6883ff2035b957Duncan Sands // No catch info found - try to extract some from the successor. 5137f40708223e409a152834b1553c6883ff2035b957Duncan Sands copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 51389fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 51399fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands } 51409fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 51411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower all of the non-terminator instructions. 51421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = --LLVMBB->end(); 51431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner I != E; ++I) 51441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SDL.visit(*I); 5145f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 51461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Ensure that all instructions which are used outside of their defining 5147f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // blocks are available as virtual registers. Invoke is handled elsewhere. 51481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = LLVMBB->begin(), E = LLVMBB->end(); I != E;++I) 5149f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 51509f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 51511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (VMI != FuncInfo.ValueMap.end()) 515286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(I, VMI->second); 51531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 51541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 51561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // ensure constants are generated when needed. Remember the virtual registers 51571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // that need to be added to the Machine PHI nodes as input. We cannot just 51581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // directly add them, because expansion might result in multiple MBB's for one 51591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // BB. As such, the start of the BB might correspond to a different MBB than 51601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the end. 5161edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman // 51628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 51631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 51651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 5166d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 51678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Vector bool would be better, but vector<bool> is really slow. 51688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner std::vector<unsigned char> SuccsHandled; 51698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 51708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 51718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 5172532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 5173532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 51741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 51751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 5176d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 51778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 5178d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 51798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 51808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 51818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 51828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 51838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 51848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 51858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 51861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 51871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 51891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 51901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 51911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 51928c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 51938c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 51948c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 51958c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 51968c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 51978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 51983f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 51998c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 52008c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 52018c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 52028c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 520386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(C, RegOut); 52041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 52058c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 52068c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 52078c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 52088c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 52098c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 52108c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 52118c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 52128c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 521386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(PHIOp, Reg); 52147e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 52151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 52168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 52178c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 52188c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 52196f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman SmallVector<MVT, 4> ValueVTs; 52206f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman ComputeValueVTs(TLI, PN->getType(), ValueVTs); 52216f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 52226f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman MVT VT = ValueVTs[vti]; 52236f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 52246f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 52256f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 52266f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman Reg += NumRegisters; 52276f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman } 52288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 52291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 52301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 52311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 5233f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 5234a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 5235f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 523637efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 5237f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 5238f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 52393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 52403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 52414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 52424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 52434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5244a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 524586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(SDL.getControlRoot()); 5246c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5247c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 5248c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 5249c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 5250c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 5251c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer CheckDAGForTailCallsAndFixThem(DAG, TLI); 52521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 52531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5254ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnervoid SelectionDAGISel::ComputeLiveOutVRegInfo(SelectionDAG &DAG) { 5255ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 5256ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 5257ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5258ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.push_back(DAG.getRoot().Val); 5259ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5260ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 5261ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 5262ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 5263ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5264ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner while (!Worklist.empty()) { 5265ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDNode *N = Worklist.back(); 5266ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.pop_back(); 5267ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5268ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 5269ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 5270ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5271ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5272ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 5273ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 5274ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOperand(i).getValueType() == MVT::Other) 5275ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.push_back(N->getOperand(i).Val); 5276ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5277ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 5278ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 5279ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5280ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5281ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 5282ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 5283ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5284ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5285ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 5286475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 5287ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT SrcVT = Src.getValueType(); 5288ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 5289ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5290ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5291ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits = DAG.ComputeNumSignBits(Src); 5292ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 5293ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DAG.ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 5294ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5295ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 5296ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 5297ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 5298ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 5299ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (DestReg >= FLI.LiveOutRegInfo.size()) 5300ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FLI.LiveOutRegInfo.resize(DestReg+1); 5301ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[DestReg]; 5302ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 5303ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownOne = NumSignBits; 5304ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownZero = NumSignBits; 5305ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5306ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5307ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 5308ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5309f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGISel::CodeGenAndEmitDAG(SelectionDAG &DAG) { 5310462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 5311462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 5312462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 5313462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 5314462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 5315462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 || ViewISelDAGs || ViewSchedDAGs || ViewSUnitDAGs) 5316462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman BlockName = DAG.getMachineFunction().getFunction()->getName() + ':' + 5317462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman BB->getBasicBlock()->getName(); 5318462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5319462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Initial selection DAG:\n"; 5320417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 5321462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5322462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1) DAG.viewGraph("dag-combine1 input for " + BlockName); 5323417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5324af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 5325ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53265e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 5327ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(false, *AA); 5328ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5329ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(false, *AA); 5330ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 53312300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5332417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 53331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 5334f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands 53351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 53361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 5337f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands if (EnableLegalizeTypes) {// Enable this some day. 5338462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewLegalizeTypesDAGs) DAG.viewGraph("legalize-types input for " + 5339462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman BlockName); 5340462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5341462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 5342462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 5343462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DAG.LegalizeTypes(); 5344462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 5345462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DAG.LegalizeTypes(); 5346462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 5347462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5348462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Type-legalized selection DAG:\n"; 5349462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DEBUG(DAG.dump()); 5350462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 535170587ea813986bb0dbef71610091d496e28c22a6Chris Lattner // TODO: enable a dag combine pass here. 535270587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 5353f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands 5354462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewLegalizeDAGs) DAG.viewGraph("legalize input for " + BlockName); 5355462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5356ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53575e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 5358ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Legalize(); 5359ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5360ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Legalize(); 5361ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5362f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5363832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 53641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(DAG.dump()); 5365f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5366462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine2) DAG.viewGraph("dag-combine2 input for " + BlockName); 5367462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5368af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 5369ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53705e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 5371ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(true, *AA); 5372ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5373ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng DAG.Combine(true, *AA); 5374ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 53752300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5376417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 5377417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DEBUG(DAG.dump()); 5378417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5379462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewISelDAGs) DAG.viewGraph("isel input for " + BlockName); 5380ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5381f1a792bc59a4d65d0e346109c681768e07e62be5Evan Cheng if (!FastISel && EnableValueProp) 5382ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner ComputeLiveOutVRegInfo(DAG); 5383552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 5384a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 5385a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 5386ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53875e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 5388ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng InstructionSelect(DAG); 5389ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5390ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng InstructionSelect(DAG); 5391ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5392db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5393462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Selected selection DAG:\n"; 5394462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DEBUG(DAG.dump()); 5395462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5396462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSchedDAGs) DAG.viewGraph("scheduler input for " + BlockName); 5397462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 53985e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 53995e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman ScheduleDAG *Scheduler; 54005e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 54015e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 54025e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler = Schedule(DAG); 54035e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 54045e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler = Schedule(DAG); 54055e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 54065e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 5407462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 5408462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5409db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // Emit machine code to BB. This can change 'BB' to the last block being 5410db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 5411ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54125e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 54135e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 5414ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 54155e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 54165e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 54175e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 54185e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 54195e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 54205e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 54215e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 54225e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 54235e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 5424ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5425db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5426db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // Perform target specific isel post processing. 5427ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54285e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection Post Processing", GroupName); 5429462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman InstructionSelectPostProcessing(); 5430ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5431462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman InstructionSelectPostProcessing(); 5432ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5433f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5434832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 54351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 5436f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 5437f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 54380e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn, MachineFunction &MF, 54390e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FunctionLoweringInfo &FuncInfo) { 5440fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman // Define NodeAllocator here so that memory allocation is reused for 54410e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman // each basic block. 5442fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocatorType NodeAllocator; 54430e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 5444fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 5445fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman SelectBasicBlock(I, MF, FuncInfo, NodeAllocator); 54460e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 54470e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 5448fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 5449fed90b6d097d50881afb45e4d79f430db66dd741Dan GohmanSelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, MachineFunction &MF, 5450fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman FunctionLoweringInfo &FuncInfo, 5451fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocatorType &NodeAllocator) { 5452f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 5453f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman { 5454ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG DAG(TLI, MF, FuncInfo, 54550e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5456fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 5457f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &DAG; 5458f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5459f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // First step, lower LLVM code to some DAG. This DAG may use operations and 5460f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // types that are not supported by the target. 5461f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BuildSelectionDAG(DAG, LLVMBB, PHINodesToUpdate, FuncInfo); 54621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5463f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Second step, emit the lowered DAG as machine code. 5464f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(DAG); 5465f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 54664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 54674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 54684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 54694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 54704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 54714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 5472f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5473a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 54741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 54754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 5476f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5477f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 5478f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5479f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 54809ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 54819ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 54829ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5483f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5484f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 54851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 54864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 54874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 54884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 54894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 5490ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG HSDAG(TLI, MF, FuncInfo, 54910e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5492fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 54934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &HSDAG; 5494ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 54954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 54964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 54974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 54984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 54994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 55004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 55014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 55024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 5505ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG BSDAG(TLI, MF, FuncInfo, 55060e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5507fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 55084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CurDAG = &BSDAG; 5509ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering BSDL(BSDAG, TLI, *AA, FuncInfo, GCI); 55104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 55114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 55124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 55134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 55144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 55154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 55164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 55174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 55184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 55194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 55204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 55214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 55224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDAG.setRoot(BSDL.getRoot()); 55254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CodeGenAndEmitDAG(BSDAG); 55264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 55294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 55304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 55314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 55324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 55334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 55344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 55354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 55364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 55379ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 55389ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55399ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent)); 55409ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 55419ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55429ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases. 55439ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 55444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 55464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 55474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 55484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 55494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 55509ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 55519ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55529ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 55534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55589453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 55599453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 55609453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 55613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 55623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 55633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 5564ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG HSDAG(TLI, MF, FuncInfo, 55650e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5566fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 55673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &HSDAG; 5568ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering HSDL(HSDAG, TLI, *AA, FuncInfo, GCI); 55693a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 55703a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 55713a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 55723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 55733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 55743a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDAG.setRoot(HSDL.getRoot()); 55753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(HSDAG); 55764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 5578ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG JSDAG(TLI, MF, FuncInfo, 55790e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5580fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 55813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CurDAG = &JSDAG; 5582ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering JSDL(JSDAG, TLI, *AA, FuncInfo, GCI); 558337efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 55843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 55853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 558637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 55873a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 55883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDAG.setRoot(JSDL.getRoot()); 55893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CodeGenAndEmitDAG(JSDAG); 55903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 559137efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 559237efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 559337efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 559437efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 559537efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 559637efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 55974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 55983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 55999ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56009ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56019ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB)); 5602f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 56034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 5604f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 56059ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56069ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56079ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 560837efe6764568a3829fee26aba532283131d1a104Nate Begeman } 560937efe6764568a3829fee26aba532283131d1a104Nate Begeman } 561037efe6764568a3829fee26aba532283131d1a104Nate Begeman } 561137efe6764568a3829fee26aba532283131d1a104Nate Begeman 5612b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 5613b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 5614b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5615b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 5616b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5617b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 5618b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 56199ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 56209ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56219ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5622b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5623b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5624b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 5625f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 5626f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 5627d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 5628ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SelectionDAG SDAG(TLI, MF, FuncInfo, 56290e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman getAnalysisToUpdate<MachineModuleInfo>(), 5630fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohman NodeAllocator); 5631f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CurDAG = &SDAG; 5632ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen SelectionDAGLowering SDL(SDAG, TLI, *AA, FuncInfo, GCI); 5633d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5634f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 5635f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 5636f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 5637d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5638f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 5639f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 5640f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDAG.setRoot(SDL.getRoot()); 5641f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CodeGenAndEmitDAG(SDAG); 5642d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5643d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 5644d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 5645d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 5646d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 564757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 5648d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 5649d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 5650d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 5651d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 5652d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 5653d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 56549ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn]. 56559ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 56569ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB)); 5657d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 5658d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5659d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5660f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5661d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5662d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 566357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 566457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5665d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5666d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 56672452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 566857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5669f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 567057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 5671a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 56721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5673a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 567413ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 56755e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// Schedule - Pick a safe ordering for instructions for each 5676a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 56775e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 56785e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan GohmanScheduleDAG *SelectionDAGISel::Schedule(SelectionDAG &DAG) { 5679eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 568013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 568113ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 5682eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 56839373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 56844ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 568513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 56865e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman ScheduleDAG *Scheduler = Ctor(this, &DAG, BB, FastISel); 56875e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler->Run(); 56883e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 56895e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman return Scheduler; 5690a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 56910e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 569203fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 56939ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 56949ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 56959ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 56969ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 5697755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5698755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 5699755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5700755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 5701755480681c795d585c73556c028b6143c46bda86Chris Lattner 5702755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 5703755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5704755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 5705755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5706475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 5707dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 57082e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 57092e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5710755480681c795d585c73556c028b6143c46bda86Chris Lattner 5711755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5712755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5713755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5714755480681c795d585c73556c028b6143c46bda86Chris Lattner 5715755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 57162e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5717755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5718755480681c795d585c73556c028b6143c46bda86Chris Lattner 5719755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5720755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 57212e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5722ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5723755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5724755480681c795d585c73556c028b6143c46bda86Chris Lattner 5725755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5726755480681c795d585c73556c028b6143c46bda86Chris Lattner 5727755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5728755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5729755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5730755480681c795d585c73556c028b6143c46bda86Chris Lattner 5731755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5732755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5733755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5734755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5735475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 57362e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 57372e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 57382e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5739755480681c795d585c73556c028b6143c46bda86Chris Lattner 5740755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5741755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5742755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5743755480681c795d585c73556c028b6143c46bda86Chris Lattner 5744755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 57452e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5746755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5747755480681c795d585c73556c028b6143c46bda86Chris Lattner 5748755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5749755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 57502e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5751755480681c795d585c73556c028b6143c46bda86Chris Lattner 57522e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 5753ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5754755480681c795d585c73556c028b6143c46bda86Chris Lattner 5755755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5756755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5757755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5758755480681c795d585c73556c028b6143c46bda86Chris Lattner 5759755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5760755480681c795d585c73556c028b6143c46bda86Chris Lattner 5761755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5762755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5763755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5764755480681c795d585c73556c028b6143c46bda86Chris Lattner 57659ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 57660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 57670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 57680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 5769475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops, SelectionDAG &DAG) { 5770475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 57710e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 57720e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57730e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 57740e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 57750e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57760e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 57770e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 57780e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 57790e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57800e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 57810e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 57820e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 57830e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 57840e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 57850e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 57860e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 57870e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 57880e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 5789475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 57900e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps, DAG)) { 5791832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 57920e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 57930e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 57940e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 57950e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 579683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 579736d439666c9f9f781d57dc2fd6d3cc80602fe095Chris Lattner Ops.push_back(DAG.getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 57984b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner IntPtrTy)); 57990e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 58000e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 58010e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 58020e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 58030e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58040e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 58050e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 58060e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 58070e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5808794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 58091997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5810