SelectionDAGISel.cpp revision 6ecf50908c78aae0feff1c378fbb75dcf013ed21
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" 15381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng#include "llvm/CodeGen/SelectionDAGISel.h" 165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/ADT/BitVector.h" 17c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey#include "llvm/Analysis/AliasAnalysis.h" 185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov#include "llvm/Constants.h" 19adf6a965a321372c640845407195594835921eb4Chris Lattner#include "llvm/CallingConv.h" 201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/DerivedTypes.h" 211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Function.h" 2236ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner#include "llvm/GlobalVariable.h" 23ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner#include "llvm/InlineAsm.h" 241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instructions.h" 251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Intrinsics.h" 2643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey#include "llvm/IntrinsicInst.h" 275694b6e90eaf94fa7a21f101a8e4424d813a85ceReid Spencer#include "llvm/ParameterAttributes.h" 2878eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman#include "llvm/CodeGen/FastISel.h" 295a29c9eed157af51a8d338b5a225b146881819e8Gordon Henriksen#include "llvm/CodeGen/GCStrategy.h" 305eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen#include "llvm/CodeGen/GCMetadata.h" 311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFunction.h" 321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineFrameInfo.h" 331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/MachineInstrBuilder.h" 3484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineJumpTableInfo.h" 3584bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineModuleInfo.h" 3684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner#include "llvm/CodeGen/MachineRegisterInfo.h" 37381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng#include "llvm/CodeGen/ScheduleDAG.h" 38eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey#include "llvm/CodeGen/SchedulerRegistry.h" 391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/CodeGen/SelectionDAG.h" 406f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman#include "llvm/Target/TargetRegisterInfo.h" 411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetData.h" 421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetFrameInfo.h" 431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetInstrInfo.h" 441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetLowering.h" 451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Target/TargetMachine.h" 46124729155d860a0850eb4ef2a7cea4145e13a057Vladimir Prus#include "llvm/Target/TargetOptions.h" 47a4f0b3a084d120cfc5b5bb06f64b222f5cb72740Chris Lattner#include "llvm/Support/Compiler.h" 48db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Debug.h" 49db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/MathExtras.h" 50db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng#include "llvm/Support/Timer.h" 517e88103cdea8c36b2229dae8c60def14e3816512Jeff Cohen#include <algorithm> 521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerusing namespace llvm; 531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 54ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattnerstatic cl::opt<bool> 5570587ea813986bb0dbef71610091d496e28c22a6Chris LattnerEnableValueProp("enable-value-prop", cl::Hidden); 5670587ea813986bb0dbef71610091d496e28c22a6Chris Lattnerstatic cl::opt<bool> 57f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan SandsEnableLegalizeTypes("enable-legalize-types", cl::Hidden); 5878eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohmanstatic cl::opt<bool> 5978eca170e9ac5db7fd525f9bbf27090fefcbb646Dan GohmanEnableFastISel("fast-isel", cl::Hidden, 6078eca170e9ac5db7fd525f9bbf27090fefcbb646Dan Gohman cl::desc("Enable the experimental \"fast\" instruction selector")); 613e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohmanstatic cl::opt<bool> 623e697cfa979538c77459a3e4237e9bc1ac638761Dan GohmanDisableFastISelAbort("fast-isel-no-abort", cl::Hidden, 633e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman cl::desc("Use the SelectionDAGISel when \"fast\" instruction " 643e697cfa979538c77459a3e4237e9bc1ac638761Dan Gohman "selection fails")); 65ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 66da8abb02397d7cd62a1e16e7c534edd7096ac873Chris Lattner#ifndef NDEBUG 677944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattnerstatic cl::opt<bool> 68462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine1("view-dag-combine1-dags", cl::Hidden, 69462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the first " 70462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 71462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 72462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeTypesDAGs("view-legalize-types-dags", cl::Hidden, 73462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize types")); 74462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 75462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewLegalizeDAGs("view-legalize-dags", cl::Hidden, 76462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before legalize")); 77462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 78462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan GohmanViewDAGCombine2("view-dag-combine2-dags", cl::Hidden, 79462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman cl::desc("Pop up a window to show dags before the second " 80462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman "dag combine pass")); 81462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic cl::opt<bool> 82a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewISelDAGs("view-isel-dags", cl::Hidden, 83a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show isel dags as they are selected")); 84a9c2091cd38e401c846391c9951ff416e709b65eEvan Chengstatic cl::opt<bool> 85a9c2091cd38e401c846391c9951ff416e709b65eEvan ChengViewSchedDAGs("view-sched-dags", cl::Hidden, 86a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng cl::desc("Pop up a window to show sched dags as they are processed")); 873e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohmanstatic cl::opt<bool> 883e1a7aef17575d9c7058a035449d57e3c7295ed0Dan GohmanViewSUnitDAGs("view-sunit-dags", cl::Hidden, 895bab78527a946632cd9614daa0b9a82ee7b5e1ccChris Lattner cl::desc("Pop up a window to show SUnit dags after they are processed")); 907944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#else 91462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohmanstatic const bool ViewDAGCombine1 = false, 92462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewLegalizeTypesDAGs = false, ViewLegalizeDAGs = false, 93462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 = false, 94462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewISelDAGs = false, ViewSchedDAGs = false, 95462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewSUnitDAGs = false; 967944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner#endif 977944d9d9957db1efe085d9df3ea89826f50029b7Chris Lattner 98eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 99eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 100eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// RegisterScheduler class - Track the registration of instruction schedulers. 101eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 102eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 103eb577ba3b815a1fa4627b060dd2345d17abf672dJim LaskeyMachinePassRegistry RegisterScheduler::Registry; 104eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey 105eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 106eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 107eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// ISHeuristic command line option for instruction schedulers. 108eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey/// 109eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey//===---------------------------------------------------------------------===// 110844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<RegisterScheduler::FunctionPassCtor, false, 111844731a7f1909f55935e3514c9e713a62d67662eDan Gohman RegisterPassParser<RegisterScheduler> > 112844731a7f1909f55935e3514c9e713a62d67662eDan GohmanISHeuristic("pre-RA-sched", 113844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::init(&createDefaultScheduler), 114844731a7f1909f55935e3514c9e713a62d67662eDan Gohman cl::desc("Instruction schedulers available (before register" 115844731a7f1909f55935e3514c9e713a62d67662eDan Gohman " allocation):")); 11613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 117844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic RegisterScheduler 118844731a7f1909f55935e3514c9e713a62d67662eDan GohmandefaultListDAGScheduler("default", " Best scheduler for the target", 119844731a7f1909f55935e3514c9e713a62d67662eDan Gohman createDefaultScheduler); 1204ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 1215c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengnamespace { struct SDISelAsmOperandInfo; } 122bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 1231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// ComputeLinearIndex - Given an LLVM IR aggregate type and a sequence 1241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// insertvalue or extractvalue indices that identify a member, return 1251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// the linearized index of the start of the member. 1261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 1271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanstatic unsigned ComputeLinearIndex(const TargetLowering &TLI, const Type *Ty, 1281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const unsigned *Indices, 1291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const unsigned *IndicesEnd, 1301d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned CurIndex = 0) { 1311d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Base case: We're done. 1328f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && Indices == IndicesEnd) 1331d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman return CurIndex; 1341d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 1351d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Given a struct type, recursively traverse the elements. 1361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (const StructType *STy = dyn_cast<StructType>(Ty)) { 1378f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman for (StructType::element_iterator EB = STy->element_begin(), 1388f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman EI = EB, 1391d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EE = STy->element_end(); 1401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI != EE; ++EI) { 1418f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && *Indices == unsigned(EI - EB)) 1428f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return ComputeLinearIndex(TLI, *EI, Indices+1, IndicesEnd, CurIndex); 1438f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman CurIndex = ComputeLinearIndex(TLI, *EI, 0, 0, CurIndex); 1441d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Given an array type, recursively traverse the elements. 1471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 1481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *EltTy = ATy->getElementType(); 1491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) { 1508f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman if (Indices && *Indices == i) 1518f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return ComputeLinearIndex(TLI, EltTy, Indices+1, IndicesEnd, CurIndex); 1528f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman CurIndex = ComputeLinearIndex(TLI, EltTy, 0, 0, CurIndex); 1531d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1541d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 1551d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // We haven't found the type we're looking for, so keep searching. 1568f36f6d11761246bb4bd4ae1be88a58ba24d96b0Dan Gohman return CurIndex + 1; 1571d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman} 1581d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 159f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// ComputeValueVTs - Given an LLVM IR type, compute a sequence of 16083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands/// MVTs that represent all the individual underlying 161f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner/// non-aggregate types that comprise it. 1621d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 1631d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// If Offsets is non-null, it points to a vector to be filled in 1641d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// with the in-memory offsets of each of the individual values. 1651d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman/// 166f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnerstatic void ComputeValueVTs(const TargetLowering &TLI, const Type *Ty, 1671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVectorImpl<MVT> &ValueVTs, 1681d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVectorImpl<uint64_t> *Offsets = 0, 1691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman uint64_t StartingOffset = 0) { 170f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given a struct type, recursively traverse the elements. 171f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const StructType *STy = dyn_cast<StructType>(Ty)) { 1721d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const StructLayout *SL = TLI.getTargetData()->getStructLayout(STy); 1731d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (StructType::element_iterator EB = STy->element_begin(), 1741d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI = EB, 1751d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EE = STy->element_end(); 1761d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman EI != EE; ++EI) 1771d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, *EI, ValueVTs, Offsets, 1781d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman StartingOffset + SL->getElementOffset(EI - EB)); 179f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 180f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner } 181f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner // Given an array type, recursively traverse the elements. 182f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner if (const ArrayType *ATy = dyn_cast<ArrayType>(Ty)) { 183f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner const Type *EltTy = ATy->getElementType(); 1841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman uint64_t EltSize = TLI.getTargetData()->getABITypeSize(EltTy); 185f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner for (unsigned i = 0, e = ATy->getNumElements(); i != e; ++i) 1861d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, EltTy, ValueVTs, Offsets, 1871d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman StartingOffset + i * EltSize); 188f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner return; 18923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 19083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands // Base case: we can get an MVT for this LLVM IR type. 191f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner ValueVTs.push_back(TLI.getValueType(Ty)); 1921d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (Offsets) 1931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Offsets->push_back(StartingOffset); 194f899fce0c0492a6fa405323c073b3380260e5806Chris Lattner} 19523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 196f899fce0c0492a6fa405323c073b3380260e5806Chris Lattnernamespace { 1970fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegsForValue - This struct represents the registers (physical or virtual) 1980fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// that a particular set of values is assigned, and the type information about 1990fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// the value. The most common situation is to represent one value at a time, 2000fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// but struct or array values are handled element-wise as multiple values. 2010fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// The splitting of aggregates is performed recursively, so that we never 2020fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have aggregate-typed registers. The values at this point do not necessarily 2030fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// have legal types, so each value may require one or more registers of some 2040fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// legal type. 2050fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2069525528a7dc5462b6374d38c81ba5c07b11741feChris Lattner struct VISIBILITY_HIDDEN RegsForValue { 20723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// TLI - The TargetLowering object. 2080fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 20923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman const TargetLowering *TLI; 21023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 2110fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs - The value types of the values, which may not be legal, and 2120fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// may need be promoted or synthesized from one or more registers. 2130fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 21483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 215864635ad7b3046d3042311423071152c613961deChris Lattner 2160fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// RegVTs - The value types of the registers. This is the same size as 2170fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// ValueVTs and it records, for each value, what the type of the assigned 2180fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// register or registers are. (Individual values are never synthesized 2190fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// from more than one type of register.) 2200fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2210fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// With virtual registers, the contents of RegVTs is redundant with TLI's 2220fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// getRegisterType member function, however when with physical registers 2230fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// it is necessary to have a separate record of the types. 224864635ad7b3046d3042311423071152c613961deChris Lattner /// 22583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RegVTs; 226864635ad7b3046d3042311423071152c613961deChris Lattner 2270fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Regs - This list holds the registers assigned to the values. 2280fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// Each legal or promoted value requires one register, and each 2290fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// expanded value requires multiple registers. 2300fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman /// 2310fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman SmallVector<unsigned, 4> Regs; 232864635ad7b3046d3042311423071152c613961deChris Lattner 23323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue() : TLI(0) {} 234864635ad7b3046d3042311423071152c613961deChris Lattner 23523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 236b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 23783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT regvt, MVT valuevt) 2380fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(1, valuevt), RegVTs(1, regvt), Regs(regs) {} 23923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 240b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner const SmallVector<unsigned, 4> ®s, 24183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const SmallVector<MVT, 4> ®vts, 24283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const SmallVector<MVT, 4> &valuevts) 2430fe00906c8f1d1e455c780b221299a1349cc7094Dan Gohman : TLI(&tli), ValueVTs(valuevts), RegVTs(regvts), Regs(regs) {} 24423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue(const TargetLowering &tli, 24523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned Reg, const Type *Ty) : TLI(&tli) { 24623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(tli, Ty, ValueVTs); 24723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 248b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 24983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 25023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 25183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI->getRegisterType(ValueVT); 25223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) 25323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Regs.push_back(Reg + i); 25423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegVTs.push_back(RegisterVT); 25523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Reg += NumRegs; 25623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 257864635ad7b3046d3042311423071152c613961deChris Lattner } 258864635ad7b3046d3042311423071152c613961deChris Lattner 25941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner /// append - Add the specified values to this one. 26041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner void append(const RegsForValue &RHS) { 26141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner TLI = RHS.TLI; 26241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner ValueVTs.append(RHS.ValueVTs.begin(), RHS.ValueVTs.end()); 26341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RegVTs.append(RHS.RegVTs.begin(), RHS.RegVTs.end()); 26441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner Regs.append(RHS.Regs.begin(), RHS.Regs.end()); 26541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } 26641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 26741f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 268864635ad7b3046d3042311423071152c613961deChris Lattner /// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 26923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman /// this value and returns the result as a ValueVTs value. This uses 270864635ad7b3046d3042311423071152c613961deChris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 271b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 272475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getCopyFromRegs(SelectionDAG &DAG, 273475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const; 274c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 275c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 276c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// specified value into the registers specified by this object. This uses 277c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// Chain/Flag as the input and updates them for the output Chain/Flag. 278b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman /// If the Flag pointer is NULL, no flag is used. 279475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void getCopyToRegs(SDValue Val, SelectionDAG &DAG, 280475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const; 281c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 282c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// AddInlineAsmOperands - Add this value to the specified inlineasm node 283c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// operand list. This adds the code marker and includes the number of 284c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner /// values added into it. 285c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner void AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 286475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> &Ops) const; 287864635ad7b3046d3042311423071152c613961deChris Lattner }; 288864635ad7b3046d3042311423071152c613961deChris Lattner} 2894ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng 2901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 2911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner //===--------------------------------------------------------------------===// 2929373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// createDefaultScheduler - This creates an instruction scheduler appropriate 2939373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey /// for the target. 2949373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey ScheduleDAG* createDefaultScheduler(SelectionDAGISel *IS, 2959373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey SelectionDAG *DAG, 2964576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng MachineBasicBlock *BB, 2974576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng bool Fast) { 2989373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering &TLI = IS->getTargetLowering(); 2999373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 3009373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey if (TLI.getSchedulingPreference() == TargetLowering::SchedulingForLatency) { 3014576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng return createTDListDAGScheduler(IS, DAG, BB, Fast); 3029373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } else { 3039373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey assert(TLI.getSchedulingPreference() == 3049373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey TargetLowering::SchedulingForRegPressure && "Unknown sched type!"); 3054576f6d7a9c0f2c6a3b6c5d4d8a3063bbf763ae5Evan Cheng return createBURRListDAGScheduler(IS, DAG, BB, Fast); 3069373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 3079373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey } 3089373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 3099373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey 3109373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey //===--------------------------------------------------------------------===// 3111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FunctionLoweringInfo - This contains information that is global to a 3121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// function that is used when lowering a region of the function. 313f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner class FunctionLoweringInfo { 314f26bc8ef4827cf0023a7052b62b920b41813d473Chris Lattner public: 3151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 3161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Function &Fn; 3171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF; 31884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo; 3191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo(TargetLowering &TLI, Function &Fn,MachineFunction &MF); 3211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 3236ecf50908c78aae0feff1c378fbb75dcf013ed21Dan Gohman DenseMap<const BasicBlock*, MachineBasicBlock *> MBBMap; 3241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 3271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 3289f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 3311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 3321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 3336ecf50908c78aae0feff1c378fbb75dcf013ed21Dan Gohman DenseMap<const AllocaInst*, int> StaticAllocaMap; 3341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 335f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 336f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 337f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 338f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 339f40708223e409a152834b1553c6883ff2035b957Duncan Sands 34083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned MakeReg(MVT VT) { 34184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo.createVirtualRegister(TLI.getRegClassFor(VT)); 3421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 343571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 344571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 345571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 346571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 347571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 348571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 349edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3503c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 3513c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 3531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 3541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 3551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 3561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 357ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 358ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner struct LiveOutInfo { 359ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits; 360ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne, KnownZero; 361ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LiveOutInfo() : NumSignBits(0) {} 362ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner }; 363ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 364ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// LiveOutRegInfo - Information about live out vregs, indexed by their 365ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// register number offset by 'FirstVirtualRegister'. 366ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner std::vector<LiveOutInfo> LiveOutRegInfo; 3671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 3681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 370cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 371cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 372cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 373f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 3748806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 3758806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 376f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 377f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 378f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 381ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth/// switch or atomic instruction, which may expand to multiple basic blocks. 3821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 3831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 3841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 3851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 386f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 387571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 388f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 3891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 3901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 3911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 393bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 394f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 396bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 397f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // With FastISel active, we may be splitting blocks, so force creation 398f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // of virtual registers for all non-dead arguments. 399f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (EnableFastISel) 400f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman return A->use_empty(); 401f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 402bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 403bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 404f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 405bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 406bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 407bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 408bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris LattnerFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli, 410edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman Function &fn, MachineFunction &mf) 41184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner : TLI(tli), Fn(fn), MF(mf), RegInfo(MF.getRegInfo()) { 4121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 413bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 414bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 41516ce0df92717cd1474029d87efe596d000dc2caaChris Lattner for (Function::arg_iterator AI = Fn.arg_begin(), E = Fn.arg_end(); 41616ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 417bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 418bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 4191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 420bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 421bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 422bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 4232aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen Function::iterator BB = Fn.begin(), EB = Fn.end(); 4241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 426b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 4271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 428514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 429ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 430d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 431ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 432a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 433b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 434d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 4351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 4366266c18ea12b42bd9b262a1f4f8c3d7a85130118Chris Lattner MF.getFrameInfo()->CreateStackObject(TySize, Align); 4371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4392aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 4402aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 4421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 4431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 4441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 4451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 4471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 4481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 4492aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BB = Fn.begin(), EB = Fn.end(); BB != EB; ++BB) { 4500e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB); 4511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 4520e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MF.push_back(MBB); 4531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 4551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 4561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 4578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 4588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 4598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 4618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 4626f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman 4636f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman SmallVector<MVT, 4> ValueVTs; 4646f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman ComputeValueVTs(TLI, PN->getType(), ValueVTs); 4656f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 4666f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman MVT VT = ValueVTs[vti]; 4676f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4686f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 4696f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 4706f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 4716f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman PHIReg += NumRegisters; 4726f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman } 4738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 4741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4773c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 4783c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 4793c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 48010a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 48110a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// In the case that the given value has struct or array type, this function 48210a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// will assign registers for each member or element. 48310a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 4843c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 48583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 486b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner ComputeValueVTs(TLI, V->getType(), ValueVTs); 48795b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 48823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned FirstReg = 0; 489b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 49083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 49183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI.getRegisterType(ValueVT); 4928c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 493b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumRegs = TLI.getNumRegisters(ValueVT); 49423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 49523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned R = MakeReg(RegisterVT); 49623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman if (!FirstReg) FirstReg = R; 49723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 49823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 49923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return FirstReg; 5003c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 5011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 5031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 5041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 5051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 5061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 5071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 5081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 5091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 5101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 511475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DenseMap<const Value*, SDValue> NodeMap; 5121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 513d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 514d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 515d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 516d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 517475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> PendingLoads; 518d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 51986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingExports - CopyToReg nodes that copy values to virtual registers 52086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// for export to other blocks need to be emitted before any terminator 52186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instruction, but they have no other ordering requirements. We bunch them 52286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// up and the emit a single tokenfactor for them just before terminator 52386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instructions. 524475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> PendingExports; 52586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 5265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 5275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 5285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 5295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 5305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 5315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 5325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 5345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 5355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 5365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 5375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 5385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 5395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 5405502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 5415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 5425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 5444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 5454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 5464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 5474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 5494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 5504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 5534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 5545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 5555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 556f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 557f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 558f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 559f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 560f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 561f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 562f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 563f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 564f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 565f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 566f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 567f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 568f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 569f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 570f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 571f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 572f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 573b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 574b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 5755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 5775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 578f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 5794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 5805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 5815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 5825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 5835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 584f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 585f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 5865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 5884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 5894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 5904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 5914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 594f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 5961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 5971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 5981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 5991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 6001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 601a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 6025f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &AA; 6031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 604f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 605f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 606f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman std::vector<SelectionDAGISel::CaseBlock> SwitchCases; 6073a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 6083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 6093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov std::vector<SelectionDAGISel::JumpTableBlock> JTCases; 6104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::vector<SelectionDAGISel::BitTestBlock> BitTestCases; 611f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 6121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 6131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 6141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 615ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 6165eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen /// GFI - Garbage collection metadata for the function. 6175eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GCFunctionInfo *GFI; 6181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 6205f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AliasAnalysis &aa, 621ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FunctionLoweringInfo &funcinfo, 6225eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GCFunctionInfo *gfi) 6235f43f92c69aae9837064cf08291db1b36a82789fDan Gohman : TLI(tli), DAG(dag), TD(DAG.getTarget().getTargetData()), AA(aa), 6245eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen FuncInfo(funcinfo), GFI(gfi) { 6251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 62786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getRoot - Return the current virtual root of the Selection DAG, 62886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// flushing any PendingLoad items. This must be done before emitting 62986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// a store or any other node that may need to be ordered after any 63086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// prior load instructions. 631a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 632475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getRoot() { 633d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 634d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 635edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 636d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 637475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = PendingLoads[0]; 638d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 639d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 640d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 641d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 642d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 643d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 644475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 645bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 646d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 647d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 648d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 649a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 650a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 65186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getControlRoot - Similar to getRoot, but instead of flushing all the 65286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingLoad items, flush all the PendingExports items. It is necessary 65386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// to do this before emitting a terminator instruction. 65486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// 655475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getControlRoot() { 656475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = DAG.getRoot(); 65786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 65886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports.empty()) 65986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 66086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 66186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman // Turn all of the CopyToReg chains into one factored node. 66286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (Root.getOpcode() != ISD::EntryToken) { 66386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned i = 0, e = PendingExports.size(); 66486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (; i != e; ++i) { 66586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(PendingExports[i].Val->getNumOperands() > 1); 66686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports[i].Val->getOperand(0) == Root) 66786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman break; // Don't add the root if we already indirectly depend on it. 66886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 66986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 67086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (i == e) 67186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Root); 67286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 67386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 67486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 67586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman &PendingExports[0], 67686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.size()); 67786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.clear(); 67886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(Root); 67986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 68086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 68186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 68286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman void CopyValueToVirtualRegister(Value *V, unsigned Reg); 683571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 6841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 6851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 6871e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 6881e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 6891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 6901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 6911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 6921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 6931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 6941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 6951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 6961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 6981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 6991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 7001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 701475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getValue(const Value *V); 7021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 703475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void setValue(const Value *V, SDValue NewN) { 704475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &N = NodeMap[V]; 7051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(N.Val == 0 && "Already set a value for this node!"); 7060da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 7071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7084e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 7095c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 710e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 711e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 712f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 713571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 714571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 715571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 7168c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 717571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 718475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void LowerCallTo(CallSite CS, SDValue Callee, bool IsTailCall, 719070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 720dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 7211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 7221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 7231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 724f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 7251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 7261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 727b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 728dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 729b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 730b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 731b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 732dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 733b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 734b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 735b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 736dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 737b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 738b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 739b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 7404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 7414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 7424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 7434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 744f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitchCase(SelectionDAGISel::CaseBlock &CB); 7454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestHeader(SelectionDAGISel::BitTestBlock &B); 7464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 7474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 7484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B); 74937efe6764568a3829fee26aba532283131d1a104Nate Begeman void visitJumpTable(SelectionDAGISel::JumpTable &JT); 7503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov void visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 7513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH); 752f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 7531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 754b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 755b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 7561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7577f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 758e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 7595fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 7607f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 7617f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 7621628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 7637f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 76401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 765b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 7661628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 7677f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 7687f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 7691628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 7707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 7711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7727f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 7737f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 7747f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 7757f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 7767f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 7777f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 7787f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 7797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 7807f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 78124d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 7823822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 7833822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 78445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 78545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 786b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVICmp(User &I); 787b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVFCmp(User &I); 7883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 7893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 7903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 7913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 7923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 7933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 7943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 7953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 7963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 7973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 7983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 7993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 8003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 8011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8022bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 8032bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 8043e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 805c7029805ef35ce9805931067b841e6af11db382eChris Lattner 8061d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitExtractValue(ExtractValueInst &I); 8071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitInsertValue(InsertValueInst &I); 808041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 8091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 8101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 8111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 8131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 8141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 8151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 8161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 8171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 8181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 819fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 820c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 8210eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 8221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 8241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 8251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 8261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 8271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 8291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 8301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 8311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 8331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 8341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 8351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 83663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 83763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangprivate: 83863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang inline const char *implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op); 83963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 8401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 8411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 8421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 844b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyFromParts - Create a value that contains the specified legal parts 845b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// combined into the value they represent. If the parts combine to a type 846b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// larger then ValueVT then AssertOp can be used to specify whether the extra 847b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 8484468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner/// (ISD::AssertSext). 849475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstatic SDValue getCopyFromParts(SelectionDAG &DAG, 850475871a144eb604ddaf37503397ba0941442e5fbDan Gohman const SDValue *Parts, 8516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 85283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 85383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT, 8544468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner ISD::NodeType AssertOp = ISD::DELETED_NODE) { 855014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts > 0 && "No parts to assemble!"); 856014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TargetLowering &TLI = DAG.getTargetLoweringInfo(); 857475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = Parts[0]; 858014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 859014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts > 1) { 860014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the value from multiple parts. 86183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 86283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 86383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned ValueBits = ValueVT.getSizeInBits(); 864014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 865014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the power of 2 part. 866014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = NumParts & (NumParts - 1) ? 867014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1 << Log2_32(NumParts) : NumParts; 868014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = PartBits * RoundParts; 86983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RoundVT = RoundBits == ValueBits ? 87083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT : MVT::getIntegerVT(RoundBits); 871475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Lo, Hi; 872014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 873014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts > 2) { 87483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT HalfVT = MVT::getIntegerVT(RoundBits/2); 875014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT); 876014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2, 877014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, HalfVT); 8786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 879014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Parts[0]; 880014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = Parts[1]; 8816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 882014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 883014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 884014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi); 885014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 886014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts < NumParts) { 887014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the trailing non-power-of-2 part. 888014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 88983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OddVT = MVT::getIntegerVT(OddParts * PartBits); 890014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT); 891014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 892014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Combine the round and odd parts. 893014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Val; 894014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 895014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 89683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT TotalVT = MVT::getIntegerVT(NumParts * PartBits); 897014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi); 898014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::SHL, TotalVT, Hi, 89983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands DAG.getConstant(Lo.getValueType().getSizeInBits(), 900014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 901014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo); 902014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi); 903014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 904014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 905014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Handle a multi-element vector. 90683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 907014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumIntermediates; 908014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumRegs = 909014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 910014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands RegisterVT); 911014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 91235213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 913014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 914014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == Parts[0].getValueType() && 915014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Part type doesn't match part!"); 916014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 917014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the parts into intermediate operands. 918475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops(NumIntermediates); 919014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumIntermediates == NumParts) { 920014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the register was not expanded, truncate or copy the value, 921014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // as appropriate. 922014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumParts; ++i) 923014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 924014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 925014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts > 0) { 926014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the intermediate type was expanded, build the intermediate operands 927014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // from the parts. 928014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts % NumIntermediates == 0 && 929014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Must expand into a divisible number of parts!"); 930014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned Factor = NumParts / NumIntermediates; 931014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumIntermediates; ++i) 932014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 933014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 934014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 935014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 936014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 937014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // operands. 93883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands Val = DAG.getNode(IntermediateVT.isVector() ? 939014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, 940014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT, &Ops[0], NumIntermediates); 9416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 942014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 944014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // There is now one part, held in Val. Correct it to match ValueVT. 945014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT = Val.getValueType(); 9466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 947014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) 948014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return Val; 949014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 95083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 95183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.isVector() && "Unknown vector conversion!"); 952014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 9536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 9546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 95583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (ValueVT.isVector()) { 95683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 95783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 958014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Only trivial scalar-to-vector conversions should get here!"); 959014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 960014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 96283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && 96383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.isInteger()) { 9648e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(PartVT)) { 965014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // For a truncate, see if we have any information to 966014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // indicate whether the truncated bits will always be 967014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // zero or sign-extension. 968014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (AssertOp != ISD::DELETED_NODE) 969014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(AssertOp, PartVT, Val, 970014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getValueType(ValueVT)); 971014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 972014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 973014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 974014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 9756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 976014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 97783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 9788e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(Val.getValueType())) 9794468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner // FP_ROUND's are always exact here. 980d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val, 9814468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner DAG.getIntPtrConstant(1)); 982d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val); 983d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner } 984014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 98583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) 986014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 987014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 988014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 989475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); 9906183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 9916183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 992b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyToParts - Create a series of nodes that contain the specified value 993b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// split into legal parts. If the parts contain more bits than Val, then, for 994b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// integers, ExtendKind can be used to specify how to generate the extra bits. 9956183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 996475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val, 997475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue *Parts, 9986183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 99983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 1000b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 100125ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 100283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PtrVT = TLI.getPointerTy(); 100383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = Val.getValueType(); 100483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 1005014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 1006014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1007014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!NumParts) 1008014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1009014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 101083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 1011014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) { 1012014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "No-op copy with multiple parts!"); 1013014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 1014014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1015014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1016014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 101783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (NumParts * PartBits > ValueVT.getSizeInBits()) { 1018014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover more bits than the value has, promote the value. 101983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 1020014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "Do not know what to promote to!"); 1021014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 102283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartVT.isInteger() && ValueVT.isInteger()) { 102383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1024014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ExtendKind, ValueVT, Val); 1025014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1026014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1027014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 102883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartBits == ValueVT.getSizeInBits()) { 1029014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Different types of the same size. 1030014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && PartVT != ValueVT); 1031014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 103283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (NumParts * PartBits < ValueVT.getSizeInBits()) { 1033014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover less bits than value has, truncate the value. 103483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && ValueVT.isInteger()) { 103583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1036014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1037014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1038014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1039014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1040014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 10416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1042014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The value may have changed - recompute ValueVT. 1043014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = Val.getValueType(); 104483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(NumParts * PartBits == ValueVT.getSizeInBits() && 1045014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Failed to tile the value with PartVT!"); 1046014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1047014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 1048014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(PartVT == ValueVT && "Type conversion failed!"); 1049014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 10506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 10516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1053014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Expand the value into multiple parts. 1054014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts & (NumParts - 1)) { 1055014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is not a power of 2. Split off and copy the tail. 105683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(PartVT.isInteger() && ValueVT.isInteger() && 1057014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Do not know what to expand to!"); 1058014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = 1 << Log2_32(NumParts); 1059014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = RoundParts * PartBits; 1060014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 1061475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OddVal = DAG.getNode(ISD::SRL, ValueVT, Val, 1062014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(RoundBits, 1063014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 1064014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT); 1065014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1066014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The odd parts were reversed by getCopyToParts - unreverse them. 1067014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts + RoundParts, Parts + NumParts); 1068014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands NumParts = RoundParts; 106983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1070014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1071014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1072014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1073014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is a power of 2. Repeatedly bisect the value using 1074014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // EXTRACT_ELEMENT. 107525eb043759c23b61769108f78382eb9701c41db2Duncan Sands Parts[0] = DAG.getNode(ISD::BIT_CONVERT, 107683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT::getIntegerVT(ValueVT.getSizeInBits()), 107725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Val); 1078014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 1079014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i < NumParts; i += StepSize) { 1080014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ThisBits = StepSize * PartBits / 2; 108183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::getIntegerVT (ThisBits); 1082475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Part0 = Parts[i]; 1083475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Part1 = Parts[i+StepSize/2]; 108425eb043759c23b61769108f78382eb9701c41db2Duncan Sands 108525eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 108625eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(1, PtrVT)); 108725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 108825eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(0, PtrVT)); 108925eb043759c23b61769108f78382eb9701c41db2Duncan Sands 109025eb043759c23b61769108f78382eb9701c41db2Duncan Sands if (ThisBits == PartBits && ThisVT != PartVT) { 109125eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0); 109225eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1); 109325eb043759c23b61769108f78382eb9701c41db2Duncan Sands } 1094014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1095014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1096014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1097014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1098014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts, Parts + NumParts); 1099014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1100014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1101014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1102014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1103014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Vector ValueVT. 1104014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 11056183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 110683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 11076183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 1108014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 110983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 111083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 1111a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 1112a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 1113a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 11146183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11156183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1116014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 11176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 11186183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 11196183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11216183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 112283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 11236183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 11246183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 11256183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 11266183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 11276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 112883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned NumElements = ValueVT.getVectorNumElements(); 11296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11306183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 113135213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 11326183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 11336183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11346183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 1135475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops(NumIntermediates); 11366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 113783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (IntermediateVT.isVector()) 11386183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 11396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 11406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 114125ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 11426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 11436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 11446183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 114525ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 11466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 11486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 11496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 11506183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 11516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 1152532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 11536183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 11546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 11556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 11566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 11576183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 11586183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 11596183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 1160532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 11616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 11636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 11646183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1165475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue SelectionDAGLowering::getValue(const Value *V) { 1166475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &N = NodeMap[V]; 1167199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (N.Val) return N; 1168199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1169199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 117083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(V->getType(), true); 1171b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1172b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) 1173b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstant(CI->getValue(), VT); 1174b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1175b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) 1176199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 1177b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1178b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (isa<ConstantPointerNull>(C)) 1179199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 1180b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1181b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) 1182b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 1183b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 11841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C) && !isa<VectorType>(V->getType()) && 11851d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman !V->getType()->isAggregateType()) 11866833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 1187b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1188b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 1189b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner visit(CE->getOpcode(), *CE); 1190475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N1 = NodeMap[V]; 1191b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner assert(N1.Val && "visit didn't populate the ValueMap!"); 1192b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N1; 1193b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner } 1194b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 11951d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) { 1196475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Constants; 11971d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end(); 11981d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman OI != OE; ++OI) { 11991d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SDNode *Val = getValue(*OI).Val; 12004bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i) 1201475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Constants.push_back(SDValue(Val, i)); 12021d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12034bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands return DAG.getMergeValues(&Constants[0], Constants.size()); 12041d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12051d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 12061f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman if (isa<StructType>(C->getType()) || isa<ArrayType>(C->getType())) { 12071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 12081f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman "Unknown struct or array constant!"); 12091d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 12101f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman SmallVector<MVT, 4> ValueVTs; 12111f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman ComputeValueVTs(TLI, C->getType(), ValueVTs); 12121f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman unsigned NumElts = ValueVTs.size(); 12138a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumElts == 0) 1214475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); // empty struct 1215475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Constants(NumElts); 12161f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman for (unsigned i = 0; i != NumElts; ++i) { 12171f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman MVT EltVT = ValueVTs[i]; 12181d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C)) 12191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getNode(ISD::UNDEF, EltVT); 12201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (EltVT.isFloatingPoint()) 12211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstantFP(0, EltVT); 12221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else 12231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstant(0, EltVT); 12241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12251f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman return DAG.getMergeValues(&Constants[0], NumElts); 12261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 12271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 12286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner const VectorType *VecTy = cast<VectorType>(V->getType()); 1229b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumElements = VecTy->getNumElements(); 1230b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 12316833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // Now that we know the number and type of the elements, get that number of 12326833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // elements into the Ops array based on what kind of constant it is. 1233475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 16> Ops; 1234b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 1235b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 1236b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.push_back(getValue(CP->getOperand(i))); 1237199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 12386833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 12396833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Unknown vector constant!"); 124083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(VecTy->getElementType()); 12416833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 1242475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op; 12436833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C)) 12446833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getNode(ISD::UNDEF, EltVT); 124583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands else if (EltVT.isFloatingPoint()) 12466833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstantFP(0, EltVT); 1247b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner else 12486833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstant(0, EltVT); 1249b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.assign(NumElements, Op); 1250199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1251b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1252b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // Create a BUILD_VECTOR node. 1253b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 1254199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1255199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1256b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // If this is a static alloca, generate it as the frameindex instead of 1257b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // computation. 1258199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 12596ecf50908c78aae0feff1c378fbb75dcf013ed21Dan Gohman DenseMap<const AllocaInst*, int>::iterator SI = 1260b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 1261199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 1262199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 1263199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1264199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1265251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 1266251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 1267199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 12686833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner RegsForValue RFV(TLI, InReg, V->getType()); 1269475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getEntryNode(); 1270b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 1271199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 1272199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1273199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 12741c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 12751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 127686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot())); 12771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 12781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1279b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1280475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> NewValues; 128186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman NewValues.push_back(getControlRoot()); 128286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 1283475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RetOp = getValue(I.getOperand(i)); 1284b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1285ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman SmallVector<MVT, 4> ValueVTs; 1286ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ComputeValueVTs(TLI, I.getOperand(i)->getType(), ValueVTs); 1287ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned j = 0, f = ValueVTs.size(); j != f; ++j) { 1288ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT VT = ValueVTs[j]; 1289ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1290ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // FIXME: C calling convention requires the return type to be promoted to 1291ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // at least 32-bit. But this is not necessary for non-C calling conventions. 1292ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.isInteger()) { 1293ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT MinVT = TLI.getRegisterType(MVT::i32); 1294ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.bitsLT(MinVT)) 1295ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman VT = MinVT; 1296ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1297b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1298ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman unsigned NumParts = TLI.getNumRegisters(VT); 1299ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT PartVT = TLI.getRegisterType(VT); 1300475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 1301ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1302ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1303ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman const Function *F = I.getParent()->getParent(); 1304ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (F->paramHasAttr(0, ParamAttr::SExt)) 1305ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 1306ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman else if (F->paramHasAttr(0, ParamAttr::ZExt)) 1307ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 1308ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1309475871a144eb604ddaf37503397ba0941442e5fbDan Gohman getCopyToParts(DAG, SDValue(RetOp.Val, RetOp.ResNo + j), 1310ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman &Parts[0], NumParts, PartVT, ExtendKind); 1311ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1312ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned i = 0; i < NumParts; ++i) { 1313ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(Parts[i]); 1314ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy())); 1315ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1316ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 13171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1318bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 1319bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 13201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 13211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1322571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 1323571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 1324571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 1325571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 1326571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 1327571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 1328571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1329571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 1330571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 1331571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1332571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 133386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(V, Reg); 1334571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1335571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 13368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 13378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 13388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 13398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 13408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 13418c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 13428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 13438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 13468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 13478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 13508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 13518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 13528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 13538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13548c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13558c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 13568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 13578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 13588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 13608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 13618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 13628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 13636a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 13646a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 13656a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 13666a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 13676a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 13686a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1369571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1370571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1371571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1372571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1373571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1374571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1375571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1376e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1377571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1378e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1379e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 13806a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 13816a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 13826a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1383571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1384571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1385e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1386e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1387e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1388e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 13895a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 13905a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 13915a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 13925a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 13935a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1394e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1395e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1396e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1397e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1398e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1399e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1400e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1401e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1402e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1403e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1404e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1405e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1406e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1407e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1408e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1409e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1410e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1411e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1412e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1413e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1414e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1415e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1416e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1417e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1418e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1419e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1420e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 14216bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 14226bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 1423e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1424e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1425e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1426e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1427e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1428e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1429e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1430e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1431e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1432e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1433e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1434e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1435e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 14360da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1437e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1438571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1439571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1440571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SelectionDAGISel::CaseBlock CB(Condition, BOp->getOperand(0), 14415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1442571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1443571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1444571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1445571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1446571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 14476b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 14485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, TBB, FBB, CurBB); 1449571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1450571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1451571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1452571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1453d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1454d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1455571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 14560e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineFunction &MF = DAG.getMachineFunction(); 14570e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock()); 14580e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurBB->getParent()->insert(++BBI, TmpBB); 1459571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1460d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1461d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1462d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1463d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1464d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1465d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1466d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1467d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1468571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1469d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1470d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1471d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1472d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1473d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1474d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1475d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1476d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1477d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1478d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1479d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1480d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1481d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1482d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1483d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1484d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1485d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1486d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1487d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1488d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1489d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1490d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1491571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1492571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1493df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1494df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1495df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 1496df19f27d039fd791c73e39f4134319debc75db4fChris Lattnerstatic bool 1497df19f27d039fd791c73e39f4134319debc75db4fChris LattnerShouldEmitAsBranches(const std::vector<SelectionDAGISel::CaseBlock> &Cases) { 1498df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1499df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 15000ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 15010ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 15020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 15030ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 15040ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 15050ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 15060ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 15070ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 15080ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1509df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1510df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1511df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 15121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 15131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 15141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 15151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 15171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 15181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 15191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 15201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 15211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 15221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 15232d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update machine-CFG edges. 15242d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Succ0MBB); 15252d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 15261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 15271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 152886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1529dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 153057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 153157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 153257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 153357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 153457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 153557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 153657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1537571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1538571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1539571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1540571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1541571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1542571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1543571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1544571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1545571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1546571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1547571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1548571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1549571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1550571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1551571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1552571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1553571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1554571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1555d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1556571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1557571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 15580ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 15590ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 15600ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 15610ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 15620ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1563df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1564df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1565df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1566df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1567df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1568df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1569df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1570df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1571df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1572df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1573df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 15745a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 15755a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 15760ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 15770ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 15780ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 15790e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMBB->getParent()->erase(SwitchCases[i].ThisBB); 15800ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1581df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1582571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1583571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 15842452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 15852452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 15866b6b6ef1677fa71b1072c2911b4c1f9524a558c9Zhou Sheng SelectionDAGISel::CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 15875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov NULL, Succ0MBB, Succ1MBB, CurMBB); 15882452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 15892452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 15902452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 15911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 15921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1593f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1594f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 1595f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begemanvoid SelectionDAGLowering::visitSwitchCase(SelectionDAGISel::CaseBlock &CB) { 1596475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Cond; 1597475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CondLHS = getValue(CB.CmpLHS); 159857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 15995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 16005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 16015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 16025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 16035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 16045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 16055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 1606475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue True = DAG.getConstant(1, CondLHS.getValueType()); 16075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 16085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 16095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 16105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 16115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 16125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 16145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 16155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1616475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CmpOp = getValue(CB.CmpMHS); 161783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = CmpOp.getValueType(); 16183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 16205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 16215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 1622475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 16235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 16245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 16255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 16275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 16282d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update successor info 16292d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.TrueBB); 16302d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.FalseBB); 16312d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1632f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1633f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1634f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1635f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1636f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1637f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1638f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1639f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1640f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 164157ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 164257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1643475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue True = DAG.getConstant(1, Cond.getValueType()); 1644f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1645f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1646475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond, 164757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 1648bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson 1649bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson // If the branch was constant folded, fix up the CFG. 1650bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (BrCond.getOpcode() == ISD::BR) { 16513bc9c6f3e75dba02c1cc647b1f56ee1f39919046Owen Anderson CurMBB->removeSuccessor(CB.FalseBB); 1652f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1653bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson } else { 1654bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson // Otherwise, go ahead and insert the false branch. 1655bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (BrCond == getControlRoot()) 16563bc9c6f3e75dba02c1cc647b1f56ee1f39919046Owen Anderson CurMBB->removeSuccessor(CB.TrueBB); 1657bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson 1658bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (CB.FalseBB == NextBlock) 1659bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.setRoot(BrCond); 1660bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson else 1661bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 1662bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.getBasicBlock(CB.FalseBB))); 1663bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson } 1664f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1665f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 16663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 166737efe6764568a3829fee26aba532283131d1a104Nate Begemanvoid SelectionDAGLowering::visitJumpTable(SelectionDAGISel::JumpTable &JT) { 166837efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1669f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 167083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PTy = TLI.getPointerTy(); 1671475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy); 1672475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Table = DAG.getJumpTable(JT.JTI, PTy); 16733d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 16743d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 16753d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 167637efe6764568a3829fee26aba532283131d1a104Nate Begeman} 167737efe6764568a3829fee26aba532283131d1a104Nate Begeman 16783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 16793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 16803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikovvoid SelectionDAGLowering::visitJumpTableHeader(SelectionDAGISel::JumpTable &JT, 16813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SelectionDAGISel::JumpTableHeader &JTH) { 16823a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 16833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 16843a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 1685475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchOp = getValue(JTH.SValue); 168683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 1687475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 16883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 16893a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 16903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 16913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 16923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 16933a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 16943a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 16958e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 16963a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 16973a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 16983a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 16993a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1701475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp); 17023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 17033a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 17053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 17063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 1707475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 17083a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 17093a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 17103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 17123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 17173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1718475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 17193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 17203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 17223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 17233a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 17243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 17254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 17264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 17283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 17293a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 17314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 17324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestHeader(SelectionDAGISel::BitTestBlock &B) { 17334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 1734475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchOp = getValue(B.SValue); 173583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 1736475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 17374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 17384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 1740475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 17414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 17424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 17434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1744475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ShiftOp; 17458e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getShiftAmountTy())) 17464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 17474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 17494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 1751475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 17524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 17534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 17544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1756475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal); 17574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 17584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 17604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 17614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 17624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 17634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 17644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 17654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 17672d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17682d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.Default); 17692d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(MBB); 17702d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1771475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 17722d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(B.Default)); 17732d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 17754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 17764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 17774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 17784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 17794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 17814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 17824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 17834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 17844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 17854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 17864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestCase &B) { 17874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 1788475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg, 1789ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner TLI.getPointerTy()); 17904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1791475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), SwitchVal, 1792ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DAG.getConstant(B.Mask, TLI.getPointerTy())); 1793475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp, 17944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 17954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 17962d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 17972d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.TargetBB); 17982d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(NextMBB); 17992d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1800475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), 18014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 18024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 18044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 18054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 18064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 18074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 18084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 18094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 18114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 18124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 18134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 18144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 18154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 18174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 18183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1819b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1820b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1821b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1822f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 18239fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1824fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1825fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1826fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 18276f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1828f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1829f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1830f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1831f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1832f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1833f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 183486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(&I, VMI->second); 1835f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 18369fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1837f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1838f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1839f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 18402d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 18412d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Drop into normal successor. 18422d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 18432d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(Return))); 1844b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1845b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1846b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1847b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1848b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 18495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1850b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1851dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1852b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1853b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1854b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1855dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1856dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1857dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1858dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 18594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1860dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 18615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1862b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1863b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1864b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1865b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1866b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1867b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1868b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1869b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1870b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1871b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1872b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1873b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1874b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1875b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1876b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1877b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1878b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 18795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 1880b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 1881b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 1882b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 18835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 1884b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 1885b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 1886b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1887b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1888b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1889b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1890b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 1891b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 1892b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 1893b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 1894b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 1895b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 1896b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 18970e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock()); 18980e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FallThrough); 1899b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 1900b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 1901b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 1902b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 19035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 19055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 19065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 19075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 19085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 19095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 19105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 19115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 19125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 19135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 19145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(CC, LHS, RHS, MHS, 19155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->BB, FallThrough, CurBlock); 1916b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1917b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 1918b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 1919b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 1920b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 1921b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 1922b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 1923b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 1924b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 1925b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1926b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 1927b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 1928dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1929dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 1930b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 1931b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 19327294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 19337232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen return !DisableJumpTables && 19347232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 19357232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 19367294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 19377294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 1938b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 1939dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 1940b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1941b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1942b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1943dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 1944dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1945dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 19475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 19485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 19505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 19515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 19525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 1953dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19547294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 1955dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1956dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 19585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 1959dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 1960dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 19615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 19625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 19634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 19645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1965b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1966b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1967dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1968b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1969b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1970b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1971b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1972b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1973b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1974b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1975b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1976b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 1977b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1978b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 1979b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 1980b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 1981b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 19820e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB); 19830e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, JumpTableBB); 1984b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 1985b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 1986b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1987b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 19884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 1989b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 1990b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 1991b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 1992b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 19935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 19945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 19955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 19965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 19975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 19985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 19995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 20005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 2001b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 2002b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 2003b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2005b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2006b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 20075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 2008b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 2009b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 2010b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 2011b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 2012b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 2013b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2014b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2015b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2016b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 2017b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 2018b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 2019b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2020b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 2021b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 2022f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel SelectionDAGISel::JumpTable JT(-1U, JTI, JumpTableBB, Default); 2023b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SelectionDAGISel::JumpTableHeader JTH(First, Last, SV, CR.CaseBB, 2024b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov (CR.CaseBB == CurMBB)); 2025b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2026b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 2027b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2028b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JTCases.push_back(SelectionDAGISel::JumpTableBlock(JTH, JT)); 2029b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2030dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2031b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2032b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2033b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 2034b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 2035dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 2036b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 2037b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 2038b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 2039b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 2040b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 2041b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 2042b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2043b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 2044b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 2045b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 2046b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2047b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 2048b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 2049b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2050b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 2051b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 2052b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 2053b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2054b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 2055b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 2056b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 20575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 20585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 20594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 20605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 2061b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2062b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 2063b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 20645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 20655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 20665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 20675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 20685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 20705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 20714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 20724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 20734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 2074b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 20755502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 20765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 20775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 20784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 2079b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 2080b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 208154e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 20824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 20834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 20844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 20854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 20864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 20874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 2088b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 20894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 20904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 2091b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20935502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 20945502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 2095b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20967294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 20977294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 20987294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 20997294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 21007294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 21017294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 2102b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2103b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 2104b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 21055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 2106b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 2107b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2108b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 2109b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 2110b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 2111b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 2112b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 2113b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 2114b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 21155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 21165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 21175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 21185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 2119b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 21200e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB); 21210e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, TrueBB); 2122b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 2123b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2124b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2125b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 2126b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 2127b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 2128b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 2129b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 21305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 21315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 21325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 2133b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 21340e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 21350e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FalseBB); 2136b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 2137b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2138b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2139b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 2140b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 2141b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 21425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SelectionDAGISel::CaseBlock CB(ISD::SETLT, SV, C, NULL, 21435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB, FalseBB, CR.CaseBB); 2144b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2145b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2146b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 2147b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 2148b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 2149dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2150dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2151b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2152b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 21534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 21544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 21554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 21564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 21574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 21584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 21593ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 216083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned IntPtrBits = TLI.getPointerTy().getSizeInBits(); 21614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 21634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 21644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 21664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 21674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 21684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 21704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 21714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 21724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 21734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 21744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 21754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 21764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 21774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 21804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 21814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 21824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 21834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 21844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 21854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 21864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 21874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 21884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 21894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 21904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 21914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 21924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 21934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 21944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 21954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 21964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 21974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 21984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 2199ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 22004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 22014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 22024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 22034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 22044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 22064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 22074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 22094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 22104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 22114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 2212e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 22134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 22144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 22154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 22164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 22194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 22204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 22224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 22234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 22244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 22254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 22264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 22284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 22294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 22304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 22314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 22344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 22354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 2237e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 22384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 22394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 22434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestInfo BTC; 22454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 22474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 22484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 22494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 22514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 22534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 22544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 22554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 22564198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22570e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 22580e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, CaseBB); 22594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BTC.push_back(SelectionDAGISel::BitTestCase(CasesBits[i].Mask, 22604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBB, 22614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].BB)); 22624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SelectionDAGISel::BitTestBlock BTB(lowBound, range, SV, 2265efc366263659db05ddc5e14532946cb9213bcdd6Jeff Cohen -1U, (CR.CaseBB == CurMBB), 22664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CR.CaseBB, Default, BTC); 22674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 22694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 22704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 22724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 22744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 22754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 227786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman/// Clusterify - Transform simple list of Cases into list of CaseRange's 22785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 22795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 22805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 22815502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 22835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 22845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 22855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 22865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 22875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 22885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2289b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 22905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22915502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 22925502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 2293a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 2294a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 229527a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 22965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 22975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 22985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 22995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 23005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 23025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 23035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 23045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 23055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 23065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 23075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 23085502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 23095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 23105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 23125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 23135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 23145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 23155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 23165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 23185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 23195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 23205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 2321f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 2322f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 2323f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 2324c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 23255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 2326d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 2327f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 2328f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 23295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 2330f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 2331c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2332f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 23332d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Default); 2334d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 233586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 2336d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 23372d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 2338f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 2339f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2340f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 2341f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 2342f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 2343f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 23445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 23455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 23465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 23475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 2348c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2349f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 2350f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 2351f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 23525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 235337efe6764568a3829fee26aba532283131d1a104Nate Begeman 23543a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 2355b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 23563a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 23573a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 23583a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 23593a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 23603a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 23613a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 23623a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 23634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 23644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 23654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23663a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 23673a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 2368dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 2369dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2370dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 23714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 23723a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 23733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2374dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2375dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2376dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2377dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2378dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2379dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2380f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2381f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2382f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 23833a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2384b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2385b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 238624d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 23879d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 23887f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 23897f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 23907f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2391c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2392c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 23939e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2394c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2395c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2396475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2397c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2398c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2399c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 24007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 24017f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 24027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 24037f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 240401b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 24059e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 2406475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 240701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 240801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 240901b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 24107f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 24117f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 24127f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2413b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2414b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 24157f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 2416475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2417475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 241824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 241924d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 24201628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 24211628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2422e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2423475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2424475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 24255bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman if (!isa<VectorType>(I.getType())) { 24265bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman if (TLI.getShiftAmountTy().bitsLT(Op2.getValueType())) 24275bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 24285bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman else if (TLI.getShiftAmountTy().bitsGT(Op2.getValueType())) 24295bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 24305bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman } 2431e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 24321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 24331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 24341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 243545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2436e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2437e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2438e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2439e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2440e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2441475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2442475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 244345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2444e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 244545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 244645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 244745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 244845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 244945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 245045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 245145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 245245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 245345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 245445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 245545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 245645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 245745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 245845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 245945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 246045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 246145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 246245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 246345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2464e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2465e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2466e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2467e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2468e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2469475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2470475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2471e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2472e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2473e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2474e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2475e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2476e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2477e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2478e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2479e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2480cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2481cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2482e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2483e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2484e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2485e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2486e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2487e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2488e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 248945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 249045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2491e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 249245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 249345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2494e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2495e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2496e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2497e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2498e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 24991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2501b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVICmp(User &I) { 2502b43e9c196542acc80c9e4643809661065710848fNate Begeman ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2503b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VICmpInst *IC = dyn_cast<VICmpInst>(&I)) 2504b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = IC->getPredicate(); 2505b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2506b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = ICmpInst::Predicate(IC->getPredicate()); 2507475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2508475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2509b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Opcode; 2510b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2511b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 2512b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 2513b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 2514b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 2515b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 2516b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 2517b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 2518b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 2519b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 2520b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 2521b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2522b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid ICmp predicate value"); 2523b43e9c196542acc80c9e4643809661065710848fNate Begeman Opcode = ISD::SETEQ; 2524b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2525b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2526b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(Op1.getValueType(), Op1, Op2, Opcode)); 2527b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2528b43e9c196542acc80c9e4643809661065710848fNate Begeman 2529b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVFCmp(User &I) { 2530b43e9c196542acc80c9e4643809661065710848fNate Begeman FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2531b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VFCmpInst *FC = dyn_cast<VFCmpInst>(&I)) 2532b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FC->getPredicate(); 2533b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2534b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FCmpInst::Predicate(FC->getPredicate()); 2535475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2536475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2537b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Condition, FOC, FPC; 2538b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2539b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2540b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2541b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2542b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2543b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2544b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2545b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2546b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2547b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2548b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2549b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2550b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2551b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2552b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2553b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2554b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 2555b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2556b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid VFCmp predicate value"); 2557b43e9c196542acc80c9e4643809661065710848fNate Begeman FOC = FPC = ISD::SETFALSE; 2558b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2559b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2560b43e9c196542acc80c9e4643809661065710848fNate Begeman if (FiniteOnlyFPMath()) 2561b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FOC; 2562b43e9c196542acc80c9e4643809661065710848fNate Begeman else 2563b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FPC; 2564b43e9c196542acc80c9e4643809661065710848fNate Begeman 256583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2566b43e9c196542acc80c9e4643809661065710848fNate Begeman 2567b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(DestVT, Op1, Op2, Condition)); 2568b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2569b43e9c196542acc80c9e4643809661065710848fNate Begeman 25701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 2571475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Cond = getValue(I.getOperand(0)); 2572475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue TrueVal = getValue(I.getOperand(1)); 2573475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue FalseVal = getValue(I.getOperand(2)); 25747f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 25757f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 25761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 25783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 25803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 2581475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 258283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25833da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 25843da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 25873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 25883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 2589475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 259083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 25923da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 25933da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 25943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 25953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 25963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 2597475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 259883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 25993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 26003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26013da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 26033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 2604475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 260583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26060bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0))); 26073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26083da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26093da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 26103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 2611475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 261283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 26143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 26173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 2618475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 261983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 26213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26233da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 26243da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 2625475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 262683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 26283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26303da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 26313da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 2632475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 263383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 26353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26373da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 26383da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 2639475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 264083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 26423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26443da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 26453da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 26463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 2647475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 264883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 264983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2650475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Result; 26518e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 26523da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 26533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 26553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 26563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 26573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26593da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 26603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 26613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 2662475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 266383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 266483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26658e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 26663da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 26673da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26683da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 26693da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 26703da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 26713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 2673475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 267483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 26753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 26773da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 26783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 26793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 26803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 26813da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 26821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26842bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2685475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVec = getValue(I.getOperand(0)); 2686475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVal = getValue(I.getOperand(1)); 2687475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2688c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2689c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26907f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 26917f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 26927f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2693c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2694c7029805ef35ce9805931067b841e6af11db382eChris Lattner 26952bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2696475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVec = getValue(I.getOperand(0)); 2697475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2698384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 26997f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2700384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2701384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2702c7029805ef35ce9805931067b841e6af11db382eChris Lattner 27033e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 2704475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V1 = getValue(I.getOperand(0)); 2705475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V2 = getValue(I.getOperand(1)); 2706475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Mask = getValue(I.getOperand(2)); 27073e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27087f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 27097f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 27107f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 27113e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 27123e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27131d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitInsertValue(InsertValueInst &I) { 27141d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 27151d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op1 = I.getOperand(1); 27161d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = I.getType(); 27171d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = Op1->getType(); 27181d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool IntoUndef = isa<UndefValue>(Op0); 27191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool FromUndef = isa<UndefValue>(Op1); 27201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 27221d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 27231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> AggValueVTs; 27251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, AggTy, AggValueVTs); 27261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 27271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 27281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumAggValues = AggValueVTs.size(); 27301d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 2731475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumAggValues); 27321d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2733475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Agg = getValue(Op0); 2734475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = getValue(Op1); 27351d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned i = 0; 27361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy the beginning value(s) from the original aggregate. 27371d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex; ++i) 27381d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2739475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy values from the inserted value(s). 27411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex + NumValValues; ++i) 27421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = FromUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2743475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Val.Val, Val.ResNo + i - LinearIndex); 27441d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy remaining value(s) from the original aggregate. 27451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != NumAggValues; ++i) 27461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2747475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2749f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&AggValueVTs[0], NumAggValues), 2750f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumAggValues)); 2751041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2752041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 27531d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitExtractValue(ExtractValueInst &I) { 27541d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 27551d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = Op0->getType(); 27561d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = I.getType(); 27571d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool OutOfUndef = isa<UndefValue>(Op0); 27581d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27591d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 27601d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 27611d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27621d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 27631d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 27641d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 27651d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 2766475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumValValues); 27671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2768475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Agg = getValue(Op0); 27691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy out the selected value(s). 27701d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i) 27711d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i - LinearIndex] = 2772dded0fd398bf744454b2c9c95b68f4a27025f880Dan Gohman OutOfUndef ? DAG.getNode(ISD::UNDEF, Agg.Val->getValueType(Agg.ResNo + i)) : 2773475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue(Agg.Val, Agg.ResNo + i); 27741d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2775f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValValueVTs[0], NumValValues), 2776f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValValues)); 2777041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2778041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 27793e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 27801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 2781475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 27821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 27831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 27851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 27861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2787c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2788b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 27891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 27901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2791b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 27921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 27930bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offset)); 27941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 27951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 27961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 27971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 27987c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 27997c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 28007c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2801b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 280247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2803a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 28040bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 28050bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offs)); 28067c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 28077c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 28087c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 28097c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2810a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 2811475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue IdxN = getValue(Idx); 28127c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 28137c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 28147c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 281583785c80968165b30fcdd111ceb2c28d38bcff86Evan Cheng if (IdxN.getValueType().bitsLT(N.getValueType())) 281647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 281783785c80968165b30fcdd111ceb2c28d38bcff86Evan Cheng else if (IdxN.getValueType().bitsGT(N.getValueType())) 28187c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 28197c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 28207c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 28217c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 28226679906d9724868bf2198e04952ba42f31d7b7feDan Gohman if (ElementSize != 1) { 28236679906d9724868bf2198e04952ba42f31d7b7feDan Gohman if (isPowerOf2_64(ElementSize)) { 28246679906d9724868bf2198e04952ba42f31d7b7feDan Gohman unsigned Amt = Log2_64(ElementSize); 28256679906d9724868bf2198e04952ba42f31d7b7feDan Gohman IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 28266679906d9724868bf2198e04952ba42f31d7b7feDan Gohman DAG.getConstant(Amt, TLI.getShiftAmountTy())); 28276679906d9724868bf2198e04952ba42f31d7b7feDan Gohman } else { 28286679906d9724868bf2198e04952ba42f31d7b7feDan Gohman SDValue Scale = DAG.getIntPtrConstant(ElementSize); 28296679906d9724868bf2198e04952ba42f31d7b7feDan Gohman IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 28306679906d9724868bf2198e04952ba42f31d7b7feDan Gohman } 28311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28326679906d9724868bf2198e04952ba42f31d7b7feDan Gohman 28337c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 28341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 28361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 28371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 28401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 28411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 28421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 28431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 28441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2846514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 284758092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2848d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 284958092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 28501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2851475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AllocSize = getValue(I.getArraySize()); 285283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 28538e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(AllocSize.getValueType())) 285468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 28558e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(AllocSize.getValueType())) 285668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 28571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 285868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 28590bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(TySize)); 28601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28614515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 28624515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 28634515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 28641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 28651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 28664515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 28671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 28684515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 28694515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 28704515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 28714515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 28720bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(StackAlign-1)); 28734515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 28744515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 28750bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 28761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2877475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 287883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2879f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2880475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 28810da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 28820da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 28831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 28851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 28861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 28871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 28908a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Value *SV = I.getOperand(0); 2891475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ptr = getValue(SV); 28928a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 28938a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Type *Ty = I.getType(); 28948a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman bool isVolatile = I.isVolatile(); 28958a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned Alignment = I.getAlignment(); 28968a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 28978a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<MVT, 4> ValueVTs; 28988a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<uint64_t, 4> Offsets; 28998a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets); 29008a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned NumValues = ValueVTs.size(); 29018a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 29028a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 2903edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 2904475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root; 29058b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman bool ConstantMemory = false; 2906d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 29078b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman // Serialize volatile loads with other side effects. 2908d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 29098b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman else if (AA.pointsToConstantMemory(SV)) { 29108b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman // Do not serialize (non-volatile) loads of constant memory with anything. 29118b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman Root = DAG.getEntryNode(); 29128b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman ConstantMemory = true; 29138b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman } else { 2914d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 2915d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 2916d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 291728b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 2918475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumValues); 2919475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Chains(NumValues); 29201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 29211d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) { 2922475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getLoad(ValueVTs[i], Root, 29231d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 29241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 29251d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SV, Offsets[i], 29261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 29271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = L; 29281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Chains[i] = L.getValue(1); 29291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 29301d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29318b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman if (!ConstantMemory) { 2932475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 29338b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman &Chains[0], NumValues); 29348b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman if (isVolatile) 29358b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman DAG.setRoot(Chain); 29368b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman else 29378b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman PendingLoads.push_back(Chain); 29388b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman } 29391d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2940f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], NumValues), 2941f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValues)); 29421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 29461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 29471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Value *PtrV = I.getOperand(1); 29481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValueVTs; 29501d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<uint64_t, 4> Offsets; 29511d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets); 29521d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValues = ValueVTs.size(); 29538a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 29548a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 29551d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 295690d33ee746f354030a4144c4ffa028599663615bDan Gohman // Get the lowered operands. Note that we do this after 295790d33ee746f354030a4144c4ffa028599663615bDan Gohman // checking if NumResults is zero, because with zero results 295890d33ee746f354030a4144c4ffa028599663615bDan Gohman // the operands won't have values in the map. 295990d33ee746f354030a4144c4ffa028599663615bDan Gohman SDValue Src = getValue(SrcV); 296090d33ee746f354030a4144c4ffa028599663615bDan Gohman SDValue Ptr = getValue(PtrV); 296190d33ee746f354030a4144c4ffa028599663615bDan Gohman 2962475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 2963475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Chains(NumValues); 29641d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 29651d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool isVolatile = I.isVolatile(); 29661d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned Alignment = I.getAlignment(); 29671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) 2968475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Chains[i] = DAG.getStore(Root, SDValue(Src.Val, Src.ResNo + i), 29691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 29701d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 29711d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman PtrV, Offsets[i], 29721d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 29731d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 29741d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumValues)); 29751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29770eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 29780eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 29790eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 29800eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 2981a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 2982a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 2983a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 29840eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 2985475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops; 2986e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 2987e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 2988e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 2989e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 2990e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 2991e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 2992e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 2993e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 29940eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29950eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 29960eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 29970eade319cdb72e24c11d068728a98083737c6435Chris Lattner 29980eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 29990eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 3000475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getValue(I.getOperand(i)); 30010eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 30020eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 30030eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 30040eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30050eade319cdb72e24c11d068728a98083737c6435Chris Lattner 300683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands std::vector<MVT> VTs; 30070eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 300883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(I.getType()); 300983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (VT.isVector()) { 30109d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 301183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(DestTy->getElementType()); 30120eade319cdb72e24c11d068728a98083737c6435Chris Lattner 301383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands VT = MVT::getVectorVT(EltVT, DestTy->getNumElements()); 30140eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 30150eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30160eade319cdb72e24c11d068728a98083737c6435Chris Lattner 30170eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 30180eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 30190eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30200eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 30210eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 30220eade319cdb72e24c11d068728a98083737c6435Chris Lattner 302383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTList = DAG.getNodeValueTypes(VTs); 3024f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 30250eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 3026475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Result; 302748b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 3028f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 3029f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 303048b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 3031f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 3032f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 303348b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 3034f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 3035f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 303648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 3037e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 3038475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = Result.getValue(Result.Val->getNumValues()-1); 3039e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 3040e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 3041e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 3042e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 3043e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 30440eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 30459d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 304683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(PTy); 30477f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 30480eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30490eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 30500eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 30510eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 30520eade319cdb72e24c11d068728a98083737c6435Chris Lattner 3053b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 3054cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 30550b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov V = V->stripPointerCasts(); 3056b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 30574c71dfe356716e6bc1993ef5efdced08b68fe612Anton Korobeynikov assert ((GV || isa<ConstantPointerNull>(V)) && 3058cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 3059cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 3060cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 3061cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3062f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 3063cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 3064f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 3065f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 3066f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 3067f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 3068f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 3069f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 3070f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 3071f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 3072f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3073f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 3074f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 3075f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 3076cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 3077cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3078cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 3079cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 3080cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 30816590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 3082cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 3083cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3084cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 3085cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 3086cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 3087cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3088cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3089cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 3090cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3091cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 30926590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 30936590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 30946590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 30956590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 30966590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 30976590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 30986590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 30996590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 31006590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 31016590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 31026590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 3103cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3104cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 3105cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3106f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 3107cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3108cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 3109cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 3110cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 3111cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3112f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3113cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3114f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 3115f40708223e409a152834b1553c6883ff2035b957Duncan Sands 311663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 311763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang/// Inlined utility function to implement binary input atomic intrinsics for 311863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// visitIntrinsicCall: I is a call instruction 311963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// Op is the associated NodeType for I 312063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangconst char * 312163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P WangSelectionDAGLowering::implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op) { 3122475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3123475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getAtomic(Op, Root, 312463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang getValue(I.getOperand(1)), 3125fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(2)), 312628873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 312763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang setValue(&I, L); 312863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang DAG.setRoot(L.getValue(1)); 312963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return 0; 313063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang} 313163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 3132c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 3133c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 3134c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 3135c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 3136c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 3137c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 31380eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 31390eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 31400eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 31410eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 3142c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 3143c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 3144c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 3145bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 3146bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 3147bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3148bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3149bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 3150bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 3151bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3152bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3153c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 3154d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 3155c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 3156c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 3157d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 3158c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 315903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 3160707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memcpy_i64: { 3161475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3162475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3163475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3164707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3165707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3166707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 316703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3168707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 316903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 3170707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memset_i64: { 3171475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3172475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3173475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3174707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3175707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align, 3176707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0)); 317703dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3178707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 317903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 3180707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memmove_i64: { 3181475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3182475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3183475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3184707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3185707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3186707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // If the source and destination are known to not be aliases, we can 3187707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // lower memmove as memcpy. 3188707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman uint64_t Size = -1ULL; 3189707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 3190707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman Size = C->getValue(); 3191707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (AA.alias(I.getOperand(1), Size, I.getOperand(2), Size) == 3192707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman AliasAnalysis::NoAlias) { 3193707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3194707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 3195707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman return 0; 3196707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 3197707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3198707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align, 3199707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 320003dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3201707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 320286cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 320344c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 320443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 320544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 320644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 3207ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 32087f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman DAG.setRoot(DAG.getDbgStopPoint(getRoot(), 32097f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getLine(), 32107f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getColumn(), 32117f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman cast<CompileUnitDesc>(DD))); 321286cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 321343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3214b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 321536ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 321643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 321744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 321843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 321944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 322044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 32214406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 322243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 322343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3224b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 322543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 322643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 322744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 322843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 322944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 323044c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 32314406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 323243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 323343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3234b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 323543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 323643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 323744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 32381b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (!MMI) return 0; 323943970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 32401b08bbca5592351a940bcd164bdec724ee954326Evan Cheng Value *SP = FSI.getSubprogram(); 32411b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (SP && MMI->Verify(SP)) { 32421b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is 32431b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // what (most?) gdb expects. 32441b08bbca5592351a940bcd164bdec724ee954326Evan Cheng DebugInfoDesc *DD = MMI->getDescFor(SP); 32451b08bbca5592351a940bcd164bdec724ee954326Evan Cheng assert(DD && "Not a debug information descriptor"); 32461b08bbca5592351a940bcd164bdec724ee954326Evan Cheng SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD); 32471b08bbca5592351a940bcd164bdec724ee954326Evan Cheng const CompileUnitDesc *CompileUnit = Subprogram->getFile(); 324899fe47bc81d53762454ff112ab34378b00299b5aDan Gohman unsigned SrcFile = MMI->RecordSource(CompileUnit); 32491b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // Record the source line but does create a label. It will be emitted 32501b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // at asm emission time. 32511b08bbca5592351a940bcd164bdec724ee954326Evan Cheng MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile); 325243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 325343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3254b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 325543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 325643970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 325744c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 325843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 3259a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng Value *Variable = DI.getVariable(); 3260a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng if (MMI && Variable && MMI->Verify(Variable)) 3261a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(), 3262a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng getValue(DI.getAddress()), getValue(Variable))); 326343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 326443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 3265c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3266b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 32671532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (!CurMBB->isLandingPad()) { 32681532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // FIXME: Mark exception register as live in. Hack for PR1508. 32691532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen unsigned Reg = TLI.getExceptionAddressRegister(); 32701532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (Reg) CurMBB->addLiveIn(Reg); 3271735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 32721532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Insert the EXCEPTIONADDR instruction. 32731532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 3274475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[1]; 32751532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Ops[0] = DAG.getRoot(); 3276475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 32771532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, Op); 32781532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.setRoot(Op.getValue(1)); 3279b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3280b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3281b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 32828806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 32838806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 3284b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 328583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 32868806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 32878806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 32881532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 3289f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 3290f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 3291e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 3292f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 3293f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 3294f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 3295902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 3296902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 3297902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 3298e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 3299735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3300735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 33018806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 3302475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[2]; 3303735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 3304735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 3305475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 3306735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 3307735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 33087a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 33098806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 3310b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3311b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3312b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3313b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 33148806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 33158806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 33168806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 3317b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 331883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 33198806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 3320735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3321735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 3322735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 3323cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 33243b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 3325735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 33268806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 33277a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 3328f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 33298806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 3330b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3331b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3332b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3333b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3334b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 33352365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 33362365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 33372365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33381532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 33392365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 33402365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 33412365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 334286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman getControlRoot(), 33432365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 33442365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 33452365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 33462365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 33472365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33482365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33492365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33502365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33512365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33522365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 33532365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 33542365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 33552365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33562365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33572365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33582365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33592365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33602365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 336183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = getValue(I.getOperand(1)).getValueType(); 3362475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CfaArg; 33638e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 33641532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::TRUNCATE, 33651532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 33661532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen else 33671532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 33681532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 33691532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen 3370475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Offset = DAG.getNode(ISD::ADD, 33711532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33721532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 33731532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy()), 33741532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg); 33751532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, DAG.getNode(ISD::ADD, 33761532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33771532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAMEADDR, 33781532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 33791532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getConstant(0, 33801532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy())), 33811532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Offset)); 33822365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 33832365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 33842365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 33859ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 3386c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 3387c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 3388c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 3389c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 33909ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 33916ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 33926ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 33936ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 33946ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 33956ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 3396ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 3397ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 3398ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3399ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3400ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3401ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 3402ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 3403ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3404ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3405ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3406ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 3407ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 3408ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3409ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 3410ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 3411ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3412c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 3413475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 3414c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 3415c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3416c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 34178b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 3418475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getRoot(); 3419475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 3420f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 3421f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 34228b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 34238b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 342451b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 34258b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 3426c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 34273f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 3428f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 3429f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 3430f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 3431f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 3432f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 3433f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 34343f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 3435addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 3436a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 3437d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 3438d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 3439d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 3440d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 3441a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 3442475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 344383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3444475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTTZ, Ty, Arg); 3445a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3446c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3447a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3448a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 3449475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 345083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3451475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTLZ, Ty, Arg); 3452a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3453c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3454a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3455a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 3456475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 345783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3458475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTPOP, Ty, Arg); 3459a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3460c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3461a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3462140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 3463475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getRoot(); 3464475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::STACKSAVE, 3465f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 3466140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 3467140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 3468140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 3469140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 347039a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 3471475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 347239a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 3473140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 347439a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 347524e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 347624e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 347724e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 347836397f50343639ce9a25996f2d790c656791ab92Duncan Sands 347936397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 34800b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts()); 348136397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3482475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[6]; 348336397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 348436397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 348536397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 348636397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 348736397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 348836397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 348936397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3490475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::TRAMPOLINE, 3491f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 3492f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 3493f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 3494f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 3495f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 3496f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 349736397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 349836397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 3499ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3500ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcroot: 35015eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (GFI) { 3502ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Value *Alloca = I.getOperand(1); 3503ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Constant *TypeMap = cast<Constant>(I.getOperand(2)); 3504ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3505ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).Val); 35065eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI->addStackRoot(FI->getIndex(), TypeMap); 3507ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen } 3508ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3509ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3510ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcread: 3511ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcwrite: 35125eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen assert(0 && "GC failed to lower gcread/gcwrite intrinsics!"); 3513ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3514ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3515917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 35161a0248690aaa9f7baaf1247e5f65a1c0c9e3783cDan Gohman setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32)); 3517917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 3518917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 351966fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov 352066fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov case Intrinsic::trap: { 352166fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot())); 352266fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov return 0; 352366fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov } 352427b7db549e4c5bff4579d209304de5628513edebEvan Cheng case Intrinsic::prefetch: { 3525475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[4]; 352627b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[0] = getRoot(); 352727b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[1] = getValue(I.getOperand(1)); 352827b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[2] = getValue(I.getOperand(2)); 352927b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[3] = getValue(I.getOperand(3)); 353027b7db549e4c5bff4579d209304de5628513edebEvan Cheng DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4)); 353127b7db549e4c5bff4579d209304de5628513edebEvan Cheng return 0; 353227b7db549e4c5bff4579d209304de5628513edebEvan Cheng } 353327b7db549e4c5bff4579d209304de5628513edebEvan Cheng 353422c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth case Intrinsic::memory_barrier: { 3535475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[6]; 353622c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[0] = getRoot(); 353722c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth for (int x = 1; x < 6; ++x) 353822c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[x] = getValue(I.getOperand(x)); 353922c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth 354022c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6)); 354122c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth return 0; 354222c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth } 354328873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_cmp_swap: { 3544475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3545475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, Root, 3546ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(1)), 3547ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth getValue(I.getOperand(2)), 3548fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(3)), 354928873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 3550ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3551ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3552ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3553ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 355428873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_add: 355528873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD); 355628873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_sub: 355728873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB); 355863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_and: 355963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND); 356063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_or: 356163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR); 356263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_xor: 356363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR); 3564507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth case Intrinsic::atomic_load_nand: 3565507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND); 356663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_min: 356763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN); 356863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_max: 356963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX); 357063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umin: 357163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN); 357263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umax: 357363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX); 357463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_swap: 357563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP); 3576c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3577c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 3578c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3579c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3580475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDValue Callee, 35811da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 3582070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 35836f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 3584735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 3585070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 3586070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 35876f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3588735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 3589735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 35906f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 35916f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 35926f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 3593475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ArgNode = getValue(*i); 35946f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 35956f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 35966f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 35976f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 35986f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 35996f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 36006f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 36016f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 36026f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 360308e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen Entry.Alignment = CS.getParamAlignment(attrInd); 3604735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 3605735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 3606735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 36071532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3608070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 3609070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 3610070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 3611a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // Both PendingLoads and PendingExports must be flushed here; 3612a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // this call might not return. 3613a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen (void)getRoot(); 36144406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getControlRoot(), BeginLabel)); 3615070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 36166f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3617475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 36186f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 36196f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 362000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CS.paramHasAttr(0, ParamAttr::ZExt), 36216f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 3622735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 36236f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 36246f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 3625735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 3626070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 36271532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3628070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 3629070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 3630070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 36314406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getRoot(), EndLabel)); 3632070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 36336f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 3634070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 3635070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 3636735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 3637735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3638735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 36391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 364064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 3641c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 364287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3643c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3644c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3645c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3646c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 364787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 364887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 364987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 365087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 365187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 365287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 365387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 365487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 365587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 365687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 365787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 365887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 365987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 366087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 366187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 3662475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue LHS = getValue(I.getOperand(1)); 3663475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RHS = getValue(I.getOperand(2)); 366487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 366587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 366687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 366787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 366887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 366987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 36702f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 36712f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 367287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 367387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 367487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3675475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 367687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 367787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 367887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 367987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 368087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 36812f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 36822f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 368387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 368487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 368587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3686475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 368787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 368887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 368987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 369087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 369187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 36922f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 36932f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 369487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 369587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 369687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3697475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 369887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 369987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3700f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3701c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 370287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3703ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3704fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3705ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3706c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3707edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3708475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Callee; 370964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 371064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 371164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 371264e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3713070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 37146f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 37151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 37161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3717735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3718b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3719b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 3720b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3721b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3722475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 3723475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, 3724475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue *Flag) const { 372523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Assemble the legal parts into the final values. 3726475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(ValueVTs.size()); 3727475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Parts; 37286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 372923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Copy the legal parts from the registers. 373083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 373123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 373283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 373323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 37346833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Parts.resize(NumRegs); 373523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3736475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue P; 37376833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 37386833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT); 37396833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 37406833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag); 374123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman *Flag = P.getValue(2); 37426833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 37436833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = P.getValue(1); 3744ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3745ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If the source register was virtual and if we know something about it, 3746ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // add an assert node. 3747ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) && 3748ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT.isInteger() && !RegisterVT.isVector()) { 3749ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister; 3750ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 3751ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FLI.LiveOutRegInfo.size() > SlotNo) { 3752ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo]; 3753ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3754ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned RegSize = RegisterVT.getSizeInBits(); 3755ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits = LOI.NumSignBits; 3756ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes(); 3757ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3758ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // FIXME: We capture more information than the dag can represent. For 3759ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // now, just use the tightest assertzext/assertsext possible. 3760ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner bool isSExt = true; 3761ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT FromVT(MVT::Other); 3762ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits == RegSize) 3763ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1 3764ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-1) 3765ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1 3766ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-8) 3767ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8 3768ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-9) 3769ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8 3770ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-16) 3771ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16 3772ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-17) 3773ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16 3774ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-32) 3775ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32 3776ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-33) 3777ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32 3778ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3779ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FromVT != MVT::Other) { 3780ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, 3781ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT, P, DAG.getValueType(FromVT)); 3782ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 3783ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3784ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3785ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 3786ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 378723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Parts[Part+i] = P; 378823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3789b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 379023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Values[Value] = getCopyFromParts(DAG, &Parts[Part], NumRegs, RegisterVT, 379123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ValueVT); 379223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumRegs; 379323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 37944bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands 3795f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands return DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], ValueVTs.size()), 3796f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], ValueVTs.size()); 3797b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 3798b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3799b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 3800b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 3801b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 3802b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 3803475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanvoid RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, 3804475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const { 3805b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 380623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = Regs.size(); 3807475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Parts(NumRegs); 38086833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 380983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 381023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumParts = TLI->getNumRegisters(ValueVT); 381183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 381223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 381323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman getCopyToParts(DAG, Val.getValue(Val.ResNo + Value), 381423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Parts[Part], NumParts, RegisterVT); 381523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumParts; 381623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3817b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 3818b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 3819475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Chains(NumRegs); 382023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 3821475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Part; 38226833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 38236833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 38246833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 38256833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag); 3826b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 38276833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 38286833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chains[i] = Part.getValue(0); 3829c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 38306833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 383133bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng if (NumRegs == 1 || Flag) 383233bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is 383333bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // flagged to it. That is the CopyToReg nodes and the user are considered 383433bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // a single scheduling unit. If we create a TokenFactor and return it as 383533bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // chain, then the TokenFactor is both a predecessor (operand) of the 383633bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // user as well as a successor (the TF operands are flagged to the user). 383733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c1, f1 = CopyToReg 383833bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c2, f2 = CopyToReg 383933bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c3 = TokenFactor c1, c2 384033bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // ... 384133bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // = op c3, ..., f2 384233bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng Chain = Chains[NumRegs-1]; 38436833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else 38446833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 3845c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3846864635ad7b3046d3042311423071152c613961deChris Lattner 3847c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 3848c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 3849c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 3850c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 3851475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> &Ops) const { 385283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 38534b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 38546833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) { 38556833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]); 385683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 38576833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned i = 0; i != NumRegs; ++i) 38586833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT)); 385923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 3860c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 3861864635ad7b3046d3042311423071152c613961deChris Lattner 3862864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 3863864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 3864864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 3865864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 38669b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 38676f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetLowering &TLI, 38686f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI) { 386983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT FoundVT = MVT::Other; 3870f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 38716f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 38726f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman E = TRI->regclass_end(); RCI != E; ++RCI) { 387383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::Other; 3874f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 38759b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 38769b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 38779b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 38789b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 38799b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 38809b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 3881f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 3882f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 3883f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 38848e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) { 3885f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 3886f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3887f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 38889b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 38899b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 38909b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3891f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 38929b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 3893864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 3894864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 3895864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 3896864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 38979b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 38989b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 3899f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 3900f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 3901f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 3902f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 3903f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 3904f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 3905f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 3906864635ad7b3046d3042311423071152c613961deChris Lattner } 3907f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 3908864635ad7b3046d3042311423071152c613961deChris Lattner} 3909864635ad7b3046d3042311423071152c613961deChris Lattner 3910bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3911bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 3912bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 3913bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 39145c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengstruct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo { 39155c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// CallOperand - If this is the result output operand or a clobber 39165c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// this is null, otherwise it is the incoming operand to the CallInst. 39175c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// This gets modified as the asm is processed. 3918475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CallOperand; 39195c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng 3920e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 3921e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 3922e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 3923e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 392423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 39255c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 3926bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 3927bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3928e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 3929e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 3930e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 3931e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 39327cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner std::set<unsigned> &InputRegs, 39337cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) const { 39347cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isOutReg) { 39357cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 39367cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 39377cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39387cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isInReg) { 39397cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 39407cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 39417cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39427cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 39437cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner 39447cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattnerprivate: 39457cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// MarkRegAndAliases - Mark the specified register and all aliases in the 39467cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// specified set. 39477cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 39487cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) { 39497cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 39507cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(Reg); 39517cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 39527cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (; *Aliases; ++Aliases) 39537cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(*Aliases); 39547cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 3955bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 3956bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 3957bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 3958bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 39590fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// GetRegistersForValue - Assign registers (virtual or physical) for the 39600fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// specified operand. We prefer to assign virtual registers, to allow the 39610fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// register allocator handle the assignment process. However, if the asm uses 39620fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// features that we can't model on machineinstrs, we have SDISel do the 39630fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// allocation. This produces generally horrible, but correct, code. 39640fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 39650fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// OpInfo describes the operand. 39660fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// HasEarlyClobber is true if there are any early clobber constraints (=&r) 39670fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// or any explicitly clobbered registers. 39680fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// Input and OutputRegs are the set of already allocated physical registers. 39690fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 3970e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 39715c80760fdf71659c5bdf45cd85d173df454dfb41Evan ChengGetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 3972864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 39734e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 3974e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 3975e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 3976e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 3977e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 3978e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 3979e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 3980e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3981e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3982e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 3983e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 3984e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 3985e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 3986e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3987e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 3988e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3989e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 3990e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3991e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 3992e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 3993e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 3994e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 3995e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 3996e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3997e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 3998e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 3999b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SmallVector<unsigned, 4> Regs; 4000e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4001e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 4002e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 4003e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 4004e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 4005e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 4006864635ad7b3046d3042311423071152c613961deChris Lattner 4007bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 4008bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 4009b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 401083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegVT; 401183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = OpInfo.ConstraintVT; 4012864635ad7b3046d3042311423071152c613961deChris Lattner 4013bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 40142a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 40152a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 4016864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 4017bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 4018864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 4019cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 4020cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 4021cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 4022cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 4023cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 4024864635ad7b3046d3042311423071152c613961deChris Lattner 4025864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 4026864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 4027864635ad7b3046d3042311423071152c613961deChris Lattner 4028864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 4029864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 4030864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 4031864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 403250871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Didn't find reg!"); 4033864635ad7b3046d3042311423071152c613961deChris Lattner 4034864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 4035864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 4036864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 403750871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Ran out of registers to allocate!"); 4038864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 4039864635ad7b3046d3042311423071152c613961deChris Lattner } 4040864635ad7b3046d3042311423071152c613961deChris Lattner } 404123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 40427cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 40437cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4044e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4045864635ad7b3046d3042311423071152c613961deChris Lattner } 4046864635ad7b3046d3042311423071152c613961deChris Lattner 40472a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 40482a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 40492a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 4050c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 4051c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 40522a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 40532a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 40542a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 4055e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 4056e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 4057e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 4058e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 4059e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 40602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 40613a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 4062bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 40633a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 40642a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40652a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 406684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo = MF.getRegInfo(); 40672a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 406884bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second)); 40692a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 407023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 4071e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 40722a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 40732a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40742a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 40752a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 40762a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 40772a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 40782a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 40792a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 40802a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 40812a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 4082bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 4083bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 40842a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 4085e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 40866f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 4087864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 4088864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 4089864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 40904e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 4091864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 4092864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 4093864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 4094864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 4095864635ad7b3046d3042311423071152c613961deChris Lattner continue; 4096864635ad7b3046d3042311423071152c613961deChris Lattner } 4097864635ad7b3046d3042311423071152c613961deChris Lattner 40984e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 40994e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 4100c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 41016f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman RC = isAllocatableRegister(Reg, MF, TLI, TRI); 4102c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 4103c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 4104c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 4105c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 4106c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 41074e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 41084e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 4109864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 4110864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 4111864635ad7b3046d3042311423071152c613961deChris Lattner 4112e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 4113864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 4114864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 4115864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 4116864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 4117e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 4118e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 4119864635ad7b3046d3042311423071152c613961deChris Lattner 412023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(), 4121e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 41227cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4123e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4124864635ad7b3046d3042311423071152c613961deChris Lattner } 41254e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 4126864635ad7b3046d3042311423071152c613961deChris Lattner 4127864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 41284e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 41294e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 41303ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 4131ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 4132ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 4133fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 4134fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 4135ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41360c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 41375c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng std::vector<SDISelAsmOperandInfo> ConstraintOperands; 4138ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4139475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = getRoot(); 4140475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Flag; 4141ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 41424e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 41430c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 41440c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 41450c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 41460c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 41470c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 4148e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4149e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 4150e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 4151e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 4152e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 4153e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4154fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 4155acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner unsigned ResNo = 0; // ResNo - The result number of the next output. 41560c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 41575c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 41585c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 41590c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 416083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OpVT = MVT::Other; 41611efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 41620c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 41630c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 41641efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 4165acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // Indirect outputs just consume an argument. 4166acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (OpInfo.isIndirect) { 4167fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 4168acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner break; 4169acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } 4170acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // The return value of the call is this value. As such, there is no 4171acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // corresponding argument. 4172acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 4173acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (const StructType *STy = dyn_cast<StructType>(CS.getType())) { 4174acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(STy->getElementType(ResNo)); 4175acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } else { 4176acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(ResNo == 0 && "Asm only has one result!"); 4177acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(CS.getType()); 41781efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 4179acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner ++ResNo; 41801efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41811efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 4182fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 41831efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41841efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 41850c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 41861efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 41871efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 41880c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 41890c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 4190eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 41910c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 4192507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) 4193507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]); 4194eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 4195eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 4196eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 4197eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 4198eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 4199eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 4200eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 4201eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 42024fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman // If OpTy is not a single value, it may be a struct/union that we 4203eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 42044fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman if (!OpTy->isSingleValueType() && OpTy->isSized()) { 4205eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 4206eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 4207eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 4208eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 4209eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 4210eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 4211eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 4212eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 4213eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 4214eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 4215eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 42166995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 4217eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 4218eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 42190c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42211efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 42220c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 42232a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 42243ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 42255a09690446a36f94f990db7d18d9b9ac8587888aChris Lattner TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG); 42261efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 4227e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 4228e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 422909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 42300fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner // If we see a clobber of a register, it is an early clobber. 423169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (!SawEarlyClobber && 423269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.Type == InlineAsm::isClobber && 423369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) { 423469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // Note that we want to ignore things that we don't trick here, like 423569e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // dirflag, fpsr, flags, etc. 423669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 423769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 423869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintVT); 423969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (PhysReg.first || PhysReg.second) { 424069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // This is a register we know of. 424169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner SawEarlyClobber = true; 424269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 424369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 42440fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner 424509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 424609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 424709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 424809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 424909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 425009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 425109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 425209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 425309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 425409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 425509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 425609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 425709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 425809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 425909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 426009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 426109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 426209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 426309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 426409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 426509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 426609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 4267514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 426809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 426909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 427009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 4271475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 427209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 427309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 427409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 427509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 427609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 427709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 427809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 427909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 428009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 428109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 4282e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 4283e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 4284e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 4285e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 42860c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 42870c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 42880c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 42890c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 4290e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 4291e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 4292e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 42935c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 4294e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4295e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 4296e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 4297e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 4298e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 4299e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 4300e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 43010c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 4302475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> AsmNodeOperands; 4303475871a144eb604ddaf37503397ba0941442e5fbDan Gohman AsmNodeOperands.push_back(SDValue()); // reserve space for input chain 43040c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 43050c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 43060c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 43072cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 43080f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 43090f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 4310864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 431141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 43120c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 4313864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 43140f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 43150c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 43165c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 43171efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 43180c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 43192cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 4320c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 4321c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 4322f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 432309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 432422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 432522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 432622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4327c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4328c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 432909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 433022873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 433122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 433222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 43332a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 433422873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 4335864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 4336864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 4337e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 4338a47c6c37034f4e57bc8187e959da4eadb6e24afaDuncan Sands cerr << "Couldn't allocate output reg for constraint '" 43390c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 4340d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 4341d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 43422cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 434341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // If this is an indirect operand, store through the pointer after the 434441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // asm. 434541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner if (OpInfo.isIndirect) { 4346e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 43470c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 434841f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } else { 434941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // This is the result value of the call. 435041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 435141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // Concatenate this output onto the outputs list. 435241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RetValRegs.append(OpInfo.AssignedRegs); 43532cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 43546656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 43556656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 43566656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 4357e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 4358e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 43596656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 43606656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 43616656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 4362475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InOperandVal = OpInfo.CallOperand; 43633d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 43640c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 43652223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 43662223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 43670c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 43683d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 4369c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 4370c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 4371c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 4372c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 4373c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 4374c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4375c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4376a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 4377a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 4378c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 4379c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 4380c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 4381c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4382c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4383c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4384527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 4385527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 4386527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 438723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.TLI = &TLI; 43881fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType()); 43891fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.RegVTs.push_back(AsmNodeOperands[CurOp+1].getValueType()); 4390527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 4391527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 4392527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 4393527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 4394527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 4395c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4396527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 4397b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 4398527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 4399527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 4400527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 4401527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 4402f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner assert((NumOps >> 3) == 1 && "Unexpected number of operands"); 4403f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner // Add information to the INLINEASM node to know about this input. 4404f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4405f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4406f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner TLI.getPointerTy())); 4407f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 4408f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner break; 4409c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 441087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 441187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 44122a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 44130c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 441444b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 441544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 4416475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> Ops; 441748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 441848884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 441948884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 4420832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 44210c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 442253069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 442353069fbbae2558a3138df24776448791fea3aceeChris Lattner } 4424c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 442587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 442648884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 4427c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4428c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 442948884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 443087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 44312a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 443209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 443344b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 443444b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 443544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 443687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 443787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4438c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4439c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 444087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 4441c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 44422223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 444387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 44442a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 44452a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 44462a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 44470c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 444844b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 444987bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 445087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 4451e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 4452e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 445387bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4454b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 445587bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4456e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 4457e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 44586656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 44596656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4460c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 4461c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 4462c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 4463e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 4464e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 4465e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 44666656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 44676656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4468c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 44696656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4470ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4471ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 4472ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 4473ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner if (Flag.Val) AsmNodeOperands.push_back(Flag); 4474ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4475f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 4476f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 4477bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 4478ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 4479ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 44806656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 44816656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 44823a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 4483475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 44843fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 44853fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // If any of the results of the inline asm is a vector, it may have the 44863fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // wrong width/num elts. This can happen for register classes that can 44873fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // contain multiple different value types. The preg or vreg allocated may 44883fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // not have the same VT as was expected. Convert it to the right type with 44897f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 44903fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner if (const StructType *ResSTy = dyn_cast<StructType>(CS.getType())) { 44913fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner for (unsigned i = 0, e = ResSTy->getNumElements(); i != e; ++i) { 449283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.Val->getValueType(i).isVector()) 44933fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, 44943fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner TLI.getValueType(ResSTy->getElementType(i)), Val); 44953fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } 44963fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } else { 449783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.getValueType().isVector()) 44983fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, TLI.getValueType(CS.getType()), 44993fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val); 45003a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 45013fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 4502fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 45033a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 45046656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 4505475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<std::pair<SDValue, Value*> > StoresToEmit; 45066656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 45076656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 45086656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 45096656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 4510864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 45116656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 4512475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 4513864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 45146656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4515ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 45166656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 4517475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> OutChains; 45186656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 45190c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 45206656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 45218b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 45226656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 4523bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 4524bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 4525ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 4526ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 4527ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4528ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 45291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 4530475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = getValue(I.getOperand(0)); 45311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 453283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 453368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 45348e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(Src.getValueType())) 453568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 45368e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(Src.getValueType())) 453768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 45381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 4540514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 45411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 45420bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner Src, DAG.getIntPtrConstant(ElementSize)); 45431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 454447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 454547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 454647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 454747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 454847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 4549cf5734dddd66af9388a171b44996505ede47feedChris Lattner 4550475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 455100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C, 455200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG); 4553cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 4554cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 45551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 455847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 455947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 456047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 456147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 456247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 456383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 4564475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 456500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, 456600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CallingConv::C, true, 4567cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 4568cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 45691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4571ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 4572ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 4573025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 4574025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 4575025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 4576ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 4577025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 4578832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 4579832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 4580ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng << "TargetLowering::EmitInstrWithCustomInserter!\n"; 4581025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 4582025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 4583025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 4584025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 458539ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 4586acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 4587acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4588acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 458939ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 459039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 45911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 4592475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 4593acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 4594acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 4595acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 4596acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 45971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 45981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 45991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 4600acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 4601acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4602acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 46031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 46041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 46051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 4606acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 4607acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4608acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 4609acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 4610acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 46111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 46121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4613fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 4614fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 4615f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 4616f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 4617a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohmanvoid TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG, 4618475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVectorImpl<SDValue> &ArgValues) { 4619fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 4620475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 3+16> Ops; 46218c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 4622fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 4623fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 4624fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4625fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 4626a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVector<MVT, 16> RetVals; 46276aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 4628ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 4629ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 4630f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4631f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4632f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4633f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4634f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4635f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4636f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4637f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4638f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4639f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4640f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ZExt)) 4641f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4642f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::SExt)) 4643f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4644f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::InReg)) 4645f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4646f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::StructRet)) 4647f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4648f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ByVal)) { 4649f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4650f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(I->getType()); 4651f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4652f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4653f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4654f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should be passed from FE. BE will guess if 4655f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // this info is not there but there are cases it cannot get right. 4656f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.getParamAlignment(j)) 4657f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = F.getParamAlignment(j); 4658f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4659f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4660f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4661f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::Nest)) 4662f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4663f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4664b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4665f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT RegisterVT = getRegisterType(VT); 4666f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4667f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 4668f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman RetVals.push_back(RegisterVT); 4669f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4670f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumRegs > 1 && i == 0) 4671f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4672f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4673f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i > 0) 4674f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4675f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4676f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4677b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 4678fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 46793b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 46808c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 4681fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4682fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 4683f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 468486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner DAG.getVTList(&RetVals[0], RetVals.size()), 4685bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &Ops[0], Ops.size()).Val; 468686ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 468786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but 468886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // allows exposing the loads that may be part of the argument access to the 468986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // first DAGCombiner pass. 4690475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue TmpRes = LowerOperation(SDValue(Result, 0), DAG); 469186ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 469286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // The number of results should match up, except that the lowered one may have 469386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // an extra flag result. 469486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner assert((Result->getNumValues() == TmpRes.Val->getNumValues() || 469586ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner (Result->getNumValues()+1 == TmpRes.Val->getNumValues() && 469686ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag)) 469786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner && "Lowering produced unexpected number of results!"); 46982dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman 46992dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman // The FORMAL_ARGUMENTS node itself is likely no longer needed. 47002dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman if (Result != TmpRes.Val && Result->use_empty()) { 47012dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman HandleSDNode Dummy(DAG.getRoot()); 47022dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman DAG.RemoveDeadNode(Result); 47032dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman } 47042dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman 470586ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner Result = TmpRes.Val; 470686ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 470727a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 4708475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DAG.setRoot(SDValue(Result, NumArgRegs)); 4709fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4710fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 4711fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 471247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 471347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 471447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 4715f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4716f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4717f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4718f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4719f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4720f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 4721f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4722f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 4723475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 4724f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned j = 0; j != NumParts; ++j) 4725475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Parts[j] = SDValue(Result, i++); 4726f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4727f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE; 4728f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(Idx, ParamAttr::SExt)) 4729f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertSext; 4730f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 4731f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertZext; 4732f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4733a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman ArgValues.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT, 4734a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman AssertOp)); 4735f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4736fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 473727a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 4738fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 4739fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4740f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4741f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 4742f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 4743f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 4744f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 4745475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstd::pair<SDValue, SDValue> 4746475871a144eb604ddaf37503397ba0941442e5fbDan GohmanTargetLowering::LowerCallTo(SDValue Chain, const Type *RetTy, 474700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands bool RetSExt, bool RetZExt, bool isVarArg, 474800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands unsigned CallingConv, bool isTailCall, 4749475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Callee, 4750f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 4751475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 4752f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 4753f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 4754f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 4755f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 4756f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 4757f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4758f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 4759f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 4760f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4761f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, Args[i].Ty, ValueVTs); 4762f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4763f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4764f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4765f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4766475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = SDValue(Args[i].Node.Val, Args[i].Node.ResNo + Value); 4767f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4768f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4769f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4770f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4771f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isZExt) 4772f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4773f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 4774f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4775f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isInReg) 4776f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4777f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSRet) 4778f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4779f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isByVal) { 4780f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4781f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(Args[i].Ty); 4782f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4783f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4784f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4785f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should come from FE. BE will guess if this 4786f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // info is not there but there are cases it cannot get right. 4787f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].Alignment) 4788f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = Args[i].Alignment; 4789f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4790f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4791f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4792f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isNest) 4793f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4794f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4795f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4796f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 4797f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 4798475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 4799f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 4800f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4801f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 4802f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 4803f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (Args[i].isZExt) 4804f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 4805f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4806f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind); 4807f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4808f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumParts; ++i) { 4809f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4810f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4811f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumParts > 1 && i == 0) 4812f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4813f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i != 0) 4814f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4815f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4816f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(Parts[i]); 4817f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4818f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 481927a70be55f8b63181598d144d034b396402be66eDan Gohman } 4820f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4821f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4822ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Figure out the result value types. We start by making a list of 482323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // the potentially illegal return value types. 482483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> LoweredRetTys; 482583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RetTys; 482623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(*this, RetTy, RetTys); 4827ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 482823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Then we translate that to a list of legal types. 482923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 483083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 483183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 4832ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4833ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 4834ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(RegisterVT); 4835ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4836f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4837ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(MVT::Other); // Always has a chain. 4838f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4839b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 4840475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Res = DAG.getNode(ISD::CALL, 4841ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&LoweredRetTys[0], 4842ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.size()), 4843be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 4844ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Chain = Res.getValue(LoweredRetTys.size() - 1); 4845b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4846b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 4847b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 484800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 484900fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 485000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands if (RetSExt) 485100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands AssertOp = ISD::AssertSext; 485200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands else if (RetZExt) 4853b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 485400fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 4855475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> ReturnValues; 4856ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNo = 0; 485723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 485883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 485983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 4860ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4861ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNoEnd = NumRegs + RegNo; 4862475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Results; 4863ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (; RegNo != RegNoEnd; ++RegNo) 4864ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Results.push_back(Res.getValue(RegNo)); 4865475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ReturnValue = 4866ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, 4867ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman AssertOp); 4868ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman ReturnValues.push_back(ReturnValue); 4869ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 4870f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands Res = DAG.getMergeValues(DAG.getVTList(&RetTys[0], RetTys.size()), 4871f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &ReturnValues[0], ReturnValues.size()); 4872f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 4873b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4874b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 4875f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 4876f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 4877475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) { 4878171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 4879171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 4880475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); 4881171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 4882171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 48830aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 48847041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 48857041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 48867041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 48871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 488883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sandsunsigned SelectionDAGISel::MakeReg(MVT VT) { 488984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 48901c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48911c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4892495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 4893c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 48945eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 4895c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 4896495a0b51915eb763576874f29192820b731edc22Chris Lattner} 48971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 48995f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 49005f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 49015f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 49021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 49035eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (MF.getFunction()->hasGC()) 49045eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = &getAnalysis<GCModuleInfo>().getFunctionInfo(*MF.getFunction()); 4905ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 49065eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = 0; 490784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner RegInfo = &MF.getRegInfo(); 4908832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 49091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo FuncInfo(TLI, Fn, MF); 49111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49121532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 49131532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 49141532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 49151532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen FuncInfo.MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 49169fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 49170e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman SelectAllBasicBlocks(Fn, MF, FuncInfo); 4918edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 4919ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 4920ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 4921ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB = FuncInfo.MBBMap[EntryBB]; 492284bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner if (!RegInfo->livein_empty()) 492384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 492484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner E = RegInfo->livein_end(); I != E; ++I) 4925ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 4926ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 4927f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4928f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(FuncInfo.CatchInfoFound.size() == FuncInfo.CatchInfoLost.size() && 4929f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 4930f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4931f40708223e409a152834b1553c6883ff2035b957Duncan Sands 49321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 49331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 49341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 49356833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattnervoid SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) { 4936475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getValue(V); 493718c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 4938d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 493918c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 494086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 4941b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 494223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue RFV(TLI, Reg, V->getType()); 4943475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getEntryNode(); 494423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RFV.getCopyToRegs(Op, DAG, Chain, 0); 494523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman PendingExports.push_back(Chain); 49461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 49471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4948068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 494986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan GohmanLowerArguments(BasicBlock *LLVMBB, SelectionDAGLowering &SDL) { 49501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 495115699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 49520afa8e348eab21d3e09ae3240544886d61879266Chris Lattner FunctionLoweringInfo &FuncInfo = SDL.FuncInfo; 4953475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OldRoot = SDL.DAG.getRoot(); 4954475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 16> Args; 4955a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman TLI.LowerArguments(F, SDL.DAG, Args); 4956bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4957bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 4958bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 4959f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AI != E; ++AI) { 4960f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4961f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(TLI, AI->getType(), ValueVTs); 4962f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumValues = ValueVTs.size(); 4963bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 49644bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands SDL.setValue(AI, SDL.DAG.getMergeValues(&Args[a], NumValues)); 4965bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 4966bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 4967251db1890c1fe03d02ee878ada8129537844d031Chris Lattner DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo.ValueMap.find(AI); 4968251db1890c1fe03d02ee878ada8129537844d031Chris Lattner if (VMI != FuncInfo.ValueMap.end()) { 496986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(AI, VMI->second); 4970bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 49710afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 4972f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman a += NumValues; 4973f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4974bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4975bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 4976966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 4977bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner EmitFunctionEntryCode(F, SDL.DAG.getMachineFunction()); 4978068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 4979068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 4980f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 4981f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 4982f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 4983cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 4984f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 4985f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 4986f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 4987560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 4988560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 4989f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 4990f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 4991f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 4992f40708223e409a152834b1553c6883ff2035b957Duncan Sands 499330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsFixedFrameObjectWithPosOffset - Check if object is a fixed frame object and 499430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// whether object offset >= 0. 499530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighoferstatic bool 4996475871a144eb604ddaf37503397ba0941442e5fbDan GohmanIsFixedFrameObjectWithPosOffset(MachineFrameInfo * MFI, SDValue Op) { 499730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isa<FrameIndexSDNode>(Op)) return false; 499830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 499930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer FrameIndexSDNode * FrameIdxNode = dyn_cast<FrameIndexSDNode>(Op); 500030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer int FrameIdx = FrameIdxNode->getIndex(); 500130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return MFI->isFixedObjectIndex(FrameIdx) && 500230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MFI->getObjectOffset(FrameIdx) >= 0; 500330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 500430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 500530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsPossiblyOverwrittenArgumentOfTailCall - Check if the operand could 500630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// possibly be overwritten when lowering the outgoing arguments in a tail 500730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// call. Currently the implementation of this call is very conservative and 500830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// assumes all arguments sourcing from FORMAL_ARGUMENTS or a CopyFromReg with 500930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// virtual registers would be overwritten by direct lowering. 5010475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstatic bool IsPossiblyOverwrittenArgumentOfTailCall(SDValue Op, 501130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo * MFI) { 501230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer RegisterSDNode * OpReg = NULL; 501330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Op.getOpcode() == ISD::FORMAL_ARGUMENTS || 501430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode()== ISD::CopyFromReg && 501530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg = dyn_cast<RegisterSDNode>(Op.getOperand(1))) && 501630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg->getReg() >= TargetRegisterInfo::FirstVirtualRegister)) || 501730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::LOAD && 501830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(1))) || 501930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::MERGE_VALUES && 502030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Op.getOperand(Op.ResNo).getOpcode() == ISD::LOAD && 502130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(Op.ResNo). 502230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getOperand(1)))) 502330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return true; 502430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return false; 502530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 502630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 5027c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 502848abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 5029c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 5030c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 5031c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 5032475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Terminator = DAG.getRoot(); 5033c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5034c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 5035c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 5036c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ret = Terminator.Val; 5037c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5038c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5039c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 5040c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 50410e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman BI = DAG.allnodes_end(); BI != BE; ) { 50420e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman --BI; 5043c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 5044475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OpRet(Ret, 0); 5045475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OpCall(BI, 0); 5046c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 5047c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 5048c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 5049c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 505048abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 5051c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 505230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isMarkedTailCall) continue; 505330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Ret==NULL || 505430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG)) { 505530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Not eligible. Mark CALL node as non tail call. 5056475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5057c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold 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++) { 5060c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 5061c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 506230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer else 5063c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 5064c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5065c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 506630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } else { 506730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Look for tail call clobbered arguments. Emit a series of 506830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // copyto/copyfrom virtual register nodes to protect them. 5069475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5070475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = OpCall.getOperand(0), InFlag; 507130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned idx=0; 507230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer for(SDNode::op_iterator I = OpCall.Val->op_begin(), 507330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer E = OpCall.Val->op_end(); I != E; I++, idx++) { 5074475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = *I; 507530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (idx > 4 && (idx % 2)) { 507630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer bool isByVal = cast<ARG_FLAGSSDNode>(OpCall.getOperand(idx+1))-> 507730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getArgFlags().isByVal(); 507830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFunction &MF = DAG.getMachineFunction(); 507930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo *MFI = MF.getFrameInfo(); 508030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isByVal && 508130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsPossiblyOverwrittenArgumentOfTailCall(Arg, MFI)) { 508283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = Arg.getValueType(); 508330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned VReg = MF.getRegInfo(). 508430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer createVirtualRegister(TLI.getRegClassFor(VT)); 508530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = DAG.getCopyToReg(Chain, VReg, Arg, InFlag); 508630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Chain.getValue(1); 508730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Arg = DAG.getCopyFromReg(Chain, VReg, VT, InFlag); 508830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = Arg.getValue(1); 508930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Arg.getValue(2); 509030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 509130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 509230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops.push_back(Arg); 509330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 509430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Link in chain of CopyTo/CopyFromReg. 509530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops[0] = Chain; 509630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 5097c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5098c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5099c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5100c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 5101c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5102f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 5103f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// ensure constants are generated when needed. Remember the virtual registers 5104f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// that need to be added to the Machine PHI nodes as input. We cannot just 5105f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// directly add them, because expansion might result in multiple MBB's for one 5106f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// BB. As such, the start of the BB might correspond to a different MBB than 5107f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// the end. 5108f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// 5109f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid 5110f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectionDAGISel::HandlePHINodesInSuccessorBlocks(BasicBlock *LLVMBB, 5111f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman FunctionLoweringInfo &FuncInfo, 5112f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 5113f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectionDAGLowering &SDL) { 51148c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 51151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Emit constants only once even if used by multiple PHI nodes. 51171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner std::map<Constant*, unsigned> ConstantsOut; 5118d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5119c53ec498857aa3e6d4fc17bd67dd282dcfc821daDan Gohman BitVector SuccsHandled; 51208c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (TI->getNumSuccessors()) 51218c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled.resize(BB->getParent()->getNumBlockIDs()); 51228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 5123532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 5124532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 51251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 51261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 5127d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 51288c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock *SuccMBB = FuncInfo.MBBMap[SuccBB]; 5129d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 51308c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 51318c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 51328c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned SuccMBBNo = SuccMBB->getNumber(); 51338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (SuccsHandled[SuccMBBNo]) continue; 51348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner SuccsHandled[SuccMBBNo] = true; 51358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 51368c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 51371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 51381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 51401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 51411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 51421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 51438c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 51448c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 51458c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 51468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 51478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 51488c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 51493f7927c84c1b8c449378eaaf67eb9c563eb78949Chris Lattner 51508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 51518c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned &RegOut = ConstantsOut[C]; 51528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 51538c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner RegOut = FuncInfo.CreateRegForValue(C); 515486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(C, RegOut); 51551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 51568c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 51578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 51588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.ValueMap[PHIOp]; 51598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 51608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 51618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner FuncInfo.StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 51628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 51638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = FuncInfo.CreateRegForValue(PHIOp); 516486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman SDL.CopyValueToVirtualRegister(PHIOp, Reg); 51657e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 51661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 51678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 51688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 51698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 51706f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman SmallVector<MVT, 4> ValueVTs; 51716f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman ComputeValueVTs(TLI, PN->getType(), ValueVTs); 51726f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 51736f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman MVT VT = ValueVTs[vti]; 51746f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 51756f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 51766f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 51776f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman Reg += NumRegisters; 51786f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman } 51798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 51801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 51811c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner ConstantsOut.clear(); 51821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 5184f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands SDL.visit(*LLVMBB->getTerminator()); 5185a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 5186f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Copy over any CaseBlock records that may now exist due to SwitchInst 518737efe6764568a3829fee26aba532283131d1a104Nate Begeman // lowering, as well as any jump table information. 5188f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases.clear(); 5189f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SwitchCases = SDL.SwitchCases; 51903a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases.clear(); 51913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JTCases = SDL.JTCases; 51924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.clear(); 51934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases = SDL.BitTestCases; 5194f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman} 5195f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5196f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, 5197f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator Begin, 5198f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator End, 5199f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman bool DoArgs, 5200f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate, 5201f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman FunctionLoweringInfo &FuncInfo) { 5202f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectionDAGLowering SDL(*CurDAG, TLI, *AA, FuncInfo, GFI); 5203f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5204f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Lower any arguments needed in this block if this is the entry block. 5205f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (DoArgs) 5206f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman LowerArguments(LLVMBB, SDL); 5207f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5208f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SDL.setCurrentBasicBlock(BB); 5209f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5210f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman MachineModuleInfo *MMI = CurDAG->getMachineModuleInfo(); 5211f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5212f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (MMI && BB->isLandingPad()) { 5213f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 5214f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 5215f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned LabelID = MMI->addLandingPad(BB); 5216f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->setRoot(CurDAG->getLabel(ISD::EH_LABEL, 5217f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->getEntryNode(), LabelID)); 5218f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5219f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Mark exception register as live in. 5220f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 5221f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Reg) BB->addLiveIn(Reg); 5222f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5223f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Mark exception selector register as live in. 5224f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 5225f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Reg) BB->addLiveIn(Reg); 5226f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5227f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 5228f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 5229f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // like, the basic block containing the invoke), and need to be associated 5230f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // with it in the dwarf exception handling tables. Currently however the 5231f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 5232f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 5233f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // then breaking it can result in the intrinsics being in the successor of 5234f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // the landing pad, not the landing pad itself. This results in exceptions 5235f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // not being caught because no typeids are associated with the invoke. 5236f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // This may not be the only way things can go wrong, but it is the only way 5237f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // we try to work around for the moment. 5238f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 5239f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5240f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 5241f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator I, E; 5242f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 5243f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (isSelector(I)) 5244f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman break; 5245f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5246f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (I == E) 5247f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // No catch info found - try to extract some from the successor. 5248f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, FuncInfo); 5249f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5250f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5251f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5252f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Lower all of the non-terminator instructions. 5253f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman for (BasicBlock::iterator I = Begin; I != End; ++I) 5254f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!isa<TerminatorInst>(I)) 5255f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SDL.visit(*I); 5256f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5257f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Ensure that all instructions which are used outside of their defining 5258f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // blocks are available as virtual registers. Invoke is handled elsewhere. 5259f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman for (BasicBlock::iterator I = Begin; I != End; ++I) 5260f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 5261f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DenseMap<const Value*, unsigned>::iterator VMI =FuncInfo.ValueMap.find(I); 5262f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (VMI != FuncInfo.ValueMap.end()) 5263f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SDL.CopyValueToVirtualRegister(I, VMI->second); 5264f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5265f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5266f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Handle PHI nodes in successor blocks. 5267f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Begin != End && End == LLVMBB->end()) 5268f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman HandlePHINodesInSuccessorBlocks(LLVMBB, FuncInfo, PHINodesToUpdate, SDL); 52694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5270a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 5271f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->setRoot(SDL.getControlRoot()); 5272c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5273c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 5274c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 5275c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 5276c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 5277f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CheckDAGForTailCallsAndFixThem(*CurDAG, TLI); 5278f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5279f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Final step, emit the lowered DAG as machine code. 5280f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 5281f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->reset(); 52821c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 52831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5284f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 5285ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 5286ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 5287ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5288f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Worklist.push_back(CurDAG->getRoot().Val); 5289ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5290ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 5291ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 5292ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 5293ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5294ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner while (!Worklist.empty()) { 5295ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDNode *N = Worklist.back(); 5296ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.pop_back(); 5297ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5298ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 5299ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 5300ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5301ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5302ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 5303ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 5304ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOperand(i).getValueType() == MVT::Other) 5305ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.push_back(N->getOperand(i).Val); 5306ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5307ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 5308ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 5309ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5310ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5311ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 5312ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 5313ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5314ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5315ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 5316475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 5317ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT SrcVT = Src.getValueType(); 5318ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 5319ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5320ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5321f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 5322ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 5323f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 5324ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5325ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 5326ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 5327ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 5328f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman FunctionLoweringInfo &FLI = CurDAG->getFunctionLoweringInfo(); 5329ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (DestReg >= FLI.LiveOutRegInfo.size()) 5330ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FLI.LiveOutRegInfo.resize(DestReg+1); 5331ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[DestReg]; 5332ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 5333ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownOne = NumSignBits; 5334ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownZero = NumSignBits; 5335ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5336ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5337ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 5338ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5339f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 5340462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 5341462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 5342462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 5343462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 5344462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 5345462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 || ViewISelDAGs || ViewSchedDAGs || ViewSUnitDAGs) 5346f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BlockName = CurDAG->getMachineFunction().getFunction()->getName() + ':' + 5347462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman BB->getBasicBlock()->getName(); 5348462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5349462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Initial selection DAG:\n"; 5350f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5351462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5352f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 5353417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5354af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 5355ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53565e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 5357f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Combine(false, *AA, Fast); 5358ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5359f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Combine(false, *AA, Fast); 5360ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 53612300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5362417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 5363f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5364f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands 53651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 53661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 5367f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands if (EnableLegalizeTypes) {// Enable this some day. 5368f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 5369f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BlockName); 5370462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5371462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 5372462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 5373f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->LegalizeTypes(); 5374462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 5375f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->LegalizeTypes(); 5376462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 5377462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5378462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Type-legalized selection DAG:\n"; 5379f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5380462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 538170587ea813986bb0dbef71610091d496e28c22a6Chris Lattner // TODO: enable a dag combine pass here. 538270587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 5383f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands 5384f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 5385462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5386ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 53875e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 5388f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Legalize(); 5389ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5390f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Legalize(); 5391ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5392f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5393832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 5394f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5395f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5396f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 5397462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5398af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 5399ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54005e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 5401f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Combine(true, *AA, Fast); 5402ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5403f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Combine(true, *AA, Fast); 5404ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 54052300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5406417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 5407f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5408417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5409f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 5410ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5411925a7e8ed6522f291b4ae559ccfa56db461016e3Dan Gohman if (!Fast && EnableValueProp) 5412f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 5413552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 5414a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 5415a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 5416ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54175e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 5418f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelect(); 5419ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5420f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelect(); 5421ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5422db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5423462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Selected selection DAG:\n"; 5424f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5425462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5426f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 5427462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 54285e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 54295e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman ScheduleDAG *Scheduler; 54305e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 54315e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 5432f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Scheduler = Schedule(); 54335e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 5434f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Scheduler = Schedule(); 54355e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 54365e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 5437462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 5438462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5439db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // Emit machine code to BB. This can change 'BB' to the last block being 5440db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 5441ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 54425e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 54435e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 5444ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 54455e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 54465e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 54475e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 54485e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 54495e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 54505e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 54515e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 54525e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 54535e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 5454ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5455db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5456832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 54571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 5458f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 5459f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 54600e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn, MachineFunction &MF, 54610e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FunctionLoweringInfo &FuncInfo) { 5462f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Define the SelectionDAG here so that memory allocation is reused for 54630e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman // each basic block. 5464f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectionDAG DAG(TLI, MF, FuncInfo, 5465f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman getAnalysisToUpdate<MachineModuleInfo>()); 5466f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG = &DAG; 54670e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 546839fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 546939fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 547039fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng BasicBlock *LLVMBB = &*I; 5471f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BB = FuncInfo.MBBMap[LLVMBB]; 5472f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5473f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator Begin = LLVMBB->begin(); 5474f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator End = LLVMBB->end(); 5475f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman bool DoArgs = LLVMBB == &Fn.getEntryBlock(); 5476f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5477f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 5478f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // FastISel doesn't support EH landing pads, which require special handling. 5479f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (EnableFastISel && !BB->isLandingPad()) { 5480f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (FastISel *F = TLI.createFastISel(FuncInfo.MF)) { 5481f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman while (Begin != End) { 5482f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Begin = F->SelectInstructions(Begin, End, FuncInfo.ValueMap, 5483f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman FuncInfo.MBBMap, BB); 5484f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5485f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Begin == End) 5486f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // The "fast" selector selected the entire block, so we're done. 5487f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman break; 5488f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5489f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Handle certain instructions as single-LLVM-Instruction blocks. 5490f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (isa<CallInst>(Begin) || isa<LoadInst>(Begin) || 5491f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman isa<StoreInst>(Begin)) { 5492f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Begin->getType() != Type::VoidTy) { 5493f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned &R = FuncInfo.ValueMap[Begin]; 5494f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!R) 5495f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman R = FuncInfo.CreateRegForValue(Begin); 5496f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5497f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5498f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectBasicBlock(LLVMBB, Begin, next(Begin), DoArgs, 5499f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman PHINodesToUpdate, FuncInfo); 5500f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5501f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ++Begin; 5502f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DoArgs = false; 5503f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman continue; 5504f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5505f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5506f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!DisableFastISelAbort && 5507f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // For now, don't abort on non-conditional-branch terminators. 5508f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman (!isa<TerminatorInst>(Begin) || 5509f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman (isa<BranchInst>(Begin) && 5510f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman cast<BranchInst>(Begin)->isUnconditional()))) { 5511f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // The "fast" selector couldn't handle something and bailed. 5512f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // For the purpose of debugging, just abort. 5513f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman#ifndef NDEBUG 5514f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Begin->dump(); 5515f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman#endif 5516f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman assert(0 && "FastISel didn't select the entire block"); 5517f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5518f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman break; 5519f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5520f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman delete F; 5521f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5522f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5523f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5524f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Begin != End || DoArgs) 5525f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectBasicBlock(LLVMBB, Begin, End, DoArgs, PHINodesToUpdate, FuncInfo); 5526381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 5527f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman FinishBasicBlock(FuncInfo, PHINodesToUpdate); 5528f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman PHINodesToUpdate.clear(); 552939fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 5530f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5531f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG = 0; 55320e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 55330e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 5534fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 5535f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectionDAGISel::FinishBasicBlock(FunctionLoweringInfo &FuncInfo, 5536f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman std::vector<std::pair<MachineInstr*, unsigned> > &PHINodesToUpdate) { 55371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5538f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Perform target specific isel post processing. 5539f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelectPostProcessing(); 5540f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5541f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DOUT << "Target-post-processed machine code:\n"; 5542f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(BB->dump()); 55434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 55454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << PHINodesToUpdate.size() << "\n"; 55464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DEBUG(for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) 55474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Node " << i << " : (" << PHINodesToUpdate[i].first 55484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", " << PHINodesToUpdate[i].second << ")\n";); 5549f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5550a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 55511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 55524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (SwitchCases.empty() && JTCases.empty() && BitTestCases.empty()) { 5553f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5554f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineInstr *PHI = PHINodesToUpdate[i].first; 5555f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5556f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 55579ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 55589ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 55599ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5560f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5561f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 55621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 55634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = BitTestCases.size(); i != e; ++i) { 55654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 55664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (!BitTestCases[i].Emitted) { 5567f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectionDAGLowering HSDL(*CurDAG, TLI, *AA, FuncInfo, GFI); 55684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 55694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Parent; 55704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 55714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 55724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov HSDL.visitBitTestHeader(BitTestCases[i]); 5573f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->setRoot(HSDL.getRoot()); 5574f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 5575f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->reset(); 55764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 5579f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectionDAGLowering BSDL(*CurDAG, TLI, *AA, FuncInfo, GFI); 55804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 55814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BB = BitTestCases[i].Cases[j].ThisBB; 55824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.setCurrentBasicBlock(BB); 55834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 55844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 55854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Cases[j+1].ThisBB, 55864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 55874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 55884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 55894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BSDL.visitBitTestCase(BitTestCases[i].Default, 55904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Reg, 55914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases[i].Cases[j]); 55924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5594f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->setRoot(BSDL.getRoot()); 5595f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 5596f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->reset(); 55974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 55984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 55994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 56004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 56014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineInstr *PHI = PHINodesToUpdate[pi].first; 56024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 56034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 56044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 56054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 56064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 56074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (PHIBB == BitTestCases[i].Default) { 56089ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56099ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56109ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Parent)); 56119ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56129ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56139ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BitTestCases[i].Cases. 56149ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 56154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 56174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned j = 0, ej = BitTestCases[i].Cases.size(); j != ej; ++j) { 56184198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* cBB = BitTestCases[i].Cases[j].ThisBB; 56194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 56204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 56219ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56229ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56239ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 56244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 56299453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 56309453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 56319453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 56323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov for (unsigned i = 0, e = JTCases.size(); i != e; ++i) { 56333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 56343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (!JTCases[i].first.Emitted) { 5635f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectionDAGLowering HSDL(*CurDAG, TLI, *AA, FuncInfo, GFI); 56363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 56373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].first.HeaderBB; 56383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.setCurrentBasicBlock(BB); 56393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 56403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov HSDL.visitJumpTableHeader(JTCases[i].second, JTCases[i].first); 5641f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->setRoot(HSDL.getRoot()); 5642f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 5643f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->reset(); 56444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 56453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 5646f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectionDAGLowering JSDL(*CurDAG, TLI, *AA, FuncInfo, GFI); 564737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 56483a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov BB = JTCases[i].second.MBB; 56493a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.setCurrentBasicBlock(BB); 565037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 56513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JSDL.visitJumpTable(JTCases[i].second); 5652f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->setRoot(JSDL.getRoot()); 5653f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 5654f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->reset(); 56553a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 565637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 565737efe6764568a3829fee26aba532283131d1a104Nate Begeman for (unsigned pi = 0, pe = PHINodesToUpdate.size(); pi != pe; ++pi) { 565837efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineInstr *PHI = PHINodesToUpdate[pi].first; 565937efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 566037efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 566137efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 56624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 56633a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (PHIBB == JTCases[i].second.Default) { 56649ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56659ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56669ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(JTCases[i].first.HeaderBB)); 5667f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 56684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 5669f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 56709ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pi].second, 56719ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56729ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 567337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 567437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 567537efe6764568a3829fee26aba532283131d1a104Nate Begeman } 567637efe6764568a3829fee26aba532283131d1a104Nate Begeman 5677b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 5678b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 5679b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner for (unsigned i = 0, e = PHINodesToUpdate.size(); i != e; ++i) { 5680b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner MachineInstr *PHI = PHINodesToUpdate[i].first; 5681b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5682b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 5683b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 56849ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[i].second, 56859ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 56869ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5687b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5688b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5689b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 5690f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 5691f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 5692d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned i = 0, e = SwitchCases.size(); i != e; ++i) { 5693f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman SelectionDAGLowering SDL(*CurDAG, TLI, *AA, FuncInfo, GFI); 5694d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5695f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 5696f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman BB = SwitchCases[i].ThisBB; 5697f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.setCurrentBasicBlock(BB); 5698d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5699f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 5700f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman SDL.visitSwitchCase(SwitchCases[i]); 5701f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->setRoot(SDL.getRoot()); 5702f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 5703f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->reset(); 5704d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5705d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 5706d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 5707d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 5708d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 570957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner while ((BB = SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 5710d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 5711d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 5712d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 5713d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 5714d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner assert(pn != PHINodesToUpdate.size() && "Didn't find PHI entry!"); 5715d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (PHINodesToUpdate[pn].first == Phi) { 57169ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateReg(PHINodesToUpdate[pn]. 57179ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 57189ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner Phi->addOperand(MachineOperand::CreateMBB(SwitchCases[i].ThisBB)); 5719d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 5720d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5721d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 5722f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 5723d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5724d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 572557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (BB == SwitchCases[i].FalseBB) 572657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5727d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5728d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 57292452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner SwitchCases[i].TrueBB = SwitchCases[i].FalseBB; 573057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner SwitchCases[i].FalseBB = 0; 5731f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 573257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner assert(SwitchCases[i].TrueBB == 0 && SwitchCases[i].FalseBB == 0); 5733a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 57341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5735a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 573613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 57375e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// Schedule - Pick a safe ordering for instructions for each 5738a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 57395e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 5740f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanScheduleDAG *SelectionDAGISel::Schedule() { 5741eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 574213ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 574313ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 5744eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 57459373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 57464ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 574713ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 5748f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ScheduleDAG *Scheduler = Ctor(this, CurDAG, BB, Fast); 57495e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler->Run(); 57503e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 57515e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman return Scheduler; 5752a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 57530e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 575403fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 57559ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 57569ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 57579ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 57589ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 5759755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5760755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 5761755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 5762755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 5763755480681c795d585c73556c028b6143c46bda86Chris Lattner 5764755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 5765755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5766755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 5767755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5768475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 5769dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 57702e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 57712e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5772755480681c795d585c73556c028b6143c46bda86Chris Lattner 5773755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5774755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5775755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5776755480681c795d585c73556c028b6143c46bda86Chris Lattner 5777755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 57782e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5779755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5780755480681c795d585c73556c028b6143c46bda86Chris Lattner 5781755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5782755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 57832e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5784ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 5785755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5786755480681c795d585c73556c028b6143c46bda86Chris Lattner 5787755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5788755480681c795d585c73556c028b6143c46bda86Chris Lattner 5789755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5790755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5791755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5792755480681c795d585c73556c028b6143c46bda86Chris Lattner 5793755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 5794755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 5795755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 5796755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 5797475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 57982e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 57992e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 58002e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 5801755480681c795d585c73556c028b6143c46bda86Chris Lattner 5802755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 5803755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 5804755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5805755480681c795d585c73556c028b6143c46bda86Chris Lattner 5806755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 58072e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 5808755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5809755480681c795d585c73556c028b6143c46bda86Chris Lattner 5810755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 5811755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 58122e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 5813755480681c795d585c73556c028b6143c46bda86Chris Lattner 58142e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 5815ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 5816755480681c795d585c73556c028b6143c46bda86Chris Lattner 5817755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 5818755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 5819755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 5820755480681c795d585c73556c028b6143c46bda86Chris Lattner 5821755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 5822755480681c795d585c73556c028b6143c46bda86Chris Lattner 5823755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 5824755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 5825755480681c795d585c73556c028b6143c46bda86Chris Lattner} 5826755480681c795d585c73556c028b6143c46bda86Chris Lattner 58279ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 58280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 58290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 58300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 5831f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 5832475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 58330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 58340e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58350e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 58360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 58370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 58390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 58400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 58410e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58420e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 58430e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 58440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 58450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 58460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 58470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 58480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 58490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 58500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 5851475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 5852f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) { 5853832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 58540e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 58550e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 58560e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58570e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 5858f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman MVT IntPtrTy = CurDAG->getTargetLoweringInfo().getPointerTy(); 5859f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Ops.push_back(CurDAG->getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 5860f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman IntPtrTy)); 58610e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 58620e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 58630e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 58640e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 58650e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 58660e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 58670e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 58680e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 58690e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 5870794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 58711997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 5872