SelectionDAGISel.cpp revision d2ff647964ed242e67ac12f7d21a58c864309d95
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; 3167c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Function *Fn; 3177c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineFunction *MF; 3187c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineRegisterInfo *RegInfo; 3191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3207c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman explicit FunctionLoweringInfo(TargetLowering &TLI); 3217c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 3227c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// set - Initialize this FunctionLoweringInfo with the given Function 3237c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// and its associated MachineFunction. 3247c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// 3257c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman void set(Function &Fn, MachineFunction &MF); 3261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// MBBMap - A mapping from LLVM basic blocks to their machine code entry. 3286ecf50908c78aae0feff1c378fbb75dcf013ed21Dan Gohman DenseMap<const BasicBlock*, MachineBasicBlock *> MBBMap; 3291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// ValueMap - Since we emit code for the function a basic block at a time, 3311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// we must remember which virtual registers hold the values for 3321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// cross-basic-block values. 3339f24ad79ce32200b06499ef638b502fc1c36ed04Chris Lattner DenseMap<const Value*, unsigned> ValueMap; 3341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// StaticAllocaMap - Keep track of frame indices for fixed sized allocas in 3361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// the entry block. This allows the allocas to be efficiently referenced 3371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// anywhere in the function. 3386ecf50908c78aae0feff1c378fbb75dcf013ed21Dan Gohman DenseMap<const AllocaInst*, int> StaticAllocaMap; 3391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 340f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 341f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoLost; 342f40708223e409a152834b1553c6883ff2035b957Duncan Sands SmallSet<Instruction*, 8> CatchInfoFound; 343f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 344f40708223e409a152834b1553c6883ff2035b957Duncan Sands 34583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned MakeReg(MVT VT) { 3467c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 3471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 348571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 349571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// isExportedInst - Return true if the specified value is an instruction 350571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner /// exported from its block. 351571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner bool isExportedInst(const Value *V) { 352571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return ValueMap.count(V); 353571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 354edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3553c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner unsigned CreateRegForValue(const Value *V); 3563c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner 3571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned InitializeRegForValue(const Value *V) { 3581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned &R = ValueMap[V]; 3591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(R == 0 && "Already initialized this value register!"); 3601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return R = CreateRegForValue(V); 3611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 362ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 363ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner struct LiveOutInfo { 364ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits; 365ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne, KnownZero; 366ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LiveOutInfo() : NumSignBits(0) {} 367ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner }; 368ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 369ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// LiveOutRegInfo - Information about live out vregs, indexed by their 370ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner /// register number offset by 'FirstVirtualRegister'. 371ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner std::vector<LiveOutInfo> LiveOutRegInfo; 3727c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 3737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// clear - Clear out all the function-specific state. This returns this 3747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// FunctionLoweringInfo to an empty state, ready to be used for a 3757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// different function. 3767c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman void clear() { 3777c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MBBMap.clear(); 3787c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman ValueMap.clear(); 3797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman StaticAllocaMap.clear(); 3807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman#ifndef NDEBUG 3817c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CatchInfoLost.clear(); 3827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CatchInfoFound.clear(); 3837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman#endif 3847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman LiveOutRegInfo.clear(); 3857c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman } 3861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner }; 3871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 3881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 389cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// isSelector - Return true if this instruction is a call to the 390cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// eh.selector intrinsic. 391cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic bool isSelector(Instruction *I) { 392f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) 3938806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov return (II->getIntrinsicID() == Intrinsic::eh_selector_i32 || 3948806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov II->getIntrinsicID() == Intrinsic::eh_selector_i64); 395f40708223e409a152834b1553c6883ff2035b957Duncan Sands return false; 396f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 397f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// isUsedOutsideOfDefiningBlock - Return true if this instruction is used by 399f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// PHI nodes or outside of the basic block that defines it, or used by a 400ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth/// switch or atomic instruction, which may expand to multiple basic blocks. 4011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerstatic bool isUsedOutsideOfDefiningBlock(Instruction *I) { 4021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (isa<PHINode>(I)) return true; 4031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *BB = I->getParent(); 4041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (Value::use_iterator UI = I->use_begin(), E = I->use_end(); UI != E; ++UI) 405f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != BB || isa<PHINode>(*UI) || 406571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // FIXME: Remove switchinst special case. 407f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman isa<SwitchInst>(*UI)) 4081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 4091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return false; 4101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 4111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 412bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner/// isOnlyUsedInEntryBlock - If the specified argument is only used in the 413f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// entry block, return true. This includes arguments used by switches, since 414f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the switch may expand into multiple basic blocks. 415bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattnerstatic bool isOnlyUsedInEntryBlock(Argument *A) { 416f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // With FastISel active, we may be splitting blocks, so force creation 417f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // of virtual registers for all non-dead arguments. 418f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (EnableFastISel) 419f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman return A->use_empty(); 420f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 421bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner BasicBlock *Entry = A->getParent()->begin(); 422bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Value::use_iterator UI = A->use_begin(), E = A->use_end(); UI != E; ++UI) 423f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (cast<Instruction>(*UI)->getParent() != Entry || isa<SwitchInst>(*UI)) 424bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return false; // Use not in entry block. 425bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner return true; 426bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner} 427bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 4287c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanFunctionLoweringInfo::FunctionLoweringInfo(TargetLowering &tli) 4297c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman : TLI(tli) { 4307c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 4317c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 4327c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohmanvoid FunctionLoweringInfo::set(Function &fn, MachineFunction &mf) { 4337c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Fn = &fn; 4347c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MF = &mf; 4357c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman RegInfo = &MF->getRegInfo(); 4361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 437bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Create a vreg for each argument register that is not dead and is used 438bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // outside of the entry block for the function. 4397c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (Function::arg_iterator AI = Fn->arg_begin(), E = Fn->arg_end(); 44016ce0df92717cd1474029d87efe596d000dc2caaChris Lattner AI != E; ++AI) 441bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!isOnlyUsedInEntryBlock(AI)) 442bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner InitializeRegForValue(AI); 4431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 444bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Initialize the mapping of values to registers. This is only set up for 445bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // instruction values that are used outside of the block that defines 446bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // them. 4477c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Function::iterator BB = Fn->begin(), EB = Fn->end(); 4481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I)) 450b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (ConstantInt *CUI = dyn_cast<ConstantInt>(AI->getArraySize())) { 4511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = AI->getAllocatedType(); 452514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 453ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman unsigned Align = 454d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 455ae232e7a1055033436370c0b3aecf054fa44d5e7Nate Begeman AI->getAlignment()); 456a8217e3000b5b01c4a95316aef078a9d02a9a119Chris Lattner 457b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer TySize *= CUI->getZExtValue(); // Get total allocated size. 458d222f6ab67472fa2b2e211172a11b43905aa9445Chris Lattner if (TySize == 0) TySize = 1; // Don't create zero-sized stack objects. 4591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner StaticAllocaMap[AI] = 4607c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MF->getFrameInfo()->CreateStackObject(TySize, Align); 4611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4632aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (; BB != EB; ++BB) 4642aeaf4e839438d51766996006fc22310d05ab2a7Jeff Cohen for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 4651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!I->use_empty() && isUsedOutsideOfDefiningBlock(I)) 4661c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (!isa<AllocaInst>(I) || 4671c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner !StaticAllocaMap.count(cast<AllocaInst>(I))) 4681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner InitializeRegForValue(I); 4691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create an initial MachineBasicBlock for each LLVM BasicBlock in F. This 4711c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // also creates the initial PHI MachineInstrs, though none of the input 4721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // operands are populated. 4737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (BB = Fn->begin(), EB = Fn->end(); BB != EB; ++BB) { 4740e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *MBB = mf.CreateMachineBasicBlock(BB); 4751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MBBMap[BB] = MBB; 4767c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MF->push_back(MBB); 4771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Create Machine PHI nodes for LLVM PHI nodes, lowering them as 4791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // appropriate. 4801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 4818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner for (BasicBlock::iterator I = BB->begin();(PN = dyn_cast<PHINode>(I)); ++I){ 4828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 4838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 4848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned PHIReg = ValueMap[PN]; 4858c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(PHIReg && "PHI node does not have an assigned virtual register!"); 4866f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman 4876f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman SmallVector<MVT, 4> ValueVTs; 4886f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman ComputeValueVTs(TLI, PN->getType(), ValueVTs); 4896f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 4906f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman MVT VT = ValueVTs[vti]; 4916f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 4926f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman const TargetInstrInfo *TII = TLI.getTargetMachine().getInstrInfo(); 4936f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned i = 0; i != NumRegisters; ++i) 4946f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman BuildMI(MBB, TII->get(TargetInstrInfo::PHI), PHIReg+i); 4956f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman PHIReg += NumRegisters; 4966f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman } 4978c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 4981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 4991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 5001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5013c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// CreateRegForValue - Allocate the appropriate number of virtual registers of 5023c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// the correctly promoted or expanded types. Assign these registers 5033c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner/// consecutive vreg numbers and return the first assigned number. 50410a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 50510a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// In the case that the given value has struct or array type, this function 50610a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// will assign registers for each member or element. 50710a6b7ab656ddce1acfa1216311d2564edaecbe3Dan Gohman/// 5083c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattnerunsigned FunctionLoweringInfo::CreateRegForValue(const Value *V) { 50983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> ValueVTs; 510b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner ComputeValueVTs(TLI, V->getType(), ValueVTs); 51195b39550344bad0d15d1ffa7afc300eb1533ed19Bill Wendling 51223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned FirstReg = 0; 513b20d4f8d499c4c5315de69bd22c652665a7e3ab8Dan Gohman for (unsigned Value = 0, e = ValueVTs.size(); Value != e; ++Value) { 51483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 51583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = TLI.getRegisterType(ValueVT); 5168c8c5fcbd757b5c44fa7ad9af038a2f2d950b624Dan Gohman 517b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumRegs = TLI.getNumRegisters(ValueVT); 51823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 51923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned R = MakeReg(RegisterVT); 52023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman if (!FirstReg) FirstReg = R; 52123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 52223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 52323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman return FirstReg; 5243c38449be6371d53a58d0df80ecf3772a2f9a79fChris Lattner} 5251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5261c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner//===----------------------------------------------------------------------===// 5271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// SelectionDAGLowering - This is the common target-independent lowering 5281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// implementation that is parameterized by a TargetLowering object. 5291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// Also, targets can overload any lowering method. 5301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner/// 5311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnernamespace llvm { 5321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerclass SelectionDAGLowering { 5331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *CurMBB; 5341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 535475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DenseMap<const Value*, SDValue> NodeMap; 5361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 537d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// PendingLoads - Loads are not emitted to the program immediately. We bunch 538d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// them up and then emit token factor nodes when possible. This allows us to 539d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// get simple disambiguation between loads without worrying about alias 540d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner /// analysis. 541475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> PendingLoads; 542d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 54386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingExports - CopyToReg nodes that copy values to virtual registers 54486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// for export to other blocks need to be emitted before any terminator 54586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instruction, but they have no other ordering requirements. We bunch them 54686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// up and the emit a single tokenfactor for them just before terminator 54786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// instructions. 5487c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SmallVector<SDValue, 8> PendingExports; 54986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 5505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// Case - A struct to record the Value for a switch case, and the 5515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// case's target basic block. 5525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov struct Case { 5535502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* Low; 5545502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant* High; 5555502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* BB; 5565502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5575502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case() : Low(0), High(0), BB(0) { } 5585502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Case(Constant* low, Constant* high, MachineBasicBlock* bb) : 5595502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Low(low), High(high), BB(bb) { } 5605502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t size() const { 5615502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rHigh = cast<ConstantInt>(High)->getSExtValue(); 5625502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t rLow = cast<ConstantInt>(Low)->getSExtValue(); 5635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return (rHigh - rLow + 1ULL); 5645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 5655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov }; 5665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 5674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBits { 5684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t Mask; 5694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* BB; 5704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Bits; 5714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBits(uint64_t mask, MachineBasicBlock* bb, unsigned bits): 5734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Mask(mask), BB(bb), Bits(bits) { } 5744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 5754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5765502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::vector<Case> CaseVector; 5774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov typedef std::vector<CaseBits> CaseBitsVector; 5785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef CaseVector::iterator CaseItr; 5795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov typedef std::pair<CaseItr, CaseItr> CaseRange; 580f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 581f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseRec - A struct with ctor used in lowering switches to a binary tree 582f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// of conditional branches. 583f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseRec { 584f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRec(MachineBasicBlock *bb, Constant *lt, Constant *ge, CaseRange r) : 585f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseBB(bb), LT(lt), GE(ge), Range(r) {} 586f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 587f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// CaseBB - The MBB in which to emit the compare and branch 588f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *CaseBB; 589f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// LT, GE - If nonzero, we know the current case value must be less-than or 590f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// greater-than-or-equal-to these Constants. 591f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *LT; 592f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Constant *GE; 593f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// Range - A pair of iterators representing the range of case values to be 594f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// processed at this point in the binary search tree. 595f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman CaseRange Range; 596f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 597b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 598b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov typedef std::vector<CaseRec> CaseRecVector; 5995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 6005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// The comparison function for sorting the switch case values in the vector. 6015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov /// WARNING: Case ranges should be disjoint! 602f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman struct CaseCmp { 6034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const Case& C1, const Case& C2) { 6045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(isa<ConstantInt>(C1.Low) && isa<ConstantInt>(C2.High)); 6055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI1 = cast<const ConstantInt>(C1.Low); 6065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const ConstantInt* CI2 = cast<const ConstantInt>(C2.High); 6075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return CI1->getValue().slt(CI2->getValue()); 608f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 609f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman }; 6105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 6114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov struct CaseBitsCmp { 6124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool operator () (const CaseBits& C1, const CaseBits& C2) { 6134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return C1.Bits > C2.Bits; 6144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 6154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov }; 6164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 6175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned Clusterify(CaseVector& Cases, const SwitchInst &SI); 618f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 6199ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman /// CaseBlock - This structure is used to communicate between SDLowering and 6209ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman /// SDISel for the code generation of additional basic blocks needed by multi- 6219ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman /// case switch statements. 6229ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman struct CaseBlock { 6239ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman CaseBlock(ISD::CondCode cc, Value *cmplhs, Value *cmprhs, Value *cmpmiddle, 6249ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *truebb, MachineBasicBlock *falsebb, 6259ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *me) 6269ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman : CC(cc), CmpLHS(cmplhs), CmpMHS(cmpmiddle), CmpRHS(cmprhs), 6279ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman TrueBB(truebb), FalseBB(falsebb), ThisBB(me) {} 6289ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman // CC - the condition code to use for the case block's setcc node 6299ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman ISD::CondCode CC; 6309ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman // CmpLHS/CmpRHS/CmpMHS - The LHS/MHS/RHS of the comparison to emit. 6319ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman // Emit by default LHS op RHS. MHS is used for range comparisons: 6329ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman // If MHS is not null: (LHS <= MHS) and (MHS <= RHS). 6339ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman Value *CmpLHS, *CmpMHS, *CmpRHS; 6349ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman // TrueBB/FalseBB - the block to branch to if the setcc is true/false. 6359ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *TrueBB, *FalseBB; 6369ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman // ThisBB - the block into which to emit the code for the setcc and branches 6379ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *ThisBB; 6389ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman }; 6399ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman struct JumpTable { 6409ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman JumpTable(unsigned R, unsigned J, MachineBasicBlock *M, 6419ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *D): Reg(R), JTI(J), MBB(M), Default(D) {} 6429ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman 6439ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman /// Reg - the virtual register containing the index of the jump table entry 6449ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman //. to jump to. 6459ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman unsigned Reg; 6469ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman /// JTI - the JumpTableIndex for this jump table in the function. 6479ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman unsigned JTI; 6489ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman /// MBB - the MBB into which to emit the code for the indirect jump. 6499ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *MBB; 6509ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman /// Default - the MBB of the default bb, which is a successor of the range 6519ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman /// check MBB. This is when updating PHI nodes in successors. 6529ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *Default; 6539ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman }; 6549ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman struct JumpTableHeader { 6559ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman JumpTableHeader(uint64_t F, uint64_t L, Value* SV, MachineBasicBlock* H, 6569ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman bool E = false): 6579ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman First(F), Last(L), SValue(SV), HeaderBB(H), Emitted(E) {} 6589ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman uint64_t First; 6599ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman uint64_t Last; 6609ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman Value *SValue; 6619ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *HeaderBB; 6629ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman bool Emitted; 6639ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman }; 6649ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman typedef std::pair<JumpTableHeader, JumpTable> JumpTableBlock; 6659ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman 6669ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman struct BitTestCase { 6679ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman BitTestCase(uint64_t M, MachineBasicBlock* T, MachineBasicBlock* Tr): 6689ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman Mask(M), ThisBB(T), TargetBB(Tr) { } 6699ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman uint64_t Mask; 6709ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock* ThisBB; 6719ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock* TargetBB; 6729ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman }; 6739ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman 6749ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman typedef SmallVector<BitTestCase, 3> BitTestInfo; 6759ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman 6769ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman struct BitTestBlock { 6779ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman BitTestBlock(uint64_t F, uint64_t R, Value* SV, 6789ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman unsigned Rg, bool E, 6799ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock* P, MachineBasicBlock* D, 6809ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman const BitTestInfo& C): 6819ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman First(F), Range(R), SValue(SV), Reg(Rg), Emitted(E), 6829ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman Parent(P), Default(D), Cases(C) { } 6839ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman uint64_t First; 6849ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman uint64_t Range; 6859ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman Value *SValue; 6869ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman unsigned Reg; 6879ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman bool Emitted; 6889ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *Parent; 6899ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman MachineBasicBlock *Default; 6909ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman BitTestInfo Cases; 6919ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman }; 6929ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman 6931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerpublic: 6941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // TLI - This is information that describes the available target features we 6951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // need for lowering. This indicates when operations are unavailable, 6961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // implemented with a libcall, etc. 6971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TargetLowering &TLI; 6981c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAG &DAG; 699a69571c7991813c93cba64e88eced6899ce93d81Owen Anderson const TargetData *TD; 7007c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman AliasAnalysis *AA; 7011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 702f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchCases - Vector of CaseBlock structures used to communicate 703f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman /// SwitchInst code generation information. 7047c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman std::vector<CaseBlock> SwitchCases; 7053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// JTCases - Vector of JumpTable structures used to communicate 7063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov /// SwitchInst code generation information. 7077c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman std::vector<JumpTableBlock> JTCases; 7087c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// BitTestCases - Vector of BitTestBlock structures used to communicate 7097c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// SwitchInst code generation information. 7107c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman std::vector<BitTestBlock> BitTestCases; 711f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 7127c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman std::vector<std::pair<MachineInstr*, unsigned> > PHINodesToUpdate; 7137c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 7147c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman // Emit PHI-node-operand constants only once even if used by multiple 7157c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman // PHI nodes. 7167c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DenseMap<Constant*, unsigned> ConstantsOut; 7177c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 7181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// FuncInfo - Information about the function as a whole. 7191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner /// 7201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner FunctionLoweringInfo &FuncInfo; 721ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 7225eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen /// GFI - Garbage collection metadata for the function. 7235eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GCFunctionInfo *GFI; 7241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 7251c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner SelectionDAGLowering(SelectionDAG &dag, TargetLowering &tli, 7267c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FunctionLoweringInfo &funcinfo) 7277c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman : TLI(tli), DAG(dag), FuncInfo(funcinfo) { 7287c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman } 7297c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 7307c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman void init(GCFunctionInfo *gfi, AliasAnalysis &aa) { 7317c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman AA = &aa; 7327c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI = gfi; 7337c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman TD = DAG.getTarget().getTargetData(); 7347c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman } 7357c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 7367c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// clear - Clear out the curret SelectionDAG and the associated 7377c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// state and prepare this SelectionDAGLowering object to be used 7387c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// for a new block. This doesn't clear out information about 7397c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// additional blocks that are needed to complete switch lowering 7407c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// or PHI node updating; that information is cleared out as it is 7417c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman /// consumed. 7427c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman void clear() { 7437c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman NodeMap.clear(); 7447c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PendingLoads.clear(); 7457c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PendingExports.clear(); 7467c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DAG.clear(); 7471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 7481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 74986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getRoot - Return the current virtual root of the Selection DAG, 75086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// flushing any PendingLoad items. This must be done before emitting 75186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// a store or any other node that may need to be ordered after any 75286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// prior load instructions. 753a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner /// 754475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getRoot() { 755d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.empty()) 756d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return DAG.getRoot(); 757edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 758d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (PendingLoads.size() == 1) { 759475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = PendingLoads[0]; 760d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 761d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 762d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 763d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 764d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner 765d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Otherwise, we have to make a token factor node. 766475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 767bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &PendingLoads[0], PendingLoads.size()); 768d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner PendingLoads.clear(); 769d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner DAG.setRoot(Root); 770d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner return Root; 771a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner } 772a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner 77386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// getControlRoot - Similar to getRoot, but instead of flushing all the 77486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// PendingLoad items, flush all the PendingExports items. It is necessary 77586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// to do this before emitting a terminator instruction. 77686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman /// 777475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getControlRoot() { 778475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = DAG.getRoot(); 77986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 78086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (PendingExports.empty()) 78186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 78286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 78386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman // Turn all of the CopyToReg chains into one factored node. 78486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (Root.getOpcode() != ISD::EntryToken) { 78586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman unsigned i = 0, e = PendingExports.size(); 78686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (; i != e; ++i) { 787ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif assert(PendingExports[i].getNode()->getNumOperands() > 1); 788ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif if (PendingExports[i].getNode()->getOperand(0) == Root) 78986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman break; // Don't add the root if we already indirectly depend on it. 79086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 79186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 79286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman if (i == e) 79386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.push_back(Root); 79486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 79586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 79686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman Root = DAG.getNode(ISD::TokenFactor, MVT::Other, 79786e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman &PendingExports[0], 79886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.size()); 79986e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman PendingExports.clear(); 80086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(Root); 80186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman return Root; 80286e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman } 80386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman 80486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman void CopyValueToVirtualRegister(Value *V, unsigned Reg); 805571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 8061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(Instruction &I) { visit(I.getOpcode(), I); } 8071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visit(unsigned Opcode, User &I) { 8091e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // Note: this doesn't use InstVisitor, because it has to work with 8101e7aa5c209109d07af30c8a2e9bfd82cf3824246Chris Lattner // ConstantExpr's in addition to instructions. 8111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner switch (Opcode) { 8121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner default: assert(0 && "Unknown instruction type encountered!"); 8131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 8141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Build the switch statement using the Instruction.def file. 8151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#define HANDLE_INST(NUM, OPCODE, CLASS) \ 8161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner case Instruction::OPCODE:return visit##OPCODE((CLASS&)I); 8171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner#include "llvm/Instruction.def" 8181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8211c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void setCurrentBasicBlock(MachineBasicBlock *MBB) { CurMBB = MBB; } 8221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 823475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue getValue(const Value *V); 8241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 825475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void setValue(const Value *V, SDValue NewN) { 826475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &N = NodeMap[V]; 827ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif assert(N.getNode() == 0 && "Already set a value for this node!"); 8280da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner N = NewN; 8291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8304e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 8315c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng void GetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 832e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 833e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &InputRegs); 834f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 835571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void FindMergedConditions(Value *Cond, MachineBasicBlock *TBB, 836571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, MachineBasicBlock *CurBB, 837571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc); 8389ffd8b5720d606eb7da702c97ed6491697867949Dan Gohman bool ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases); 8398c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner bool isExportableFromCurrentBlock(Value *V, const BasicBlock *FromBB); 840571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner void ExportFromCurrentBlock(Value *V); 841475871a144eb604ddaf37503397ba0941442e5fbDan Gohman void LowerCallTo(CallSite CS, SDValue Callee, bool IsTailCall, 842070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad = NULL); 843dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands 8441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Terminator instructions. 8451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitRet(ReturnInst &I); 8461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitBr(BranchInst &I); 847f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman void visitSwitch(SwitchInst &I); 8481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUnreachable(UnreachableInst &I) { /* noop */ } 8491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 850b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Helpers for visitSwitch 851dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleSmallSwitchRange(CaseRec& CR, 852b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 853b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 854b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 855dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleJTSwitchCase(CaseRec& CR, 856b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 857b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 858b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 859dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov bool handleBTSplitSwitchCase(CaseRec& CR, 860b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 861b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 862b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default); 8634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov bool handleBitTestsSwitchCase(CaseRec& CR, 8644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 8654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 8664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Default); 8677c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman void visitSwitchCase(CaseBlock &CB); 8687c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman void visitBitTestHeader(BitTestBlock &B); 8694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov void visitBitTestCase(MachineBasicBlock* NextMBB, 8704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 8717c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BitTestCase &B); 8727c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman void visitJumpTable(JumpTable &JT); 8737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman void visitJumpTableHeader(JumpTable &JT, JumpTableHeader &JTH); 874f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 8751c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // These all get lowered before this pass. 876b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitInvoke(InvokeInst &I); 877b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey void visitUnwind(UnwindInst &I); 8781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 8797f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitBinary(User &I, unsigned OpCode); 880e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman void visitShift(User &I, unsigned Opcode); 8815fbb5d2459a5410590f285250faa604576308a93Nate Begeman void visitAdd(User &I) { 8827f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 8837f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FADD); 8841628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 8857f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::ADD); 88601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 887b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner void visitSub(User &I); 8881628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer void visitMul(User &I) { 8897f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (I.getType()->isFPOrFPVector()) 8907f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::FMUL); 8911628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer else 8927f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, ISD::MUL); 8931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 8947f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitURem(User &I) { visitBinary(I, ISD::UREM); } 8957f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSRem(User &I) { visitBinary(I, ISD::SREM); } 8967f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFRem(User &I) { visitBinary(I, ISD::FREM); } 8977f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitUDiv(User &I) { visitBinary(I, ISD::UDIV); } 8987f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitSDiv(User &I) { visitBinary(I, ISD::SDIV); } 8997f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitFDiv(User &I) { visitBinary(I, ISD::FDIV); } 9007f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitAnd (User &I) { visitBinary(I, ISD::AND); } 9017f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitOr (User &I) { visitBinary(I, ISD::OR); } 9027f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman void visitXor (User &I) { visitBinary(I, ISD::XOR); } 90324d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer void visitShl (User &I) { visitShift(I, ISD::SHL); } 9043822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitLShr(User &I) { visitShift(I, ISD::SRL); } 9053822ff5c71478c7c90a50ca57045fb676fcb5005Reid Spencer void visitAShr(User &I) { visitShift(I, ISD::SRA); } 90645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitICmp(User &I); 90745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer void visitFCmp(User &I); 908b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVICmp(User &I); 909b43e9c196542acc80c9e4643809661065710848fNate Begeman void visitVFCmp(User &I); 9103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Visit the conversion instructions 9113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitTrunc(User &I); 9123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitZExt(User &I); 9133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSExt(User &I); 9143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPTrunc(User &I); 9153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPExt(User &I); 9163da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToUI(User &I); 9173da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitFPToSI(User &I); 9183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitUIToFP(User &I); 9193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitSIToFP(User &I); 9203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitPtrToInt(User &I); 9213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitIntToPtr(User &I); 9223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer void visitBitCast(User &I); 9231c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 9242bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitExtractElement(User &I); 9252bbd81064a6998496a71ff7ae8160b3caada64faChris Lattner void visitInsertElement(User &I); 9263e104b11168da4692b69cc6b236c1da22adff959Chris Lattner void visitShuffleVector(User &I); 927c7029805ef35ce9805931067b841e6af11db382eChris Lattner 9281d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitExtractValue(ExtractValueInst &I); 9291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman void visitInsertValue(InsertValueInst &I); 930041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 9311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitGetElementPtr(User &I); 9321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitSelect(User &I); 9331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 9341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitMalloc(MallocInst &I); 9351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitFree(FreeInst &I); 9361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitAlloca(AllocaInst &I); 9371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitLoad(LoadInst &I); 9381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitStore(StoreInst &I); 9391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitPHI(PHINode &I) { } // PHI nodes are handled specially. 9401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitCall(CallInst &I); 941fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands void visitInlineAsm(CallSite CS); 942c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner const char *visitIntrinsicCall(CallInst &I, unsigned Intrinsic); 9430eade319cdb72e24c11d068728a98083737c6435Chris Lattner void visitTargetIntrinsic(CallInst &I, unsigned Intrinsic); 9441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 9451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAStart(CallInst &I); 9461c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAArg(VAArgInst &I); 9471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVAEnd(CallInst &I); 9481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitVACopy(CallInst &I); 9491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 9501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp1(Instruction &I) { 9511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp1 should not exist at instruction selection time!"); 9521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 9531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 9541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner void visitUserOp2(Instruction &I) { 9551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner assert(0 && "UserOp2 should not exist at instruction selection time!"); 9561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner abort(); 9571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 95863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 95963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangprivate: 96063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang inline const char *implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op); 96163307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 9621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner}; 9631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} // end namespace llvm 9641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 9656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 966b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyFromParts - Create a value that contains the specified legal parts 967b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// combined into the value they represent. If the parts combine to a type 968b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// larger then ValueVT then AssertOp can be used to specify whether the extra 969b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// bits are known to be zero (ISD::AssertZext) or sign extended from ValueVT 9704468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner/// (ISD::AssertSext). 971475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstatic SDValue getCopyFromParts(SelectionDAG &DAG, 972475871a144eb604ddaf37503397ba0941442e5fbDan Gohman const SDValue *Parts, 9736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 97483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 97583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT, 9764468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner ISD::NodeType AssertOp = ISD::DELETED_NODE) { 977014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts > 0 && "No parts to assemble!"); 978014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TargetLowering &TLI = DAG.getTargetLoweringInfo(); 979475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = Parts[0]; 980014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 981014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts > 1) { 982014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the value from multiple parts. 98383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 98483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 98583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned ValueBits = ValueVT.getSizeInBits(); 986014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 987014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the power of 2 part. 988014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = NumParts & (NumParts - 1) ? 989014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1 << Log2_32(NumParts) : NumParts; 990014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = PartBits * RoundParts; 99183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RoundVT = RoundBits == ValueBits ? 99283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT : MVT::getIntegerVT(RoundBits); 993475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Lo, Hi; 994014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 995014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts > 2) { 99683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT HalfVT = MVT::getIntegerVT(RoundBits/2); 997014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = getCopyFromParts(DAG, Parts, RoundParts/2, PartVT, HalfVT); 998014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts/2, RoundParts/2, 999014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, HalfVT); 10006183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else { 1001014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Parts[0]; 1002014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = Parts[1]; 10036183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1004014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1005014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 1006014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BUILD_PAIR, RoundVT, Lo, Hi); 1007014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1008014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (RoundParts < NumParts) { 1009014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the trailing non-power-of-2 part. 1010014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 101183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OddVT = MVT::getIntegerVT(OddParts * PartBits); 1012014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = getCopyFromParts(DAG, Parts+RoundParts, OddParts, PartVT, OddVT); 1013014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1014014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Combine the round and odd parts. 1015014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = Val; 1016014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1017014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::swap(Lo, Hi); 101883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT TotalVT = MVT::getIntegerVT(NumParts * PartBits); 1019014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::ANY_EXTEND, TotalVT, Hi); 1020014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Hi = DAG.getNode(ISD::SHL, TotalVT, Hi, 102183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands DAG.getConstant(Lo.getValueType().getSizeInBits(), 1022014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 1023014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Lo = DAG.getNode(ISD::ZERO_EXTEND, TotalVT, Lo); 1024014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::OR, TotalVT, Lo, Hi); 1025014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1026014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1027014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Handle a multi-element vector. 102883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 1029014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumIntermediates; 1030014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned NumRegs = 1031014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 1032014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands RegisterVT); 1033014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 103435213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 1035014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 1036014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(RegisterVT == Parts[0].getValueType() && 1037014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Part type doesn't match part!"); 1038014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1039014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Assemble the parts into intermediate operands. 1040475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops(NumIntermediates); 1041014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumIntermediates == NumParts) { 1042014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the register was not expanded, truncate or copy the value, 1043014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // as appropriate. 1044014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumParts; ++i) 1045014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i], 1, 1046014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 1047014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else if (NumParts > 0) { 1048014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the intermediate type was expanded, build the intermediate operands 1049014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // from the parts. 1050014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts % NumIntermediates == 0 && 1051014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Must expand into a divisible number of parts!"); 1052014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned Factor = NumParts / NumIntermediates; 1053014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i != NumIntermediates; ++i) 1054014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Ops[i] = getCopyFromParts(DAG, &Parts[i * Factor], Factor, 1055014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT, IntermediateVT); 1056014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1057014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1058014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Build a vector with BUILD_VECTOR or CONCAT_VECTORS from the intermediate 1059014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // operands. 106083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands Val = DAG.getNode(IntermediateVT.isVector() ? 1061014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ISD::CONCAT_VECTORS : ISD::BUILD_VECTOR, 1062014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT, &Ops[0], NumIntermediates); 10636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1064014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 10656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1066014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // There is now one part, held in Val. Correct it to match ValueVT. 1067014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands PartVT = Val.getValueType(); 10686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1069014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) 1070014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return Val; 1071014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 107283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 107383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.isVector() && "Unknown vector conversion!"); 1074014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 10756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 10766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 107783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (ValueVT.isVector()) { 107883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 107983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 1080014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Only trivial scalar-to-vector conversions should get here!"); 1081014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BUILD_VECTOR, ValueVT, Val); 1082014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 10836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 108483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && 108583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.isInteger()) { 10868e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(PartVT)) { 1087014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // For a truncate, see if we have any information to 1088014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // indicate whether the truncated bits will always be 1089014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // zero or sign-extension. 1090014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (AssertOp != ISD::DELETED_NODE) 1091014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(AssertOp, PartVT, Val, 1092014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getValueType(ValueVT)); 1093014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1094014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1095014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::ANY_EXTEND, ValueVT, Val); 1096014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 10976183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1098014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 109983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 11008e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (ValueVT.bitsLT(Val.getValueType())) 11014468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner // FP_ROUND's are always exact here. 1102d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_ROUND, ValueVT, Val, 11034468c1fd1c3dcc2cca7b881eb9f37f018405d2d9Chris Lattner DAG.getIntPtrConstant(1)); 1104d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner return DAG.getNode(ISD::FP_EXTEND, ValueVT, Val); 1105d43d85ccc9cb8d4cd00e5cf38827f50b415255ffChris Lattner } 1106014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 110783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.getSizeInBits() == ValueVT.getSizeInBits()) 1108014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return DAG.getNode(ISD::BIT_CONVERT, ValueVT, Val); 1109014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1110014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1111475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); 11126183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 11136183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1114b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// getCopyToParts - Create a series of nodes that contain the specified value 1115b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// split into legal parts. If the parts contain more bits than Val, then, for 1116b988baccc229ef3e175905c999245d5544a0d384Duncan Sands/// integers, ExtendKind can be used to specify how to generate the extra bits. 11176183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohmanstatic void getCopyToParts(SelectionDAG &DAG, 1118475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val, 1119475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue *Parts, 11206183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumParts, 112183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PartVT, 1122b988baccc229ef3e175905c999245d5544a0d384Duncan Sands ISD::NodeType ExtendKind = ISD::ANY_EXTEND) { 112325ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman TargetLowering &TLI = DAG.getTargetLoweringInfo(); 112483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PtrVT = TLI.getPointerTy(); 112583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = Val.getValueType(); 112683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned PartBits = PartVT.getSizeInBits(); 1127014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(TLI.isTypeLegal(PartVT) && "Copying to an illegal type!"); 1128014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1129014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (!NumParts) 1130014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1131014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 113283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (!ValueVT.isVector()) { 1133014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (PartVT == ValueVT) { 1134014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "No-op copy with multiple parts!"); 1135014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 1136014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1137014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1138014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 113983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (NumParts * PartBits > ValueVT.getSizeInBits()) { 1140014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover more bits than the value has, promote the value. 114183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isFloatingPoint() && ValueVT.isFloatingPoint()) { 1142014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && "Do not know what to promote to!"); 1143014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::FP_EXTEND, PartVT, Val); 114483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartVT.isInteger() && ValueVT.isInteger()) { 114583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1146014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ExtendKind, ValueVT, Val); 1147014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1148014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1149014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 115083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (PartBits == ValueVT.getSizeInBits()) { 1151014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Different types of the same size. 1152014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(NumParts == 1 && PartVT != ValueVT); 1153014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 115483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands } else if (NumParts * PartBits < ValueVT.getSizeInBits()) { 1155014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // If the parts cover less bits than value has, truncate the value. 115683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isInteger() && ValueVT.isInteger()) { 115783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1158014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1159014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 1160014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(0 && "Unknown mismatch!"); 1161014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1162014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 11636183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1164014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The value may have changed - recompute ValueVT. 1165014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands ValueVT = Val.getValueType(); 116683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(NumParts * PartBits == ValueVT.getSizeInBits() && 1167014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Failed to tile the value with PartVT!"); 1168014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1169014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 1170014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands assert(PartVT == ValueVT && "Type conversion failed!"); 1171014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Parts[0] = Val; 11726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 11736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 11746183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1175014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Expand the value into multiple parts. 1176014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts & (NumParts - 1)) { 1177014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is not a power of 2. Split off and copy the tail. 117883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(PartVT.isInteger() && ValueVT.isInteger() && 1179014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands "Do not know what to expand to!"); 1180014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundParts = 1 << Log2_32(NumParts); 1181014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned RoundBits = RoundParts * PartBits; 1182014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned OddParts = NumParts - RoundParts; 1183475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OddVal = DAG.getNode(ISD::SRL, ValueVT, Val, 1184014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands DAG.getConstant(RoundBits, 1185014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands TLI.getShiftAmountTy())); 1186014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands getCopyToParts(DAG, OddVal, Parts + RoundParts, OddParts, PartVT); 1187014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1188014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The odd parts were reversed by getCopyToParts - unreverse them. 1189014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts + RoundParts, Parts + NumParts); 1190014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands NumParts = RoundParts; 119183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT = MVT::getIntegerVT(NumParts * PartBits); 1192014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands Val = DAG.getNode(ISD::TRUNCATE, ValueVT, Val); 1193014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1194014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1195014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // The number of parts is a power of 2. Repeatedly bisect the value using 1196014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // EXTRACT_ELEMENT. 119725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Parts[0] = DAG.getNode(ISD::BIT_CONVERT, 119883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT::getIntegerVT(ValueVT.getSizeInBits()), 119925eb043759c23b61769108f78382eb9701c41db2Duncan Sands Val); 1200014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned StepSize = NumParts; StepSize > 1; StepSize /= 2) { 1201014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands for (unsigned i = 0; i < NumParts; i += StepSize) { 1202014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands unsigned ThisBits = StepSize * PartBits / 2; 120383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::getIntegerVT (ThisBits); 1204475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Part0 = Parts[i]; 1205475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Part1 = Parts[i+StepSize/2]; 120625eb043759c23b61769108f78382eb9701c41db2Duncan Sands 120725eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 120825eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(1, PtrVT)); 120925eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::EXTRACT_ELEMENT, ThisVT, Part0, 121025eb043759c23b61769108f78382eb9701c41db2Duncan Sands DAG.getConstant(0, PtrVT)); 121125eb043759c23b61769108f78382eb9701c41db2Duncan Sands 121225eb043759c23b61769108f78382eb9701c41db2Duncan Sands if (ThisBits == PartBits && ThisVT != PartVT) { 121325eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part0 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part0); 121425eb043759c23b61769108f78382eb9701c41db2Duncan Sands Part1 = DAG.getNode(ISD::BIT_CONVERT, PartVT, Part1); 121525eb043759c23b61769108f78382eb9701c41db2Duncan Sands } 1216014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1217014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1218014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1219014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (TLI.isBigEndian()) 1220014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands std::reverse(Parts, Parts + NumParts); 1221014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1222014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands return; 1223014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } 1224014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 1225014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands // Vector ValueVT. 1226014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands if (NumParts == 1) { 12276183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (PartVT != ValueVT) { 122883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (PartVT.isVector()) { 12296183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Val = DAG.getNode(ISD::BIT_CONVERT, PartVT, Val); 1230014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands } else { 123183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands assert(ValueVT.getVectorElementType() == PartVT && 123283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands ValueVT.getVectorNumElements() == 1 && 1233a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman "Only trivial vector-to-scalar conversions should get here!"); 1234a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman Val = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, PartVT, Val, 1235a9b511187b5450ec2e241f45b640358bfdc9c42cDan Gohman DAG.getConstant(0, PtrVT)); 12366183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 12376183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 1238014e04a5daeb312b1f0ebc1dd906ffc97c4abc5fDuncan Sands 12396183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Parts[0] = Val; 12406183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman return; 12416183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 12426183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 12436183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Handle a multi-element vector. 124483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntermediateVT, RegisterVT; 12456183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumIntermediates; 12466183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned NumRegs = 12476183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getTargetLoweringInfo() 12486183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman .getVectorTypeBreakdown(ValueVT, IntermediateVT, NumIntermediates, 12496183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman RegisterVT); 125083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned NumElements = ValueVT.getVectorNumElements(); 12516183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 12526183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumRegs == NumParts && "Part count doesn't match vector breakdown!"); 125335213344672fb5215a36c8dd592a7cc7190445faEvan Cheng NumParts = NumRegs; // Silence a compiler warning. 12546183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(RegisterVT == PartVT && "Part type doesn't match vector breakdown!"); 12556183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 12566183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the vector into intermediate operands. 1257475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops(NumIntermediates); 12586183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 125983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (IntermediateVT.isVector()) 12606183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_SUBVECTOR, 12616183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 12626183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman DAG.getConstant(i * (NumElements / NumIntermediates), 126325ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman PtrVT)); 12646183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman else 12656183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman Ops[i] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 12666183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman IntermediateVT, Val, 126725ac7e8364f475597e2a6f3628fce839583e1f45Dan Gohman DAG.getConstant(i, PtrVT)); 12686183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 12696183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // Split the intermediate operands into legal parts. 12706183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman if (NumParts == NumIntermediates) { 12716183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the register was not expanded, promote or copy the value, 12726183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // as appropriate. 12736183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumParts; ++i) 1274532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i], 1, PartVT); 12756183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } else if (NumParts > 0) { 12766183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // If the intermediate type was expanded, split each the value into 12776183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman // legal parts. 12786183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman assert(NumParts % NumIntermediates == 0 && 12796183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman "Must expand into a divisible number of parts!"); 12806183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman unsigned Factor = NumParts / NumIntermediates; 12816183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman for (unsigned i = 0; i != NumIntermediates; ++i) 1282532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman getCopyToParts(DAG, Ops[i], &Parts[i * Factor], Factor, PartVT); 12836183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman } 12846183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman} 12856183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 12866183f78cf8c6f56cc436f19120acf2a7856cb9dbDan Gohman 1287475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue SelectionDAGLowering::getValue(const Value *V) { 1288475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &N = NodeMap[V]; 1289ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif if (N.getNode()) return N; 1290199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1291199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V))) { 129283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(V->getType(), true); 1293b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1294b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(C)) 1295b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstant(CI->getValue(), VT); 1296b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1297b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (GlobalValue *GV = dyn_cast<GlobalValue>(C)) 1298199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getGlobalAddress(GV, VT); 1299b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1300b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (isa<ConstantPointerNull>(C)) 1301199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return N = DAG.getConstant(0, TLI.getPointerTy()); 1302b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1303b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(C)) 1304b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N = DAG.getConstantFP(CFP->getValueAPF(), VT); 1305b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 13061d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C) && !isa<VectorType>(V->getType()) && 13071d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman !V->getType()->isAggregateType()) 13086833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner return N = DAG.getNode(ISD::UNDEF, VT); 1309b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1310b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C)) { 1311b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner visit(CE->getOpcode(), *CE); 1312475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N1 = NodeMap[V]; 1313ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif assert(N1.getNode() && "visit didn't populate the ValueMap!"); 1314b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return N1; 1315b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner } 1316b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 13171d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<ConstantStruct>(C) || isa<ConstantArray>(C)) { 1318475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Constants; 13191d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (User::const_op_iterator OI = C->op_begin(), OE = C->op_end(); 13201d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman OI != OE; ++OI) { 1321ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif SDNode *Val = getValue(*OI).getNode(); 13224bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands for (unsigned i = 0, e = Val->getNumValues(); i != e; ++i) 1323475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Constants.push_back(SDValue(Val, i)); 13241d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 13254bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands return DAG.getMergeValues(&Constants[0], Constants.size()); 13261d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 13271d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 13281f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman if (isa<StructType>(C->getType()) || isa<ArrayType>(C->getType())) { 13291d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 13301f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman "Unknown struct or array constant!"); 13311d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 13321f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman SmallVector<MVT, 4> ValueVTs; 13331f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman ComputeValueVTs(TLI, C->getType(), ValueVTs); 13341f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman unsigned NumElts = ValueVTs.size(); 13358a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumElts == 0) 1336475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); // empty struct 1337475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Constants(NumElts); 13381f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman for (unsigned i = 0; i != NumElts; ++i) { 13391f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman MVT EltVT = ValueVTs[i]; 13401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman if (isa<UndefValue>(C)) 13411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getNode(ISD::UNDEF, EltVT); 13421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else if (EltVT.isFloatingPoint()) 13431d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstantFP(0, EltVT); 13441d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman else 13451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Constants[i] = DAG.getConstant(0, EltVT); 13461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 13471f565bcff6781d0a4395b4c386f7168df13ddbcaDan Gohman return DAG.getMergeValues(&Constants[0], NumElts); 13481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 13491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 13506833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner const VectorType *VecTy = cast<VectorType>(V->getType()); 1351b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner unsigned NumElements = VecTy->getNumElements(); 1352b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 13536833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // Now that we know the number and type of the elements, get that number of 13546833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner // elements into the Ops array based on what kind of constant it is. 1355475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 16> Ops; 1356b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner if (ConstantVector *CP = dyn_cast<ConstantVector>(C)) { 1357b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner for (unsigned i = 0; i != NumElements; ++i) 1358b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.push_back(getValue(CP->getOperand(i))); 1359199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } else { 13606833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner assert((isa<ConstantAggregateZero>(C) || isa<UndefValue>(C)) && 13616833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner "Unknown vector constant!"); 136283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(VecTy->getElementType()); 13636833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 1364475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op; 13656833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (isa<UndefValue>(C)) 13666833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getNode(ISD::UNDEF, EltVT); 136783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands else if (EltVT.isFloatingPoint()) 13686833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstantFP(0, EltVT); 1369b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner else 13706833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Op = DAG.getConstant(0, EltVT); 1371b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner Ops.assign(NumElements, Op); 1372199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1373b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1374b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // Create a BUILD_VECTOR node. 1375b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner return NodeMap[V] = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size()); 1376199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1377199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1378b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // If this is a static alloca, generate it as the frameindex instead of 1379b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner // computation. 1380199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (const AllocaInst *AI = dyn_cast<AllocaInst>(V)) { 13816ecf50908c78aae0feff1c378fbb75dcf013ed21Dan Gohman DenseMap<const AllocaInst*, int>::iterator SI = 1382b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner FuncInfo.StaticAllocaMap.find(AI); 1383199862b74973198c2ab5a139f664c86713e7b579Chris Lattner if (SI != FuncInfo.StaticAllocaMap.end()) 1384199862b74973198c2ab5a139f664c86713e7b579Chris Lattner return DAG.getFrameIndex(SI->second, TLI.getPointerTy()); 1385199862b74973198c2ab5a139f664c86713e7b579Chris Lattner } 1386199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1387251db1890c1fe03d02ee878ada8129537844d031Chris Lattner unsigned InReg = FuncInfo.ValueMap[V]; 1388251db1890c1fe03d02ee878ada8129537844d031Chris Lattner assert(InReg && "Value not in map!"); 1389199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 13906833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner RegsForValue RFV(TLI, InReg, V->getType()); 1391475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getEntryNode(); 1392b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return RFV.getCopyFromRegs(DAG, Chain, NULL); 1393199862b74973198c2ab5a139f664c86713e7b579Chris Lattner} 1394199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 1395199862b74973198c2ab5a139f664c86713e7b579Chris Lattner 13961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitRet(ReturnInst &I) { 13971c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.getNumOperands() == 0) { 139886e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, getControlRoot())); 13991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; 14001c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1401b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner 1402475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> NewValues; 140386e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman NewValues.push_back(getControlRoot()); 140486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) { 1405475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RetOp = getValue(I.getOperand(i)); 1406b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1407ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman SmallVector<MVT, 4> ValueVTs; 1408ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ComputeValueVTs(TLI, I.getOperand(i)->getType(), ValueVTs); 1409ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned j = 0, f = ValueVTs.size(); j != f; ++j) { 1410ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT VT = ValueVTs[j]; 1411ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1412ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // FIXME: C calling convention requires the return type to be promoted to 1413ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman // at least 32-bit. But this is not necessary for non-C calling conventions. 1414ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.isInteger()) { 1415ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT MinVT = TLI.getRegisterType(MVT::i32); 1416ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (VT.bitsLT(MinVT)) 1417ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman VT = MinVT; 1418ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1419b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 1420ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman unsigned NumParts = TLI.getNumRegisters(VT); 1421ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman MVT PartVT = TLI.getRegisterType(VT); 1422475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 1423ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 1424ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1425ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman const Function *F = I.getParent()->getParent(); 1426ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman if (F->paramHasAttr(0, ParamAttr::SExt)) 1427ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 1428ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman else if (F->paramHasAttr(0, ParamAttr::ZExt)) 1429ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 1430ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1431ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif getCopyToParts(DAG, SDValue(RetOp.getNode(), RetOp.getResNo() + j), 1432ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman &Parts[0], NumParts, PartVT, ExtendKind); 1433ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman 1434ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman for (unsigned i = 0; i < NumParts; ++i) { 1435ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(Parts[i]); 1436ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman NewValues.push_back(DAG.getArgFlags(ISD::ArgFlagsTy())); 1437ab8ec0a26caa754f0376dbdede3a33ad84f23e21Dan Gohman } 1438ee625573b5b39b91441fc6ea23f3ba415abdc71fNate Begeman } 14391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 1440bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner DAG.setRoot(DAG.getNode(ISD::RET, MVT::Other, 1441bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &NewValues[0], NewValues.size())); 14421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 14431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1444571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// ExportFromCurrentBlock - If this condition isn't known to be exported from 1445571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// the current basic block, add it to ValueMap now so that we'll get a 1446571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// CopyTo/FromReg. 1447571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::ExportFromCurrentBlock(Value *V) { 1448571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // No need to export constants. 1449571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (!isa<Instruction>(V) && !isa<Argument>(V)) return; 1450571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1451571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Already exported? 1452571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (FuncInfo.isExportedInst(V)) return; 1453571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1454571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Reg = FuncInfo.InitializeRegForValue(V); 145586e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(V, Reg); 1456571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1457571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 14588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattnerbool SelectionDAGLowering::isExportableFromCurrentBlock(Value *V, 14598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner const BasicBlock *FromBB) { 14608c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // The operands of the setcc have to be in this block. We don't know 14618c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // how to export them from some other block. 14628c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Instruction *VI = dyn_cast<Instruction>(V)) { 14638c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Can export from current BB. 14648c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (VI->getParent() == FromBB) 14658c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 14668c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 14678c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Is already exported, noop. 14688c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 14698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 14708c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 14718c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this is an argument, we can export it if the BB is the entry block or 14728c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // if it is already exported. 14738c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (isa<Argument>(V)) { 14748c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (FromBB == &FromBB->getParent()->getEntryBlock()) 14758c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 14768c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 14778c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, can only export this if it is already exported. 14788c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return FuncInfo.isExportedInst(V); 14798c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 14808c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 14818c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Otherwise, constants can always be exported. 14828c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner return true; 14838c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner} 14848c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 14856a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattnerstatic bool InBlock(const Value *V, const BasicBlock *BB) { 14866a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner if (const Instruction *I = dyn_cast<Instruction>(V)) 14876a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return I->getParent() == BB; 14886a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner return true; 14896a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner} 14906a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner 1491571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner/// FindMergedConditions - If Cond is an expression like 1492571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattnervoid SelectionDAGLowering::FindMergedConditions(Value *Cond, 1493571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *TBB, 1494571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *FBB, 1495571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineBasicBlock *CurBB, 1496571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner unsigned Opc) { 1497571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this node is not part of the or/and tree, emit it as a branch. 1498e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Instruction *BOp = dyn_cast<Instruction>(Cond); 1499571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1500e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (!BOp || !(isa<BinaryOperator>(BOp) || isa<CmpInst>(BOp)) || 1501e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer (unsigned)BOp->getOpcode() != Opc || !BOp->hasOneUse() || 15026a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner BOp->getParent() != CurBB->getBasicBlock() || 15036a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(0), CurBB->getBasicBlock()) || 15046a586c8d9a7ba032adf0619d06473310c41cae14Chris Lattner !InBlock(BOp->getOperand(1), CurBB->getBasicBlock())) { 1505571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner const BasicBlock *BB = CurBB->getBasicBlock(); 1506571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1507e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // If the leaf of the tree is a comparison, merge the condition into 1508e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // the caseblock. 1509e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if ((isa<ICmpInst>(Cond) || isa<FCmpInst>(Cond)) && 1510e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer // The operands of the cmp have to be in this block. We don't know 15115a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // how to export them from some other block. If this is the first block 15125a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner // of the sequence, no exporting is needed. 15135a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (CurBB == CurMBB || 15145a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner (isExportableFromCurrentBlock(BOp->getOperand(0), BB) && 15155a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner isExportableFromCurrentBlock(BOp->getOperand(1), BB)))) { 1516e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer BOp = cast<Instruction>(Cond); 1517e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition; 1518e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(Cond)) { 1519e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (IC->getPredicate()) { 1520e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown icmp predicate opcode!"); 1521e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_EQ: Condition = ISD::SETEQ; break; 1522e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_NE: Condition = ISD::SETNE; break; 1523e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLE: Condition = ISD::SETLE; break; 1524e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULE: Condition = ISD::SETULE; break; 1525e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGE: Condition = ISD::SETGE; break; 1526e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGE: Condition = ISD::SETUGE; break; 1527e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SLT: Condition = ISD::SETLT; break; 1528e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_ULT: Condition = ISD::SETULT; break; 1529e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_SGT: Condition = ISD::SETGT; break; 1530e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case ICmpInst::ICMP_UGT: Condition = ISD::SETUGT; break; 1531e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1532e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else if (FCmpInst *FC = dyn_cast<FCmpInst>(Cond)) { 1533e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode FPC, FOC; 1534e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (FC->getPredicate()) { 1535e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer default: assert(0 && "Unknown fcmp predicate opcode!"); 1536e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 1537e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 1538e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 1539e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 1540e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 1541e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 1542e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 15436bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 15446bf30ab347bc00a8dc7115244298d78f7721ea34Chris Lattner case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 1545e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 1546e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 1547e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 1548e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 1549e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 1550e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 1551e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 1552e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } 1553e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 1554e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 1555e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 1556e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 1557e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer } else { 15580da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner Condition = ISD::SETEQ; // silence warning. 1559e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer assert(0 && "Unknown compare instruction"); 1560571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1561571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 15627c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CaseBlock CB(Condition, BOp->getOperand(0), 15637c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BOp->getOperand(1), NULL, TBB, FBB, CurBB); 1564571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1565571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1566571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1567571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1568571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Create a CaseBlock record representing this branch. 15697c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CaseBlock CB(ISD::SETEQ, Cond, ConstantInt::getTrue(), 15707c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman NULL, TBB, FBB, CurBB); 1571571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner SwitchCases.push_back(CB); 1572571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner return; 1573571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1574571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1575d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1576d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Create TmpBB after CurBB. 1577571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner MachineFunction::iterator BBI = CurBB; 15780e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineFunction &MF = DAG.getMachineFunction(); 15790e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *TmpBB = MF.CreateMachineBasicBlock(CurBB->getBasicBlock()); 15800e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurBB->getParent()->insert(++BBI, TmpBB); 1581571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1582d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner if (Opc == Instruction::Or) { 1583d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X | Y as: 1584d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TBB 1585d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp TmpBB 1586d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1587d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1588d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1589d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1590571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1591d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1592d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TBB, TmpBB, CurBB, Opc); 1593d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1594d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1595d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1596d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } else { 1597d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner assert(Opc == Instruction::And && "Unknown merge op!"); 1598d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Codegen X & Y as: 1599d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_X TmpBB 1600d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1601d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // TmpBB: 1602d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp_if_Y TBB 1603d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // jmp FBB 1604d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // 1605d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // This requires creation of TmpBB after CurBB. 1606d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1607d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the LHS condition. 1608d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(0), TmpBB, FBB, CurBB, Opc); 1609d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner 1610d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner // Emit the RHS condition into TmpBB. 1611d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner FindMergedConditions(BOp->getOperand(1), TBB, FBB, TmpBB, Opc); 1612d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner } 1613571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner} 1614571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1615df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If the set of cases should be emitted as a series of branches, return true. 1616df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// If we should emit this as a bunch of and/or'd together conditions, return 1617df19f27d039fd791c73e39f4134319debc75db4fChris Lattner/// false. 16189ffd8b5720d606eb7da702c97ed6491697867949Dan Gohmanbool 16199ffd8b5720d606eb7da702c97ed6491697867949Dan GohmanSelectionDAGLowering::ShouldEmitAsBranches(const std::vector<CaseBlock> &Cases){ 1620df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (Cases.size() != 2) return true; 1621df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 16220ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If this is two comparisons of the same values or'd or and'd together, they 16230ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // will get folded into a single comparison, so don't emit two blocks. 16240ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner if ((Cases[0].CmpLHS == Cases[1].CmpLHS && 16250ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpRHS == Cases[1].CmpRHS) || 16260ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner (Cases[0].CmpRHS == Cases[1].CmpLHS && 16270ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner Cases[0].CmpLHS == Cases[1].CmpRHS)) { 16280ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner return false; 16290ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner } 16300ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1631df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return true; 1632df19f27d039fd791c73e39f4134319debc75db4fChris Lattner} 1633df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 16341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitBr(BranchInst &I) { 16351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Update machine-CFG edges. 16361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *Succ0MBB = FuncInfo.MBBMap[I.getSuccessor(0)]; 16371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 16381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Figure out which block is immediately after the current one. 16391c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineBasicBlock *NextBlock = 0; 16401c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction::iterator BBI = CurMBB; 16411c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (++BBI != CurMBB->getParent()->end()) 16421c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner NextBlock = BBI; 16431c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 16441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (I.isUnconditional()) { 16452d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update machine-CFG edges. 16462d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Succ0MBB); 16472d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 16481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is not a fall-through branch, emit the branch. 16491c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Succ0MBB != NextBlock) 165086e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 1651dedf2bd5a34dac25e4245f58bb902ced6b64edd9Misha Brukman DAG.getBasicBlock(Succ0MBB))); 165257ab65972e09be54da6461e483664ebf34afa1eeChris Lattner return; 165357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner } 165457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 165557ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // If this condition is one of the special cases we handle, do special stuff 165657ab65972e09be54da6461e483664ebf34afa1eeChris Lattner // now. 165757ab65972e09be54da6461e483664ebf34afa1eeChris Lattner Value *CondVal = I.getCondition(); 165857ab65972e09be54da6461e483664ebf34afa1eeChris Lattner MachineBasicBlock *Succ1MBB = FuncInfo.MBBMap[I.getSuccessor(1)]; 1659571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner 1660571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // If this is a series of conditions that are or'd or and'd together, emit 1661571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // this as a sequence of branches instead of setcc's with and/or operations. 1662571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // For example, instead of something like: 1663571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1664571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // C = seteq 1665571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1666571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // F = setle 1667571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // or C, F 1668571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jnz foo 1669571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // Emit: 1670571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp A, B 1671571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // je foo 1672571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // cmp D, E 1673571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // jle foo 1674571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner // 1675571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(CondVal)) { 1676571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner if (BOp->hasOneUse() && 1677d2f9ee9ea7b08c23a8742b6a53dd78a20233adc0Chris Lattner (BOp->getOpcode() == Instruction::And || 1678571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner BOp->getOpcode() == Instruction::Or)) { 1679571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner FindMergedConditions(BOp, Succ0MBB, Succ1MBB, CurMBB, BOp->getOpcode()); 16800ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // If the compares in later blocks need to use values not currently 16810ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // exported from this block, export them now. This block should always 16820ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // be the first entry. 16830ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner assert(SwitchCases[0].ThisBB == CurMBB && "Unexpected lowering!"); 16840ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1685df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Allow some cases to be rejected. 1686df19f27d039fd791c73e39f4134319debc75db4fChris Lattner if (ShouldEmitAsBranches(SwitchCases)) { 1687df19f27d039fd791c73e39f4134319debc75db4fChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) { 1688df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpLHS); 1689df19f27d039fd791c73e39f4134319debc75db4fChris Lattner ExportFromCurrentBlock(SwitchCases[i].CmpRHS); 1690df19f27d039fd791c73e39f4134319debc75db4fChris Lattner } 1691df19f27d039fd791c73e39f4134319debc75db4fChris Lattner 1692df19f27d039fd791c73e39f4134319debc75db4fChris Lattner // Emit the branch for this block. 1693df19f27d039fd791c73e39f4134319debc75db4fChris Lattner visitSwitchCase(SwitchCases[0]); 1694df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.erase(SwitchCases.begin()); 1695df19f27d039fd791c73e39f4134319debc75db4fChris Lattner return; 16965a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner } 16975a145f0094d7e15ca3c0326b1af2ea0ad19f9726Chris Lattner 16980ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // Okay, we decided not to do this, remove any inserted MBB's and clear 16990ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner // SwitchCases. 17000ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner for (unsigned i = 1, e = SwitchCases.size(); i != e; ++i) 17010e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMBB->getParent()->erase(SwitchCases[i].ThisBB); 17020ccb500fa7a28baeb66754ff4a6950fa0e82617dChris Lattner 1703df19f27d039fd791c73e39f4134319debc75db4fChris Lattner SwitchCases.clear(); 1704571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 1705571e434a34e26f295f13db2dd07551de7e25f8a9Chris Lattner } 17062452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner 17072452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Create a CaseBlock record representing this branch. 17087c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CaseBlock CB(ISD::SETEQ, CondVal, ConstantInt::getTrue(), 17097c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman NULL, Succ0MBB, Succ1MBB, CurMBB); 17102452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // Use visitSwitchCase to actually insert the fast branch sequence for this 17112452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner // cond branch. 17122452595927a19a84ab20f012f1e2414a18f65ffbChris Lattner visitSwitchCase(CB); 17131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 17141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 1715f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// visitSwitchCase - Emits the necessary code to represent a single node in 1716f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman/// the binary search tree resulting from lowering a switch instruction. 17177c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohmanvoid SelectionDAGLowering::visitSwitchCase(CaseBlock &CB) { 1718475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Cond; 1719475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CondLHS = getValue(CB.CmpLHS); 172057ab65972e09be54da6461e483664ebf34afa1eeChris Lattner 17215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Build the setcc now. 17225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpMHS == NULL) { 17235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Fold "(X == true)" to X and "(X == false)" to !X to 17245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // handle common cases produced by branch lowering. 17255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (CB.CmpRHS == ConstantInt::getTrue() && CB.CC == ISD::SETEQ) 17265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = CondLHS; 17275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov else if (CB.CmpRHS == ConstantInt::getFalse() && CB.CC == ISD::SETEQ) { 1728475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue True = DAG.getConstant(1, CondLHS.getValueType()); 17295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getNode(ISD::XOR, CondLHS.getValueType(), CondLHS, True); 17305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else 17315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CondLHS, getValue(CB.CmpRHS), CB.CC); 17325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 17335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov assert(CB.CC == ISD::SETLE && "Can handle only LE ranges now"); 17345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t Low = cast<ConstantInt>(CB.CmpLHS)->getSExtValue(); 17365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t High = cast<ConstantInt>(CB.CmpRHS)->getSExtValue(); 17375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1738475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CmpOp = getValue(CB.CmpMHS); 173983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = CmpOp.getValueType(); 17403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 17415502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (cast<ConstantInt>(CB.CmpLHS)->isMinValue(true)) { 17425502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, CmpOp, DAG.getConstant(High, VT), ISD::SETLE); 17435502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 1744475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, CmpOp, DAG.getConstant(Low, VT)); 17455502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cond = DAG.getSetCC(MVT::i1, SUB, 17465502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DAG.getConstant(High-Low, VT), ISD::SETULE); 17475502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 17485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 17495502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 17502d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Update successor info 17512d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.TrueBB); 17522d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(CB.FalseBB); 17532d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1754f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set NextBlock to be the MBB immediately after the current one, if any. 1755f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // This is used to avoid emitting unnecessary branches to the next block. 1756f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 1757f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 1758f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman if (++BBI != CurMBB->getParent()->end()) 1759f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman NextBlock = BBI; 1760f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 1761f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If the lhs block is the next block, invert the condition so that we can 1762f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // fall through to the lhs instead of the rhs block. 176357ab65972e09be54da6461e483664ebf34afa1eeChris Lattner if (CB.TrueBB == NextBlock) { 176457ab65972e09be54da6461e483664ebf34afa1eeChris Lattner std::swap(CB.TrueBB, CB.FalseBB); 1765475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue True = DAG.getConstant(1, Cond.getValueType()); 1766f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman Cond = DAG.getNode(ISD::XOR, Cond.getValueType(), Cond, True); 1767f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 1768475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), Cond, 176957ab65972e09be54da6461e483664ebf34afa1eeChris Lattner DAG.getBasicBlock(CB.TrueBB)); 1770bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson 1771bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson // If the branch was constant folded, fix up the CFG. 1772bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (BrCond.getOpcode() == ISD::BR) { 17733bc9c6f3e75dba02c1cc647b1f56ee1f39919046Owen Anderson CurMBB->removeSuccessor(CB.FalseBB); 1774f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman DAG.setRoot(BrCond); 1775bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson } else { 1776bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson // Otherwise, go ahead and insert the false branch. 1777bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (BrCond == getControlRoot()) 17783bc9c6f3e75dba02c1cc647b1f56ee1f39919046Owen Anderson CurMBB->removeSuccessor(CB.TrueBB); 1779bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson 1780bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson if (CB.FalseBB == NextBlock) 1781bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.setRoot(BrCond); 1782bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson else 1783bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 1784bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson DAG.getBasicBlock(CB.FalseBB))); 1785bd3ba461eb5578a81ba09ff7bd7eb271d1130196Owen Anderson } 1786f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 1787f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 17883a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTable - Emit JumpTable node in the current MBB 17897c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohmanvoid SelectionDAGLowering::visitJumpTable(JumpTable &JT) { 179037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code for the jump table 1791f147a8d56e0811525916f4d8cd5dd1777f834a85Scott Michel assert(JT.Reg != -1U && "Should lower JT Header first!"); 179283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT PTy = TLI.getPointerTy(); 1793475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Index = DAG.getCopyFromReg(getControlRoot(), JT.Reg, PTy); 1794475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Table = DAG.getJumpTable(JT.JTI, PTy); 17953d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng DAG.setRoot(DAG.getNode(ISD::BR_JT, MVT::Other, Index.getValue(1), 17963d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng Table, Index)); 17973d4ce1108520a4dcf31cb01523e145d286ee64c1Evan Cheng return; 179837efe6764568a3829fee26aba532283131d1a104Nate Begeman} 179937efe6764568a3829fee26aba532283131d1a104Nate Begeman 18003a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// visitJumpTableHeader - This function emits necessary code to produce index 18013a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov/// in the JumpTable from switch case. 18027c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohmanvoid SelectionDAGLowering::visitJumpTableHeader(JumpTable &JT, 18037c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman JumpTableHeader &JTH) { 18043a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Subtract the lowest switch case value from the value being switched on 18053a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // and conditional branch to default mbb if the result is greater than the 18063a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // difference between smallest and largest cases. 1807475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchOp = getValue(JTH.SValue); 180883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 1809475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 18103a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.First, VT)); 18113a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18123a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // The SDNode we just created, which holds the value being switched on 18133a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // minus the the smallest case value, needs to be copied to a virtual 18143a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // register so it can be used as an index into the jump table in a 18153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // subsequent basic block. This value may be smaller or larger than the 18163a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target's pointer type, and therefore require extension or truncating. 18178e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 18183a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), SUB); 18193a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 18203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov SwitchOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), SUB); 18213a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18223a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov unsigned JumpTableReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1823475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), JumpTableReg, SwitchOp); 18243a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov JT.Reg = JumpTableReg; 18253a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the range check for the jump table, and branch to the default 18273a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // block for the switch statement if the value being switched on exceeds 18283a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // the largest case in the switch. 1829475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CMP = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 18303a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getConstant(JTH.Last-JTH.First,VT), 18313a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov ISD::SETUGT); 18323a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18333a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 18343a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 18353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 18363a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 18373a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 18383a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov NextBlock = BBI; 18393a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1840475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrCond = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, CMP, 18413a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.getBasicBlock(JT.Default)); 18423a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18433a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov if (JT.MBB == NextBlock) 18443a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(BrCond); 18453a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov else 18463a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrCond, 18474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(JT.MBB))); 18484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 18503a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov} 18513a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 18524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestHeader - This function emits necessary code to produce value 18534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// suitable for "bit tests" 18547c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohmanvoid SelectionDAGLowering::visitBitTestHeader(BitTestBlock &B) { 18554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Subtract the minimum value 1856475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchOp = getValue(B.SValue); 185783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = SwitchOp.getValueType(); 1858475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SUB = DAG.getNode(ISD::SUB, VT, SwitchOp, 18594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.First, VT)); 18604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Check range 1862475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RangeCmp = DAG.getSetCC(TLI.getSetCCResultType(SUB), SUB, 18634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(B.Range, VT), 18644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETUGT); 18654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1866475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ShiftOp; 18678e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getShiftAmountTy())) 18684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), SUB); 18694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 18704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp = DAG.getNode(ISD::ZERO_EXTEND, TLI.getShiftAmountTy(), SUB); 18714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Make desired shift 1873475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchVal = DAG.getNode(ISD::SHL, TLI.getPointerTy(), 18744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(1, TLI.getPointerTy()), 18754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ShiftOp); 18764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned SwitchReg = FuncInfo.MakeReg(TLI.getPointerTy()); 1878475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CopyTo = DAG.getCopyToReg(getControlRoot(), SwitchReg, SwitchVal); 18794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov B.Reg = SwitchReg; 18804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 18824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 18834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 18844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 18854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 18864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 18874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 18884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* MBB = B.Cases[0].ThisBB; 18892d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 18902d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.Default); 18912d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(MBB); 18922d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1893475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrRange = DAG.getNode(ISD::BRCOND, MVT::Other, CopyTo, RangeCmp, 18942d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(B.Default)); 18952d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 18964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (MBB == NextBlock) 18974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrRange); 18984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 18994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, CopyTo, 19004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(MBB))); 19014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 19034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 19044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// visitBitTestCase - this function produces one "bit test" 19064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovvoid SelectionDAGLowering::visitBitTestCase(MachineBasicBlock* NextMBB, 19074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned Reg, 19087c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BitTestCase &B) { 19094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit bit tests and jumps 1910475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue SwitchVal = DAG.getCopyFromReg(getControlRoot(), Reg, 1911ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner TLI.getPointerTy()); 19124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 1913475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AndOp = DAG.getNode(ISD::AND, TLI.getPointerTy(), SwitchVal, 1914ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DAG.getConstant(B.Mask, TLI.getPointerTy())); 1915475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AndCmp = DAG.getSetCC(TLI.getSetCCResultType(AndOp), AndOp, 19164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getConstant(0, TLI.getPointerTy()), 19174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ISD::SETNE); 19182d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 19192d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(B.TargetBB); 19202d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(NextMBB); 19212d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 1922475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue BrAnd = DAG.getNode(ISD::BRCOND, MVT::Other, getControlRoot(), 19234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov AndCmp, DAG.getBasicBlock(B.TargetBB)); 19244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set NextBlock to be the MBB immediately after the current one, if any. 19264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is used to avoid emitting unnecessary branches to the next block. 19274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 19284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CurMBB; 19294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 19304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov NextBlock = BBI; 19314198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (NextMBB == NextBlock) 19334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(BrAnd); 19344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 19354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, BrAnd, 19364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DAG.getBasicBlock(NextMBB))); 19374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 19384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return; 19394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 19403a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 1941b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitInvoke(InvokeInst &I) { 1942b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey // Retrieve successors. 1943b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineBasicBlock *Return = FuncInfo.MBBMap[I.getSuccessor(0)]; 1944f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands MachineBasicBlock *LandingPad = FuncInfo.MBBMap[I.getSuccessor(1)]; 19459fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1946fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands if (isa<InlineAsm>(I.getCalledValue())) 1947fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 1948fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands else 19496f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, getValue(I.getOperand(0)), false, LandingPad); 1950f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands 1951f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // If the value of the invoke is used outside of its defining block, make it 1952f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // available as a virtual register. 1953f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (!I.use_empty()) { 1954f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands DenseMap<const Value*, unsigned>::iterator VMI = FuncInfo.ValueMap.find(&I); 1955f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands if (VMI != FuncInfo.ValueMap.end()) 195686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman CopyValueToVirtualRegister(&I, VMI->second); 1957f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands } 19589fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 1959f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands // Update successor info 1960f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(Return); 1961f19f6bb31e45c5fc34b17d89d80ed938f61ff047Duncan Sands CurMBB->addSuccessor(LandingPad); 19622d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 19632d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson // Drop into normal successor. 19642d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 19652d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson DAG.getBasicBlock(Return))); 1966b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1967b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 1968b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskeyvoid SelectionDAGLowering::visitUnwind(UnwindInst &I) { 1969b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey} 1970b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 19715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov/// handleSmallSwitchCaseRange - Emit a series of specific tests (suitable for 1972b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// small case ranges). 1973dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleSmallSwitchRange(CaseRec& CR, 1974b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 1975b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 1976b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 1977dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 1978dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 1979dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Size is the number of Cases represented by this range. 1980dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 19814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Size > 3) 1982dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 19835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 1984b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 1985b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 1986b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 1987b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1988b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 1989b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 1990b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 1991b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1992b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 1993b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 1994b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 1995b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // TODO: If any two of the cases has the same destination, and if one value 1996b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is the same as the other, but has one bit unset that the other has set, 1997b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // use bit manipulation to do two compares at once. For example: 1998b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // "if (X == 6 || X == 4)" -> "if ((X|2) == 6)" 1999b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2000b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Rearrange the case blocks so that the last one falls through if possible. 20015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (NextBlock && Default != NextBlock && BackCase.BB != NextBlock) { 2002b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // The last case block won't fall through into 'NextBlock' if we emit the 2003b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // branches in this order. See if rearranging a case value would help. 2004b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second-1; I != E; ++I) { 20055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->BB == NextBlock) { 2006b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::swap(*I, BackCase); 2007b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov break; 2008b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2009b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2010b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2011b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2012b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 2013b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the Case's target mbb if the value being switched on SV is equal 2014b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // to C. 2015b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *CurBlock = CR.CaseBB; 2016b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++I) { 2017b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FallThrough; 2018b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (I != E-1) { 20190e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FallThrough = CurMF->CreateMachineBasicBlock(CurBlock->getBasicBlock()); 20200e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FallThrough); 2021b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 2022b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If the last case doesn't match, go to the default block. 2023b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov FallThrough = Default; 2024b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 20255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *RHS, *LHS, *MHS; 20275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ISD::CondCode CC; 20285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->High == I->Low) { 20295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // This is just small small case range :) containing exactly 1 case 20305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETEQ; 20315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = SV; RHS = I->High; MHS = NULL; 20325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 20335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CC = ISD::SETLE; 20345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHS = I->Low; MHS = SV; RHS = I->High; 20355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 20367c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CaseBlock CB(CC, LHS, RHS, MHS, I->BB, FallThrough, CurBlock); 2037b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2038b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // If emitting the first comparison, just call visitSwitchCase to emit the 2039b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // code into the current block. Otherwise, push the CaseBlock onto the 2040b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // vector to be later processed by SDISel, and insert the node's MBB 2041b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // before the next MBB. 2042b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CurBlock == CurMBB) 2043b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 2044b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 2045b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 2046b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2047b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CurBlock = FallThrough; 2048b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2049dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2050dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2051b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2052b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 20537294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikovstatic inline bool areJTsAllowed(const TargetLowering &TLI) { 20547232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen return !DisableJumpTables && 20557232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen (TLI.isOperationLegal(ISD::BR_JT, MVT::Other) || 20567232464bdaae5e6e48986a1e3b9a95fac7aa7bdfDale Johannesen TLI.isOperationLegal(ISD::BRIND, MVT::Other)); 20577294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov} 20587294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov 2059b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleJTSwitchCase - Emit jumptable for current switch case range 2060dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleJTSwitchCase(CaseRec& CR, 2061b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 2062b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 2063b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 2064dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& FrontCase = *CR.Range.first; 2065dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov Case& BackCase = *(CR.Range.second-1); 2066dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 20675502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 20685502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 20695502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 20705502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 20715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 20725502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 20735502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 2074dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 20757294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (!areJTsAllowed(TLI) || TSize <= 3) 2076dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 2077dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 20785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov double Density = (double)TSize / (double)((Last - First) + 1ULL); 20795502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Density < 0.4) 2080dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return false; 2081dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 20825502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Lowering jump table\n" 20835502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << "First entry: " << First << ". Last entry: " << Last << "\n" 20844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Size: " << TSize << ". Density: " << Density << "\n\n"; 20855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 2086b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 2087b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 2088dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 2089b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2090b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 2091b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 2092b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 2093b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2094b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 2095b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 2096b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2097b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 2098b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2099b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a new basic block to hold the code for loading the address 2100b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // of the jump table, and jumping to it. Update successor information; 2101b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // we will either branch to the default case for the switch, or the jump 2102b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // table. 21030e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *JumpTableBB = CurMF->CreateMachineBasicBlock(LLVMBB); 21040e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, JumpTableBB); 2105b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(Default); 2106b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CR.CaseBB->addSuccessor(JumpTableBB); 2107b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2108b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Build a vector of destination BBs, corresponding to each target 21094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // of the jump table. If the value of the jump table slot corresponds to 2110b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // a case statement, push the case's BB onto the vector, otherwise, push 2111b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the default BB. 2112b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov std::vector<MachineBasicBlock*> DestBBs; 2113b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov int64_t TEI = First; 21145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I != E; ++TEI) { 21155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Low = cast<ConstantInt>(I->Low)->getSExtValue(); 21165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t High = cast<ConstantInt>(I->High)->getSExtValue(); 21175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((Low <= TEI) && (TEI <= High)) { 21195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DestBBs.push_back(I->BB); 21205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (TEI==High) 21215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++I; 2122b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 2123b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov DestBBs.push_back(Default); 2124b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 21255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2126b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2127b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Update successor info. Add one edge to each unique successor. 21285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov BitVector SuccsHandled(CR.CaseBB->getParent()->getNumBlockIDs()); 2129b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (std::vector<MachineBasicBlock*>::iterator I = DestBBs.begin(), 2130b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov E = DestBBs.end(); I != E; ++I) { 2131b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (!SuccsHandled[(*I)->getNumber()]) { 2132b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SuccsHandled[(*I)->getNumber()] = true; 2133b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov JumpTableBB->addSuccessor(*I); 2134b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2135b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2136b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2137b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a jump table index for this jump table, or return an existing 2138b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // one. 2139b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned JTI = CurMF->getJumpTableInfo()->getJumpTableIndex(DestBBs); 2140b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2141b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Set the jump table information so that we can codegen it as a second 2142b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // MachineBasicBlock 21437c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman JumpTable JT(-1U, JTI, JumpTableBB, Default); 21447c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman JumpTableHeader JTH(First, Last, SV, CR.CaseBB, (CR.CaseBB == CurMBB)); 2145b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2146b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitJumpTableHeader(JT, JTH); 2147b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 21487c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman JTCases.push_back(JumpTableBlock(JTH, JT)); 2149b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2150dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2151b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2152b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2153b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// handleBTSplitSwitchCase - emit comparison and split binary search tree into 2154b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov/// 2 subtrees. 2155dd433210797bc13513989a033e488d4e19442723Anton Korobeynikovbool SelectionDAGLowering::handleBTSplitSwitchCase(CaseRec& CR, 2156b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector& WorkList, 2157b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Value* SV, 2158b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock* Default) { 2159b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 2160b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 2161b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 2162b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2163b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Figure out which block is immediately after the current one. 2164b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *NextBlock = 0; 2165b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 2166b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2167b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (++BBI != CurMBB->getParent()->end()) 2168b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov NextBlock = BBI; 2169b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2170b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& FrontCase = *CR.Range.first; 2171b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 2172b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 2173b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2174b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Size is the number of Cases represented by this range. 2175b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov unsigned Size = CR.Range.second - CR.Range.first; 2176b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 21775502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t First = cast<ConstantInt>(FrontCase.Low)->getSExtValue(); 21785502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t Last = cast<ConstantInt>(BackCase.High)->getSExtValue(); 21794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov double FMetric = 0; 21805502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseItr Pivot = CR.Range.first + Size/2; 2181b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2182b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Select optimal pivot, maximizing sum density of LHS and RHS. This will 2183b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // (heuristically) allow us to emit JumpTable's later. 21845502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t TSize = 0; 21855502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 21865502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I!=E; ++I) 21875502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TSize += I->size(); 21885502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 21895502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t LSize = FrontCase.size(); 21905502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov uint64_t RSize = TSize-LSize; 21914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Selecting best pivot: \n" 21924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "First: " << First << ", Last: " << Last <<"\n" 21934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LSize: " << LSize << ", RSize: " << RSize << "\n"; 2194b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov for (CaseItr I = CR.Range.first, J=I+1, E = CR.Range.second; 21955502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J!=E; ++I, ++J) { 21965502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t LEnd = cast<ConstantInt>(I->High)->getSExtValue(); 21975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t RBegin = cast<ConstantInt>(J->Low)->getSExtValue(); 21984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((RBegin-LEnd>=1) && "Invalid case distance"); 2199b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double LDensity = (double)LSize / (double)((LEnd - First) + 1ULL); 2200b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov double RDensity = (double)RSize / (double)((Last - RBegin) + 1ULL); 220154e2b142be6ac759e87dde8a643a7beaff0365dfAnton Korobeynikov double Metric = Log2_64(RBegin-LEnd)*(LDensity+RDensity); 22024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Should always split in some non-trivial place 22034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT <<"=>Step\n" 22044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LEnd: " << LEnd << ", RBegin: " << RBegin << "\n" 22054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "LDensity: " << LDensity << ", RDensity: " << RDensity << "\n" 22064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Metric: " << Metric << "\n"; 22074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (FMetric < Metric) { 2208b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov Pivot = J; 22094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov FMetric = Metric; 22104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Current metric set to: " << FMetric << "\n"; 2211b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 22125502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 22135502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LSize += J->size(); 22145502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov RSize -= J->size(); 2215b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 22167294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov if (areJTsAllowed(TLI)) { 22177294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov // If our case is dense we *really* should handle it earlier! 22187294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov assert((FMetric > 0) && "Should handle dense range earlier!"); 22197294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } else { 22207294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov Pivot = CR.Range.first + Size/2; 22217294b58ecdb430d1473d0a9220a234e62a710d54Anton Korobeynikov } 2222b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2223b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange LHSR(CR.Range.first, Pivot); 2224b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRange RHSR(Pivot, CR.Range.second); 22255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Constant *C = Pivot->Low; 2226b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov MachineBasicBlock *FalseBB = 0, *TrueBB = 0; 2227b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2228b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // We know that we branch to the LHS if the Value being switched on is 2229b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // less than the Pivot value, C. We use this to optimize our binary 2230b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // tree a bit, by recognizing that if SV is greater than or equal to the 2231b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // LHS's Case Value, and that Case Value is exactly one less than the 2232b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Pivot's Value, then we can branch directly to the LHS's Target, 2233b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // rather than creating a leaf node for it. 2234b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((LHSR.second - LHSR.first) == 1 && 22355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov LHSR.first->High == CR.GE && 22365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(C)->getSExtValue() == 22375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.GE)->getSExtValue() + 1LL)) { 22385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov TrueBB = LHSR.first->BB; 2239b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 22400e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman TrueBB = CurMF->CreateMachineBasicBlock(LLVMBB); 22410e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, TrueBB); 2242b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(TrueBB, C, CR.GE, LHSR)); 2243b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2244b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2245b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Similar to the optimization above, if the Value being switched on is 2246b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // known to be less than the Constant CR.LT, and the current Case Value 2247b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // is CR.LT - 1, then we can branch directly to the target block for 2248b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the current Case Value, rather than emitting a RHS leaf node for it. 2249b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if ((RHSR.second - RHSR.first) == 1 && CR.LT && 22505502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov cast<ConstantInt>(RHSR.first->Low)->getSExtValue() == 22515502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov (cast<ConstantInt>(CR.LT)->getSExtValue() - 1LL)) { 22525502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov FalseBB = RHSR.first->BB; 2253b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } else { 22540e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman FalseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 22550e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, FalseBB); 2256b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov WorkList.push_back(CaseRec(FalseBB,CR.LT,C,RHSR)); 2257b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov } 2258b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2259b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Create a CaseBlock record representing a conditional branch to 2260b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // the LHS node if the value being switched on SV is less than C. 2261b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov // Otherwise, branch to LHS. 22627c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CaseBlock CB(ISD::SETLT, SV, C, NULL, TrueBB, FalseBB, CR.CaseBB); 2263b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 2264b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov if (CR.CaseBB == CurMBB) 2265b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov visitSwitchCase(CB); 2266b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov else 2267b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov SwitchCases.push_back(CB); 2268dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2269dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov return true; 2270b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov} 2271b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov 22724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// handleBitTestsSwitchCase - if current case range has few destination and 22734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// range span less, than machine word bitwidth, encode case range into series 22744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov/// of masks and emit bit tests with these masks. 22754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikovbool SelectionDAGLowering::handleBitTestsSwitchCase(CaseRec& CR, 22764198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseRecVector& WorkList, 22774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Value* SV, 22783ff981749bed4347dfe7196ac066be1d4f51ea1fChris Lattner MachineBasicBlock* Default){ 227983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands unsigned IntPtrBits = TLI.getPointerTy().getSizeInBits(); 22804198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& FrontCase = *CR.Range.first; 22824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Case& BackCase = *(CR.Range.second-1); 22834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Get the MachineFunction which holds the current MBB. This is used when 22854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // inserting any additional MBBs necessary to represent the switch. 22864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction *CurMF = CurMBB->getParent(); 22874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned numCmps = 0; 22894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; 22904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov I!=E; ++I) { 22914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Single case counts one, case range - two. 22924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (I->Low == I->High) 22934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=1; 22944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 22954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov numCmps +=2; 22964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 22974198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 22984198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Count unique destinations 22994198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov SmallSet<MachineBasicBlock*, 4> Dests; 23004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 23014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Dests.insert(I->BB); 23024198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dests.size() > 3) 23034198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Don't bother the code below, if there are too much unique destinations 23044198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 23054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 23064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total number of unique destinations: " << Dests.size() << "\n" 23074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Total number of comparisons: " << numCmps << "\n"; 23084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23094198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Compute span of values. 23104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* minValue = FrontCase.Low; 23114198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov Constant* maxValue = BackCase.High; 23124198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t range = cast<ConstantInt>(maxValue)->getSExtValue() - 23134198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov cast<ConstantInt>(minValue)->getSExtValue(); 23144198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Compare range: " << range << "\n" 23154198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "Low bound: " << cast<ConstantInt>(minValue)->getSExtValue() << "\n" 23164198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << "High bound: " << cast<ConstantInt>(maxValue)->getSExtValue() << "\n"; 23174198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 2318ab8fd404034439ba23230df512a8a2779e5d48a3Anton Korobeynikov if (range>=IntPtrBits || 23194198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov (!(Dests.size() == 1 && numCmps >= 3) && 23204198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() == 2 && numCmps >= 5) && 23214198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov !(Dests.size() >= 3 && numCmps >= 6))) 23224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return false; 23234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23244198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Emitting bit tests\n"; 23254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov int64_t lowBound = 0; 23264198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23274198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Optimize the case where all the case values fit in a 23284198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // word without having to subtract minValue. In this case, 23294198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // we can optimize away the subtraction. 23304198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cast<ConstantInt>(minValue)->getSExtValue() >= 0 && 2331e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov cast<ConstantInt>(maxValue)->getSExtValue() < IntPtrBits) { 23324198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov range = cast<ConstantInt>(maxValue)->getSExtValue(); 23334198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } else { 23344198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov lowBound = cast<ConstantInt>(minValue)->getSExtValue(); 23354198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 23364198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23374198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CaseBitsVector CasesBits; 23384198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov unsigned i, count = 0; 23394198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23404198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (CaseItr I = CR.Range.first, E = CR.Range.second; I!=E; ++I) { 23414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock* Dest = I->BB; 23424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (i = 0; i < count; ++i) 23434198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (Dest == CasesBits[i].BB) 23444198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov break; 23454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23464198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (i == count) { 23474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert((count < 3) && "Too much destinations to test!"); 23484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits.push_back(CaseBits(0, Dest, 0)); 23494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov count++; 23504198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 23514198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t lo = cast<ConstantInt>(I->Low)->getSExtValue() - lowBound; 23534198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov uint64_t hi = cast<ConstantInt>(I->High)->getSExtValue() - lowBound; 23544198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23554198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (uint64_t j = lo; j <= hi; j++) { 2356e01017bba4f44ab65eba11fd065c9cd16b5edb33Anton Korobeynikov CasesBits[i].Mask |= 1ULL << j; 23574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov CasesBits[i].Bits++; 23584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 23594198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 23614198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::sort(CasesBits.begin(), CasesBits.end(), CaseBitsCmp()); 23624198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23637c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BitTestInfo BTC; 23644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23654198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Figure out which block is immediately after the current one. 23664198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineFunction::iterator BBI = CR.CaseBB; 23674198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov ++BBI; 23684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23694198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov const BasicBlock *LLVMBB = CR.CaseBB->getBasicBlock(); 23704198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23714198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Cases:\n"; 23724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov for (unsigned i = 0, e = CasesBits.size(); i!=e; ++i) { 23734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Mask: " << CasesBits[i].Mask << ", Bits: " << CasesBits[i].Bits 23744198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov << ", BB: " << CasesBits[i].BB << "\n"; 23754198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23760e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman MachineBasicBlock *CaseBB = CurMF->CreateMachineBasicBlock(LLVMBB); 23770e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman CurMF->insert(BBI, CaseBB); 23787c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BTC.push_back(BitTestCase(CasesBits[i].Mask, 23797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CaseBB, 23807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CasesBits[i].BB)); 23814198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 23824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BitTestBlock BTB(lowBound, range, SV, 23847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman -1U, (CR.CaseBB == CurMBB), 23857c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CR.CaseBB, Default, BTC); 23864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23874198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (CR.CaseBB == CurMBB) 23884198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov visitBitTestHeader(BTB); 23894198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov BitTestCases.push_back(BTB); 23914198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23924198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov return true; 23934198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov} 23944198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 23954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 239686e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman/// Clusterify - Transform simple list of Cases into list of CaseRange's 23975502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovunsigned SelectionDAGLowering::Clusterify(CaseVector& Cases, 23985502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov const SwitchInst& SI) { 23995502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = 0; 24005502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 24015502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Start with "simple" cases 24025502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (unsigned i = 1; i < SI.getNumSuccessors(); ++i) { 24035502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *SMBB = FuncInfo.MBBMap[SI.getSuccessor(i)]; 24045502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Cases.push_back(Case(SI.getSuccessorValue(i), 24055502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SI.getSuccessorValue(i), 24065502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov SMBB)); 24075502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 2408b3d9cdb6776355ffba1c43809094f29e4d57a45fChris Lattner std::sort(Cases.begin(), Cases.end(), CaseCmp()); 24095502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 24105502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // Merge case into clusters 24115502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (Cases.size()>=2) 2412a2a488594df335efa17bc253436465c2ae984f91David Greene // Must recompute end() each iteration because it may be 2413a2a488594df335efa17bc253436465c2ae984f91David Greene // invalidated by erase if we hold on to it 241427a6c7380fa4dfc8e1837a8dd67967d063b26544Chris Lattner for (CaseItr I=Cases.begin(), J=++(Cases.begin()); J!=Cases.end(); ) { 24155502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t nextValue = cast<ConstantInt>(J->Low)->getSExtValue(); 24165502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov int64_t currentValue = cast<ConstantInt>(I->High)->getSExtValue(); 24175502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* nextBB = J->BB; 24185502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock* currentBB = I->BB; 24195502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 24205502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // If the two neighboring cases go to the same destination, merge them 24215502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // into a single case. 24225502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if ((nextValue-currentValue==1) && (currentBB == nextBB)) { 24235502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I->High = J->High; 24245502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov J = Cases.erase(J); 24255502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } else { 24265502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov I = J++; 24275502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 24285502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 24295502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 24305502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov for (CaseItr I=Cases.begin(), E=Cases.end(); I!=E; ++I, ++numCmps) { 24315502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (I->Low != I->High) 24325502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov // A range counts double, since it requires two compares. 24335502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov ++numCmps; 24345502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov } 24355502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 24365502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov return numCmps; 24375502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov} 24385502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov 24395502bf67cd49221583c15472150905ce13184d36Anton Korobeynikovvoid SelectionDAGLowering::visitSwitch(SwitchInst &SI) { 2440f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Figure out which block is immediately after the current one. 2441f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineBasicBlock *NextBlock = 0; 2442f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman MachineFunction::iterator BBI = CurMBB; 2443c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 24445502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov MachineBasicBlock *Default = FuncInfo.MBBMap[SI.getDefaultDest()]; 2445d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner 2446f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there is only the default destination, branch to it if it is not the 2447f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // next basic block. Otherwise, just fall through. 24485502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov if (SI.getNumOperands() == 2) { 2449f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Update machine-CFG edges. 2450c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2451f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If this is not a fall-through branch, emit the branch. 24522d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson CurMBB->addSuccessor(Default); 2453d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner if (Default != NextBlock) 245486e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman DAG.setRoot(DAG.getNode(ISD::BR, MVT::Other, getControlRoot(), 2455d2c1d2200b4d1012c61c4bcddfbc6fefcf3a05e1Chris Lattner DAG.getBasicBlock(Default))); 24562d389e8ad7e98fa50f8d021a7669ba0aab07a571Owen Anderson 2457f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 2458f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2459f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 2460f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If there are any non-default case statements, create a vector of Cases 2461f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // representing each one, and sort the vector so that we can efficiently 2462f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // create a binary search tree from them. 24635502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov CaseVector Cases; 24645502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov unsigned numCmps = Clusterify(Cases, SI); 24655502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov DOUT << "Clusterify finished. Total clusters: " << Cases.size() 24665502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov << ". Total compares: " << numCmps << "\n"; 2467c70ddad2b7d7abffeaaace913939fb3c5c55a38bBill Wendling 2468f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Get the Value to be switched on and default basic blocks, which will be 2469f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // inserted into CaseBlock records, representing basic blocks in the binary 2470f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // search tree. 24715502bf67cd49221583c15472150905ce13184d36Anton Korobeynikov Value *SV = SI.getOperand(0); 247237efe6764568a3829fee26aba532283131d1a104Nate Begeman 24733a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Push the initial CaseRec onto the worklist 2474b17b08d1f2cdbc3aba28e31755d7a5c3c55e4c3aAnton Korobeynikov CaseRecVector WorkList; 24753a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.push_back(CaseRec(CurMBB,0,0,CaseRange(Cases.begin(),Cases.end()))); 24763a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 24773a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov while (!WorkList.empty()) { 24783a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Grab a record representing a case range to process off the worklist 24793a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov CaseRec CR = WorkList.back(); 24803a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov WorkList.pop_back(); 24813a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 24824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (handleBitTestsSwitchCase(CR, WorkList, SV, Default)) 24834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov continue; 24844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 24853a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // If the range has few cases (two or less) emit a series of specific 24863a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // tests. 2487dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleSmallSwitchRange(CR, WorkList, SV, Default)) 2488dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2489dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 24904198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // If the switch has more than 5 blocks, and at least 40% dense, and the 24913a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // target supports indirect branches, then emit a jump table rather than 24923a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // lowering the switch to a binary tree of conditional branches. 2493dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov if (handleJTSwitchCase(CR, WorkList, SV, Default)) 2494dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov continue; 2495dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov 2496dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // Emit binary tree. We need to pick a pivot, and push left and right ranges 2497dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov // onto the worklist. Leafs are handled via handleSmallSwitchRange() call. 2498dd433210797bc13513989a033e488d4e19442723Anton Korobeynikov handleBTSplitSwitchCase(CR, WorkList, SV, Default); 2499f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 2500f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 2501f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 25023a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 2503b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattnervoid SelectionDAGLowering::visitSub(User &I) { 2504b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner // -0.0 - X --> fneg 250524d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer const Type *Ty = I.getType(); 25069d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (isa<VectorType>(Ty)) { 25077f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (ConstantVector *CV = dyn_cast<ConstantVector>(I.getOperand(0))) { 25087f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const VectorType *DestTy = cast<VectorType>(I.getType()); 25097f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman const Type *ElTy = DestTy->getElementType(); 2510c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (ElTy->isFloatingPoint()) { 2511c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng unsigned VL = DestTy->getNumElements(); 25129e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen std::vector<Constant*> NZ(VL, ConstantFP::getNegativeZero(ElTy)); 2513c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng Constant *CNZ = ConstantVector::get(&NZ[0], NZ.size()); 2514c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng if (CV == CNZ) { 2515475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2516c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 2517c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng return; 2518c45453fa1db7a5c520208fb6ffbc9fdb823b0526Evan Cheng } 25197f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 25207f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 25217f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 25227f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman if (Ty->isFloatingPoint()) { 252301b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner if (ConstantFP *CFP = dyn_cast<ConstantFP>(I.getOperand(0))) 25249e3d3abd937c9bb79d56d25ec0e0724c7cbba67cDale Johannesen if (CFP->isExactlyValue(ConstantFP::getNegativeZero(Ty)->getValueAPF())) { 2525475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 252601b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner setValue(&I, DAG.getNode(ISD::FNEG, Op2.getValueType(), Op2)); 252701b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner return; 252801b3d73c20f5afb8265ae943a8ba23c2238c5eeaChris Lattner } 25297f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman } 25307f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman 25317f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman visitBinary(I, Ty->isFPOrFPVector() ? ISD::FSUB : ISD::SUB); 2532b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner} 2533b9fccc41933648647e3f7669612c683eb5de0d58Chris Lattner 25347f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohmanvoid SelectionDAGLowering::visitBinary(User &I, unsigned OpCode) { 2535475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2536475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 253724d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer 253824d6da5fedcf39891f7d8c5b031c01324b3db545Reid Spencer setValue(&I, DAG.getNode(OpCode, Op1.getValueType(), Op1, Op2)); 25391628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer} 25401628cec4d7fce310d9cde0bcc73997e5a71692c4Reid Spencer 2541e21ea61588996609f827213a2701a204f2f13fb3Nate Begemanvoid SelectionDAGLowering::visitShift(User &I, unsigned Opcode) { 2542475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2543475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 25445bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman if (!isa<VectorType>(I.getType())) { 25455bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman if (TLI.getShiftAmountTy().bitsLT(Op2.getValueType())) 25465bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman Op2 = DAG.getNode(ISD::TRUNCATE, TLI.getShiftAmountTy(), Op2); 25475bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman else if (TLI.getShiftAmountTy().bitsGT(Op2.getValueType())) 25485bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman Op2 = DAG.getNode(ISD::ANY_EXTEND, TLI.getShiftAmountTy(), Op2); 25495bc1ea0736a5785ed596d58beeff2ab23909e33dNate Begeman } 2550e21ea61588996609f827213a2701a204f2f13fb3Nate Begeman 25511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, DAG.getNode(Opcode, Op1.getValueType(), Op1, Op2)); 25521c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 25531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 255445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitICmp(User &I) { 2555e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2556e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (ICmpInst *IC = dyn_cast<ICmpInst>(&I)) 2557e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = IC->getPredicate(); 2558e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2559e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = ICmpInst::Predicate(IC->getPredicate()); 2560475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2561475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 256245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer ISD::CondCode Opcode; 2563e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 256445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 256545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 256645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 256745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 256845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 256945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 257045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 257145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 257245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 257345fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 257445fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 257545fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid ICmp predicate value"); 257645fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer Opcode = ISD::SETEQ; 257745fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 257845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 257945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Opcode)); 258045fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer} 258145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer 258245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencervoid SelectionDAGLowering::visitFCmp(User &I) { 2583e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2584e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FCmpInst *FC = dyn_cast<FCmpInst>(&I)) 2585e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FC->getPredicate(); 2586e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2587e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer predicate = FCmpInst::Predicate(FC->getPredicate()); 2588475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2589475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2590e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer ISD::CondCode Condition, FOC, FPC; 2591e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer switch (predicate) { 2592e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2593e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2594e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2595e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2596e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2597e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2598e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2599cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2600cba3b44d258ee89f7dae1ea6e67d97258211ff8bDan Gohman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2601e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2602e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2603e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2604e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2605e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2606e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2607e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 260845fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer default: 260945fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer assert(!"Invalid FCmp predicate value"); 2610e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer FOC = FPC = ISD::SETFALSE; 261145fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer break; 261245fb3f3cb2b8efc01d9bbe42a64194f35b92c759Reid Spencer } 2613e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer if (FiniteOnlyFPMath()) 2614e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FOC; 2615e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer else 2616e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer Condition = FPC; 2617e4d87aa2de6e52952dca73716386db09aad5a8fdReid Spencer setValue(&I, DAG.getSetCC(MVT::i1, Op1, Op2, Condition)); 26181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2620b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVICmp(User &I) { 2621b43e9c196542acc80c9e4643809661065710848fNate Begeman ICmpInst::Predicate predicate = ICmpInst::BAD_ICMP_PREDICATE; 2622b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VICmpInst *IC = dyn_cast<VICmpInst>(&I)) 2623b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = IC->getPredicate(); 2624b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *IC = dyn_cast<ConstantExpr>(&I)) 2625b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = ICmpInst::Predicate(IC->getPredicate()); 2626475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2627475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2628b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Opcode; 2629b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2630b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_EQ : Opcode = ISD::SETEQ; break; 2631b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_NE : Opcode = ISD::SETNE; break; 2632b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGT : Opcode = ISD::SETUGT; break; 2633b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_UGE : Opcode = ISD::SETUGE; break; 2634b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULT : Opcode = ISD::SETULT; break; 2635b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_ULE : Opcode = ISD::SETULE; break; 2636b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGT : Opcode = ISD::SETGT; break; 2637b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SGE : Opcode = ISD::SETGE; break; 2638b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLT : Opcode = ISD::SETLT; break; 2639b43e9c196542acc80c9e4643809661065710848fNate Begeman case ICmpInst::ICMP_SLE : Opcode = ISD::SETLE; break; 2640b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2641b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid ICmp predicate value"); 2642b43e9c196542acc80c9e4643809661065710848fNate Begeman Opcode = ISD::SETEQ; 2643b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2644b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2645b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(Op1.getValueType(), Op1, Op2, Opcode)); 2646b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2647b43e9c196542acc80c9e4643809661065710848fNate Begeman 2648b43e9c196542acc80c9e4643809661065710848fNate Begemanvoid SelectionDAGLowering::visitVFCmp(User &I) { 2649b43e9c196542acc80c9e4643809661065710848fNate Begeman FCmpInst::Predicate predicate = FCmpInst::BAD_FCMP_PREDICATE; 2650b43e9c196542acc80c9e4643809661065710848fNate Begeman if (VFCmpInst *FC = dyn_cast<VFCmpInst>(&I)) 2651b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FC->getPredicate(); 2652b43e9c196542acc80c9e4643809661065710848fNate Begeman else if (ConstantExpr *FC = dyn_cast<ConstantExpr>(&I)) 2653b43e9c196542acc80c9e4643809661065710848fNate Begeman predicate = FCmpInst::Predicate(FC->getPredicate()); 2654475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(0)); 2655475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(1)); 2656b43e9c196542acc80c9e4643809661065710848fNate Begeman ISD::CondCode Condition, FOC, FPC; 2657b43e9c196542acc80c9e4643809661065710848fNate Begeman switch (predicate) { 2658b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_FALSE: FOC = FPC = ISD::SETFALSE; break; 2659b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OEQ: FOC = ISD::SETEQ; FPC = ISD::SETOEQ; break; 2660b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGT: FOC = ISD::SETGT; FPC = ISD::SETOGT; break; 2661b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OGE: FOC = ISD::SETGE; FPC = ISD::SETOGE; break; 2662b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLT: FOC = ISD::SETLT; FPC = ISD::SETOLT; break; 2663b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_OLE: FOC = ISD::SETLE; FPC = ISD::SETOLE; break; 2664b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ONE: FOC = ISD::SETNE; FPC = ISD::SETONE; break; 2665b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ORD: FOC = FPC = ISD::SETO; break; 2666b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNO: FOC = FPC = ISD::SETUO; break; 2667b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UEQ: FOC = ISD::SETEQ; FPC = ISD::SETUEQ; break; 2668b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGT: FOC = ISD::SETGT; FPC = ISD::SETUGT; break; 2669b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UGE: FOC = ISD::SETGE; FPC = ISD::SETUGE; break; 2670b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULT: FOC = ISD::SETLT; FPC = ISD::SETULT; break; 2671b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_ULE: FOC = ISD::SETLE; FPC = ISD::SETULE; break; 2672b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_UNE: FOC = ISD::SETNE; FPC = ISD::SETUNE; break; 2673b43e9c196542acc80c9e4643809661065710848fNate Begeman case FCmpInst::FCMP_TRUE: FOC = FPC = ISD::SETTRUE; break; 2674b43e9c196542acc80c9e4643809661065710848fNate Begeman default: 2675b43e9c196542acc80c9e4643809661065710848fNate Begeman assert(!"Invalid VFCmp predicate value"); 2676b43e9c196542acc80c9e4643809661065710848fNate Begeman FOC = FPC = ISD::SETFALSE; 2677b43e9c196542acc80c9e4643809661065710848fNate Begeman break; 2678b43e9c196542acc80c9e4643809661065710848fNate Begeman } 2679b43e9c196542acc80c9e4643809661065710848fNate Begeman if (FiniteOnlyFPMath()) 2680b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FOC; 2681b43e9c196542acc80c9e4643809661065710848fNate Begeman else 2682b43e9c196542acc80c9e4643809661065710848fNate Begeman Condition = FPC; 2683b43e9c196542acc80c9e4643809661065710848fNate Begeman 268483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2685b43e9c196542acc80c9e4643809661065710848fNate Begeman 2686b43e9c196542acc80c9e4643809661065710848fNate Begeman setValue(&I, DAG.getVSetCC(DestVT, Op1, Op2, Condition)); 2687b43e9c196542acc80c9e4643809661065710848fNate Begeman} 2688b43e9c196542acc80c9e4643809661065710848fNate Begeman 26891c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitSelect(User &I) { 2690475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Cond = getValue(I.getOperand(0)); 2691475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue TrueVal = getValue(I.getOperand(1)); 2692475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue FalseVal = getValue(I.getOperand(2)); 26937f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::SELECT, TrueVal.getValueType(), Cond, 26947f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TrueVal, FalseVal)); 26951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 26961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 26973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 26983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitTrunc(User &I) { 26993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // TruncInst cannot be a no-op cast because sizeof(src) > sizeof(dest). 2700475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 270183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27023da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 27033da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27043da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27053da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitZExt(User &I) { 27063da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 27073da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // ZExt also can't be a cast to bool for same reason. So, nothing much to do 2708475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 270983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27103da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 27113da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27123da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27133da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSExt(User &I) { 27143da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt cannot be a no-op cast because sizeof(src) < sizeof(dest). 27153da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // SExt also can't be a cast to bool for same reason. So, nothing much to do 2716475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 271783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27183da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SIGN_EXTEND, DestVT, N)); 27193da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27203da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27213da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPTrunc(User &I) { 27223da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 2723475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 272483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27250bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner setValue(&I, DAG.getNode(ISD::FP_ROUND, DestVT, N, DAG.getIntPtrConstant(0))); 27263da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27273da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27283da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPExt(User &I){ 27293da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPTrunc is never a no-op cast, no need to check 2730475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 273183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27323da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_EXTEND, DestVT, N)); 27333da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27343da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27353da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToUI(User &I) { 27363da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToUI is never a no-op cast, no need to check 2737475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 273883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27393da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_UINT, DestVT, N)); 27403da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27413da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27423da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitFPToSI(User &I) { 27433da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // FPToSI is never a no-op cast, no need to check 2744475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 274583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27463da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::FP_TO_SINT, DestVT, N)); 27473da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27483da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27493da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitUIToFP(User &I) { 27503da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 2751475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 275283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27533da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::UINT_TO_FP, DestVT, N)); 27543da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27553da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27563da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitSIToFP(User &I){ 27573da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // UIToFP is never a no-op cast, no need to check 2758475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 275983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27603da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::SINT_TO_FP, DestVT, N)); 27613da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27623da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27633da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitPtrToInt(User &I) { 27643da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 27653da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 2766475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 276783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 276883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 2769475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Result; 27708e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 27713da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::TRUNCATE, DestVT, N); 27723da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 27733da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 27743da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer Result = DAG.getNode(ISD::ZERO_EXTEND, DestVT, N); 27753da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, Result); 27763da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27771c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 27783da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitIntToPtr(User &I) { 27793da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // What to do depends on the size of the integer and the size of the pointer. 27803da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // We can either truncate, zero extend, or no-op, accordingly. 2781475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 278283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT SrcVT = N.getValueType(); 278383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27848e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (DestVT.bitsLT(SrcVT)) 27853da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::TRUNCATE, DestVT, N)); 27863da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 27873da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // Note: ZERO_EXTEND can handle cases where the sizes are equal too 27883da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::ZERO_EXTEND, DestVT, N)); 27893da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer} 27903da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27913da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencervoid SelectionDAGLowering::visitBitCast(User &I) { 2792475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 279383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT DestVT = TLI.getValueType(I.getType()); 27943da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer 27953da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // BitCast assures us that source and destination are the same size so this 27963da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer // is either a BIT_CONVERT or a no-op. 27973da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer if (DestVT != N.getValueType()) 27983da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, DAG.getNode(ISD::BIT_CONVERT, DestVT, N)); // convert types 27993da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer else 28003da59db637a887474c1b1346c1f3ccf53b6c4663Reid Spencer setValue(&I, N); // noop cast. 28011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 28021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 28032bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitInsertElement(User &I) { 2804475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVec = getValue(I.getOperand(0)); 2805475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVal = getValue(I.getOperand(1)); 2806475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2807c7029805ef35ce9805931067b841e6af11db382eChris Lattner getValue(I.getOperand(2))); 2808c7029805ef35ce9805931067b841e6af11db382eChris Lattner 28097f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::INSERT_VECTOR_ELT, 28107f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 28117f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman InVec, InVal, InIdx)); 2812c7029805ef35ce9805931067b841e6af11db382eChris Lattner} 2813c7029805ef35ce9805931067b841e6af11db382eChris Lattner 28142bbd81064a6998496a71ff7ae8160b3caada64faChris Lattnervoid SelectionDAGLowering::visitExtractElement(User &I) { 2815475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InVec = getValue(I.getOperand(0)); 2816475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InIdx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), 2817384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner getValue(I.getOperand(1))); 28187f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, 2819384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner TLI.getValueType(I.getType()), InVec, InIdx)); 2820384504cea6c392125a2318d8bbb7f25aa0bbff7eChris Lattner} 2821c7029805ef35ce9805931067b841e6af11db382eChris Lattner 28223e104b11168da4692b69cc6b236c1da22adff959Chris Lattnervoid SelectionDAGLowering::visitShuffleVector(User &I) { 2823475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V1 = getValue(I.getOperand(0)); 2824475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V2 = getValue(I.getOperand(1)); 2825475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Mask = getValue(I.getOperand(2)); 28263e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 28277f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman setValue(&I, DAG.getNode(ISD::VECTOR_SHUFFLE, 28287f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman TLI.getValueType(I.getType()), 28297f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman V1, V2, Mask)); 28303e104b11168da4692b69cc6b236c1da22adff959Chris Lattner} 28313e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 28321d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitInsertValue(InsertValueInst &I) { 28331d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 28341d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op1 = I.getOperand(1); 28351d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = I.getType(); 28361d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = Op1->getType(); 28371d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool IntoUndef = isa<UndefValue>(Op0); 28381d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool FromUndef = isa<UndefValue>(Op1); 28391d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 28401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 28411d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 28421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 28431d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> AggValueVTs; 28441d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, AggTy, AggValueVTs); 28451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 28461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 28471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 28481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumAggValues = AggValueVTs.size(); 28491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 2850475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumAggValues); 28511d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2852475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Agg = getValue(Op0); 2853475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = getValue(Op1); 28541d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned i = 0; 28551d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy the beginning value(s) from the original aggregate. 28561d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex; ++i) 28571d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2858ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif SDValue(Agg.getNode(), Agg.getResNo() + i); 28591d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy values from the inserted value(s). 28601d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != LinearIndex + NumValValues; ++i) 28611d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = FromUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2862ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif SDValue(Val.getNode(), Val.getResNo() + i - LinearIndex); 28631d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy remaining value(s) from the original aggregate. 28641d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (; i != NumAggValues; ++i) 28651d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = IntoUndef ? DAG.getNode(ISD::UNDEF, AggValueVTs[i]) : 2866ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif SDValue(Agg.getNode(), Agg.getResNo() + i); 28671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2868f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&AggValueVTs[0], NumAggValues), 2869f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumAggValues)); 2870041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2871041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 28721d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohmanvoid SelectionDAGLowering::visitExtractValue(ExtractValueInst &I) { 28731d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Value *Op0 = I.getOperand(0); 28741d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *AggTy = Op0->getType(); 28751d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman const Type *ValTy = I.getType(); 28761d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool OutOfUndef = isa<UndefValue>(Op0); 28771d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 28781d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned LinearIndex = ComputeLinearIndex(TLI, AggTy, 28791d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman I.idx_begin(), I.idx_end()); 28801d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 28811d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValValueVTs; 28821d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, ValTy, ValValueVTs); 28831d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 28841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValValues = ValValueVTs.size(); 2885475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumValValues); 28861d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2887475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Agg = getValue(Op0); 28881d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman // Copy out the selected value(s). 28891d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = LinearIndex; i != LinearIndex + NumValValues; ++i) 28901d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i - LinearIndex] = 2891ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif OutOfUndef ? DAG.getNode(ISD::UNDEF, Agg.getNode()->getValueType(Agg.getResNo() + i)) : 2892ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif SDValue(Agg.getNode(), Agg.getResNo() + i); 28931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 2894f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValValueVTs[0], NumValValues), 2895f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValValues)); 2896041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman} 2897041e2eb51721bcfecee5d9c9fc409ff185526e47Dan Gohman 28983e104b11168da4692b69cc6b236c1da22adff959Chris Lattner 28991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitGetElementPtr(User &I) { 2900475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue N = getValue(I.getOperand(0)); 29011c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getOperand(0)->getType(); 29021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (GetElementPtrInst::op_iterator OI = I.op_begin()+1, E = I.op_end(); 29041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner OI != E; ++OI) { 29051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *Idx = *OI; 2906c88d8e944dae71e31595b8ae264668e68db6b8edChris Lattner if (const StructType *StTy = dyn_cast<StructType>(Ty)) { 2907b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer unsigned Field = cast<ConstantInt>(Idx)->getZExtValue(); 29081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (Field) { 29091c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // N = N + Offset 2910b1919e2f08ecb37140af676fd2916f8d5ed7df3dChris Lattner uint64_t Offset = TD->getStructLayout(StTy)->getElementOffset(Field); 29111c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 29120bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offset)); 29131c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 29141c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = StTy->getElementType(Field); 29151c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } else { 29161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Ty = cast<SequentialType>(Ty)->getElementType(); 29177c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 29187c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a constant subscript, handle it quickly. 29197c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx)) { 2920b83eb6447ba155342598f0fabe1f08f5baa9164aReid Spencer if (CI->getZExtValue() == 0) continue; 292147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer uint64_t Offs = 2922a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen TD->getABITypeSize(Ty)*cast<ConstantInt>(CI)->getSExtValue(); 29230bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, 29240bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(Offs)); 29257c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner continue; 29267c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner } 29277c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 29287c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // N = N + Idx * ElementSize; 2929a7ac2bd4076096bb3a9986dd5a44f20c7f715518Dale Johannesen uint64_t ElementSize = TD->getABITypeSize(Ty); 2930475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue IdxN = getValue(Idx); 29317c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 29327c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If the index is smaller or larger than intptr_t, truncate or extend 29337c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // it. 293483785c80968165b30fcdd111ceb2c28d38bcff86Evan Cheng if (IdxN.getValueType().bitsLT(N.getValueType())) 293547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer IdxN = DAG.getNode(ISD::SIGN_EXTEND, N.getValueType(), IdxN); 293683785c80968165b30fcdd111ceb2c28d38bcff86Evan Cheng else if (IdxN.getValueType().bitsGT(N.getValueType())) 29377c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner IdxN = DAG.getNode(ISD::TRUNCATE, N.getValueType(), IdxN); 29387c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner 29397c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // If this is a multiply by a power of two, turn it into a shl 29407c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner // immediately. This is a very common case. 29416679906d9724868bf2198e04952ba42f31d7b7feDan Gohman if (ElementSize != 1) { 29426679906d9724868bf2198e04952ba42f31d7b7feDan Gohman if (isPowerOf2_64(ElementSize)) { 29436679906d9724868bf2198e04952ba42f31d7b7feDan Gohman unsigned Amt = Log2_64(ElementSize); 29446679906d9724868bf2198e04952ba42f31d7b7feDan Gohman IdxN = DAG.getNode(ISD::SHL, N.getValueType(), IdxN, 29456679906d9724868bf2198e04952ba42f31d7b7feDan Gohman DAG.getConstant(Amt, TLI.getShiftAmountTy())); 29466679906d9724868bf2198e04952ba42f31d7b7feDan Gohman } else { 29476679906d9724868bf2198e04952ba42f31d7b7feDan Gohman SDValue Scale = DAG.getIntPtrConstant(ElementSize); 29486679906d9724868bf2198e04952ba42f31d7b7feDan Gohman IdxN = DAG.getNode(ISD::MUL, N.getValueType(), IdxN, Scale); 29496679906d9724868bf2198e04952ba42f31d7b7feDan Gohman } 29501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 29516679906d9724868bf2198e04952ba42f31d7b7feDan Gohman 29527c0104b525a4ba8b5268ee5455f92b011f7cc263Chris Lattner N = DAG.getNode(ISD::ADD, N.getValueType(), N, IdxN); 29531c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 29541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 29551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner setValue(&I, N); 29561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 29571c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29581c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitAlloca(AllocaInst &I) { 29591c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is a fixed sized alloca in the entry block of the function, 29601c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // allocate it statically on the stack. 29611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner if (FuncInfo.StaticAllocaMap.count(&I)) 29621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return; // getValue will auto-populate this. 29631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner const Type *Ty = I.getAllocatedType(); 2965514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 296658092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner unsigned Align = 2967d2b7cec527a0efa552628378ebca7a8ca63bb45dChris Lattner std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), 296858092e35a3368e130438cbc793c8f9dce2e4fe0fChris Lattner I.getAlignment()); 29691c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2970475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue AllocSize = getValue(I.getArraySize()); 297183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 29728e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(AllocSize.getValueType())) 297368cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::TRUNCATE, IntPtr, AllocSize); 29748e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(AllocSize.getValueType())) 297568cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, AllocSize); 29761c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 297768cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner AllocSize = DAG.getNode(ISD::MUL, IntPtr, AllocSize, 29780bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(TySize)); 29791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 29804515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Handle alignment. If the requested alignment is less than or equal to 29814515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, ignore it. If the size is greater than or equal to 29824515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // the stack alignment, we note this in the DYNAMIC_STACKALLOC node. 29831c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner unsigned StackAlign = 29841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner TLI.getTargetMachine().getFrameInfo()->getStackAlignment(); 29854515779fa39481649780bdd24fc966e89ec76edfEvan Cheng if (Align <= StackAlign) 29861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Align = 0; 29874515779fa39481649780bdd24fc966e89ec76edfEvan Cheng 29884515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Round the size of the allocation up to the stack alignment size 29894515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // by add SA-1 to the size. 29904515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::ADD, AllocSize.getValueType(), AllocSize, 29910bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(StackAlign-1)); 29924515779fa39481649780bdd24fc966e89ec76edfEvan Cheng // Mask out the low bits for alignment purposes. 29934515779fa39481649780bdd24fc966e89ec76edfEvan Cheng AllocSize = DAG.getNode(ISD::AND, AllocSize.getValueType(), AllocSize, 29940bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner DAG.getIntPtrConstant(~(uint64_t)(StackAlign-1))); 29951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 2996475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[] = { getRoot(), AllocSize, DAG.getIntPtrConstant(Align) }; 299783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTs = DAG.getNodeValueTypes(AllocSize.getValueType(), 2998f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner MVT::Other); 2999475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue DSA = DAG.getNode(ISD::DYNAMIC_STACKALLOC, VTs, 2, Ops, 3); 30000da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner setValue(&I, DSA); 30010da331fe0bff24e6c90c706ef8f1f1c3a8d90c2aChris Lattner DAG.setRoot(DSA.getValue(1)); 30021c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 30031c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Inform the Frame Information that we have just allocated a variable-sized 30041c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // object. 30051c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner CurMBB->getParent()->getFrameInfo()->CreateVariableSizedObject(); 30061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 30071c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 30081c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitLoad(LoadInst &I) { 30098a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Value *SV = I.getOperand(0); 3010475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ptr = getValue(SV); 30118a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 30128a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman const Type *Ty = I.getType(); 30138a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman bool isVolatile = I.isVolatile(); 30148a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned Alignment = I.getAlignment(); 30158a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman 30168a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<MVT, 4> ValueVTs; 30178a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman SmallVector<uint64_t, 4> Offsets; 30188a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman ComputeValueVTs(TLI, Ty, ValueVTs, &Offsets); 30198a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman unsigned NumValues = ValueVTs.size(); 30208a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 30218a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 3022edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3023475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root; 30248b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman bool ConstantMemory = false; 3025d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner if (I.isVolatile()) 30268b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman // Serialize volatile loads with other side effects. 3027d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = getRoot(); 30287c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman else if (AA->pointsToConstantMemory(SV)) { 30298b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman // Do not serialize (non-volatile) loads of constant memory with anything. 30308b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman Root = DAG.getEntryNode(); 30318b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman ConstantMemory = true; 30328b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman } else { 3033d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner // Do not serialize non-volatile loads against each other. 3034d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner Root = DAG.getRoot(); 3035d3948116b81b11e82246c11389a9b4ce7e619fbbChris Lattner } 303628b5b1c7b54c2065882b98af2406c38a3bcee802Chris Lattner 3037475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(NumValues); 3038475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Chains(NumValues); 30391d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 30401d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) { 3041475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getLoad(ValueVTs[i], Root, 30421d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 30431d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 30441d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SV, Offsets[i], 30451d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 30461d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Values[i] = L; 30471d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Chains[i] = L.getValue(1); 30481d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman } 30491d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 30508b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman if (!ConstantMemory) { 3051475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 30528b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman &Chains[0], NumValues); 30538b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman if (isVolatile) 30548b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman DAG.setRoot(Chain); 30558b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman else 30568b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman PendingLoads.push_back(Chain); 30578b4588fa64f0ebfbb7d2b9b4af8c682ddddf29c0Dan Gohman } 30581d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 3059f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands setValue(&I, DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], NumValues), 3060f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], NumValues)); 30611c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 30621c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 30631c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 30641c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitStore(StoreInst &I) { 30651c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Value *SrcV = I.getOperand(0); 30661d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman Value *PtrV = I.getOperand(1); 30671d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 30681d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<MVT, 4> ValueVTs; 30691d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman SmallVector<uint64_t, 4> Offsets; 30701d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman ComputeValueVTs(TLI, SrcV->getType(), ValueVTs, &Offsets); 30711d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned NumValues = ValueVTs.size(); 30728a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman if (NumValues == 0) 30738a6ccb5f73cf2e490faa181ad6662633b3ee38dfDan Gohman return; 30741d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 307590d33ee746f354030a4144c4ffa028599663615bDan Gohman // Get the lowered operands. Note that we do this after 307690d33ee746f354030a4144c4ffa028599663615bDan Gohman // checking if NumResults is zero, because with zero results 307790d33ee746f354030a4144c4ffa028599663615bDan Gohman // the operands won't have values in the map. 307890d33ee746f354030a4144c4ffa028599663615bDan Gohman SDValue Src = getValue(SrcV); 307990d33ee746f354030a4144c4ffa028599663615bDan Gohman SDValue Ptr = getValue(PtrV); 308090d33ee746f354030a4144c4ffa028599663615bDan Gohman 3081475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3082475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Chains(NumValues); 30831d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman MVT PtrVT = Ptr.getValueType(); 30841d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman bool isVolatile = I.isVolatile(); 30851d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman unsigned Alignment = I.getAlignment(); 30861d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman for (unsigned i = 0; i != NumValues; ++i) 3087ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Chains[i] = DAG.getStore(Root, SDValue(Src.getNode(), Src.getResNo() + i), 30881d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getNode(ISD::ADD, PtrVT, Ptr, 30891d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.getConstant(Offsets[i], PtrVT)), 30901d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman PtrV, Offsets[i], 30911d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman isVolatile, Alignment); 30921d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman 30931d685a46bf0c2f54378bc074c0b874bb7d12032eDan Gohman DAG.setRoot(DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumValues)); 30941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 30951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 30960eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// visitTargetIntrinsic - Lower a call of a target intrinsic to an INTRINSIC 30970eade319cdb72e24c11d068728a98083737c6435Chris Lattner/// node. 30980eade319cdb72e24c11d068728a98083737c6435Chris Lattnervoid SelectionDAGLowering::visitTargetIntrinsic(CallInst &I, 30990eade319cdb72e24c11d068728a98083737c6435Chris Lattner unsigned Intrinsic) { 3100a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool HasChain = !I.doesNotAccessMemory(); 3101a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands bool OnlyLoad = HasChain && I.onlyReadsMemory(); 3102a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 31030eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Build the operand list. 3104475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Ops; 3105e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { // If this intrinsic has side-effects, chainify it. 3106e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) { 3107e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner // We don't need to serialize loads against other loads. 3108e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(DAG.getRoot()); 3109e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } else { 3110e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner Ops.push_back(getRoot()); 3111e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 3112e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 31130eade319cdb72e24c11d068728a98083737c6435Chris Lattner 31140eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add the intrinsic ID as an integer operand. 31150eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(DAG.getConstant(Intrinsic, TLI.getPointerTy())); 31160eade319cdb72e24c11d068728a98083737c6435Chris Lattner 31170eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Add all operands of the call to the operand list. 31180eade319cdb72e24c11d068728a98083737c6435Chris Lattner for (unsigned i = 1, e = I.getNumOperands(); i != e; ++i) { 3119475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getValue(I.getOperand(i)); 31200eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(Op.getValueType()) && 31210eade319cdb72e24c11d068728a98083737c6435Chris Lattner "Intrinsic uses a non-legal type?"); 31220eade319cdb72e24c11d068728a98083737c6435Chris Lattner Ops.push_back(Op); 31230eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 31240eade319cdb72e24c11d068728a98083737c6435Chris Lattner 312583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands std::vector<MVT> VTs; 31260eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 312783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(I.getType()); 312883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (VT.isVector()) { 31299d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer const VectorType *DestTy = cast<VectorType>(I.getType()); 313083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT EltVT = TLI.getValueType(DestTy->getElementType()); 31310eade319cdb72e24c11d068728a98083737c6435Chris Lattner 313283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands VT = MVT::getVectorVT(EltVT, DestTy->getNumElements()); 31330eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(VT != MVT::Other && "Intrinsic uses a non-legal type?"); 31340eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 31350eade319cdb72e24c11d068728a98083737c6435Chris Lattner 31360eade319cdb72e24c11d068728a98083737c6435Chris Lattner assert(TLI.isTypeLegal(VT) && "Intrinsic uses a non-legal type?"); 31370eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(VT); 31380eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 31390eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (HasChain) 31400eade319cdb72e24c11d068728a98083737c6435Chris Lattner VTs.push_back(MVT::Other); 31410eade319cdb72e24c11d068728a98083737c6435Chris Lattner 314283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands const MVT *VTList = DAG.getNodeValueTypes(VTs); 3143f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner 31440eade319cdb72e24c11d068728a98083737c6435Chris Lattner // Create the node. 3145475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Result; 314648b61a729df6576c8833a83893d4086bddff69a5Chris Lattner if (!HasChain) 3147f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_WO_CHAIN, VTList, VTs.size(), 3148f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 314948b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else if (I.getType() != Type::VoidTy) 3150f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_W_CHAIN, VTList, VTs.size(), 3151f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 315248b61a729df6576c8833a83893d4086bddff69a5Chris Lattner else 3153f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Result = DAG.getNode(ISD::INTRINSIC_VOID, VTList, VTs.size(), 3154f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Ops[0], Ops.size()); 315548b61a729df6576c8833a83893d4086bddff69a5Chris Lattner 3156e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (HasChain) { 3157ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif SDValue Chain = Result.getValue(Result.getNode()->getNumValues()-1); 3158e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner if (OnlyLoad) 3159e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner PendingLoads.push_back(Chain); 3160e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner else 3161e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner DAG.setRoot(Chain); 3162e58a780166eb684164a0a95b999f29328d4e9b2bChris Lattner } 31630eade319cdb72e24c11d068728a98083737c6435Chris Lattner if (I.getType() != Type::VoidTy) { 31649d6565a5b1fbc4286d6ee638d8f47a3171a9ed7eReid Spencer if (const VectorType *PTy = dyn_cast<VectorType>(I.getType())) { 316583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = TLI.getValueType(PTy); 31667f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman Result = DAG.getNode(ISD::BIT_CONVERT, VT, Result); 31670eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 31680eade319cdb72e24c11d068728a98083737c6435Chris Lattner setValue(&I, Result); 31690eade319cdb72e24c11d068728a98083737c6435Chris Lattner } 31700eade319cdb72e24c11d068728a98083737c6435Chris Lattner} 31710eade319cdb72e24c11d068728a98083737c6435Chris Lattner 3172b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands/// ExtractTypeInfo - Returns the type info, possibly bitcast, encoded in V. 3173cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sandsstatic GlobalVariable *ExtractTypeInfo (Value *V) { 31740b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov V = V->stripPointerCasts(); 3175b4fd45e2fc4973214227fbaa96975d9fcc19ba42Duncan Sands GlobalVariable *GV = dyn_cast<GlobalVariable>(V); 31764c71dfe356716e6bc1993ef5efdced08b68fe612Anton Korobeynikov assert ((GV || isa<ConstantPointerNull>(V)) && 3177cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands "TypeInfo must be a global variable or NULL"); 3178cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands return GV; 3179cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands} 3180cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3181f40708223e409a152834b1553c6883ff2035b957Duncan Sands/// addCatchInfo - Extract the personality and type infos from an eh.selector 3182cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands/// call, and add them to the specified machine basic block. 3183f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void addCatchInfo(CallInst &I, MachineModuleInfo *MMI, 3184f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineBasicBlock *MBB) { 3185f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Inform the MachineModuleInfo of the personality for this landing pad. 3186f40708223e409a152834b1553c6883ff2035b957Duncan Sands ConstantExpr *CE = cast<ConstantExpr>(I.getOperand(2)); 3187f40708223e409a152834b1553c6883ff2035b957Duncan Sands assert(CE->getOpcode() == Instruction::BitCast && 3188f40708223e409a152834b1553c6883ff2035b957Duncan Sands isa<Function>(CE->getOperand(0)) && 3189f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Personality should be a function"); 3190f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addPersonality(MBB, cast<Function>(CE->getOperand(0))); 3191f40708223e409a152834b1553c6883ff2035b957Duncan Sands 3192f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Gather all the type infos for this landing pad and pass them along to 3193f40708223e409a152834b1553c6883ff2035b957Duncan Sands // MachineModuleInfo. 3194f40708223e409a152834b1553c6883ff2035b957Duncan Sands std::vector<GlobalVariable *> TyInfo; 3195cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned N = I.getNumOperands(); 3196cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3197cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned i = N - 1; i > 2; --i) { 3198cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand(i))) { 3199cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands unsigned FilterLength = CI->getZExtValue(); 32006590b0457c5e28a7336ae31de194953d8127217aDuncan Sands unsigned FirstCatch = i + FilterLength + !FilterLength; 3201cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands assert (FirstCatch <= N && "Invalid filter length"); 3202cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3203cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (FirstCatch < N) { 3204cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - FirstCatch); 3205cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = FirstCatch; j < N; ++j) 3206cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3207cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3208cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.clear(); 3209cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3210cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 32116590b0457c5e28a7336ae31de194953d8127217aDuncan Sands if (!FilterLength) { 32126590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Cleanup. 32136590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addCleanup(MBB); 32146590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } else { 32156590b0457c5e28a7336ae31de194953d8127217aDuncan Sands // Filter. 32166590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.reserve(FilterLength - 1); 32176590b0457c5e28a7336ae31de194953d8127217aDuncan Sands for (unsigned j = i + 1; j < FirstCatch; ++j) 32186590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 32196590b0457c5e28a7336ae31de194953d8127217aDuncan Sands MMI->addFilterTypeInfo(MBB, TyInfo); 32206590b0457c5e28a7336ae31de194953d8127217aDuncan Sands TyInfo.clear(); 32216590b0457c5e28a7336ae31de194953d8127217aDuncan Sands } 3222cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3223cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands N = i; 3224cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3225f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 3226cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands 3227cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (N > 3) { 3228cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.reserve(N - 3); 3229cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands for (unsigned j = 3; j < N; ++j) 3230cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands TyInfo.push_back(ExtractTypeInfo(I.getOperand(j))); 3231f40708223e409a152834b1553c6883ff2035b957Duncan Sands MMI->addCatchTypeInfo(MBB, TyInfo); 3232cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands } 3233f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 3234f40708223e409a152834b1553c6883ff2035b957Duncan Sands 323563307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 323663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang/// Inlined utility function to implement binary input atomic intrinsics for 323763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// visitIntrinsicCall: I is a call instruction 323863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang// Op is the associated NodeType for I 323963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wangconst char * 324063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P WangSelectionDAGLowering::implVisitBinaryAtomic(CallInst& I, ISD::NodeType Op) { 3241475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3242475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue L = DAG.getAtomic(Op, Root, 324363307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang getValue(I.getOperand(1)), 3244fd4418fc9b4725c44210c169c4d6500be468ca70Dan Gohman getValue(I.getOperand(2)), 324528873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang I.getOperand(1)); 324663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang setValue(&I, L); 324763307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang DAG.setRoot(L.getValue(1)); 324863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang return 0; 324963307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang} 325063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang 3251c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// visitIntrinsicCall - Lower the call to the specified intrinsic function. If 3252c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// we want to emit this as a call to a named external function, return the name 3253c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner/// otherwise lower it and return null. 3254c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattnerconst char * 3255c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris LattnerSelectionDAGLowering::visitIntrinsicCall(CallInst &I, unsigned Intrinsic) { 3256c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner switch (Intrinsic) { 32570eade319cdb72e24c11d068728a98083737c6435Chris Lattner default: 32580eade319cdb72e24c11d068728a98083737c6435Chris Lattner // By default, turn this into a target intrinsic node. 32590eade319cdb72e24c11d068728a98083737c6435Chris Lattner visitTargetIntrinsic(I, Intrinsic); 32600eade319cdb72e24c11d068728a98083737c6435Chris Lattner return 0; 3261c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vastart: visitVAStart(I); return 0; 3262c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vaend: visitVAEnd(I); return 0; 3263c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::vacopy: visitVACopy(I); return 0; 3264bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::returnaddress: 3265bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::RETURNADDR, TLI.getPointerTy(), 3266bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3267bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3268bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman case Intrinsic::frameaddress: 3269bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman setValue(&I, DAG.getNode(ISD::FRAMEADDR, TLI.getPointerTy(), 3270bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman getValue(I.getOperand(1)))); 3271bcc5f36765e8111c13873a0c0dc874c92385d808Nate Begeman return 0; 3272c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::setjmp: 3273d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_setjmp"+!TLI.usesUnderscoreSetJmp(); 3274c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 3275c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::longjmp: 3276d27a258d2d7691db3731135a448b7654d260cc07Anton Korobeynikov return "_longjmp"+!TLI.usesUnderscoreLongJmp(); 3277c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner break; 327803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memcpy_i32: 3279707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memcpy_i64: { 3280475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3281475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3282475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3283707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3284707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3285707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 328603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3287707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 328803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memset_i32: 3289707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memset_i64: { 3290475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3291475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3292475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3293707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3294707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemset(getRoot(), Op1, Op2, Op3, Align, 3295707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0)); 329603dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3297707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 329803dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner case Intrinsic::memmove_i32: 3299707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman case Intrinsic::memmove_i64: { 3300475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op1 = getValue(I.getOperand(1)); 3301475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op2 = getValue(I.getOperand(2)); 3302475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op3 = getValue(I.getOperand(3)); 3303707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman unsigned Align = cast<ConstantInt>(I.getOperand(4))->getZExtValue(); 3304707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3305707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // If the source and destination are known to not be aliases, we can 3306707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman // lower memmove as memcpy. 3307707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman uint64_t Size = -1ULL; 3308707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op3)) 3309707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman Size = C->getValue(); 33107c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (AA->alias(I.getOperand(1), Size, I.getOperand(2), Size) == 3311707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman AliasAnalysis::NoAlias) { 3312707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemcpy(getRoot(), Op1, Op2, Op3, Align, false, 3313707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 3314707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman return 0; 3315707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 3316707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman 3317707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman DAG.setRoot(DAG.getMemmove(getRoot(), Op1, Op2, Op3, Align, 3318707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman I.getOperand(1), 0, I.getOperand(2), 0)); 331903dd4652158f8a4c1db65f066195342d4a3695a7Chris Lattner return 0; 3320707e0184233f27e0e9f9aee0309f2daab8cfe7f8Dan Gohman } 332186cb643801be1308ba1da7db774b64852a119e94Chris Lattner case Intrinsic::dbg_stoppoint: { 332244c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 332343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgStopPointInst &SPI = cast<DbgStopPointInst>(I); 332444c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && SPI.getContext() && MMI->Verify(SPI.getContext())) { 332544c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey DebugInfoDesc *DD = MMI->getDescFor(SPI.getContext()); 3326ce72b1755f5993a42c2e04e32a93fa5228a285d4Jim Laskey assert(DD && "Not a debug information descriptor"); 33277f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman DAG.setRoot(DAG.getDbgStopPoint(getRoot(), 33287f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getLine(), 33297f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman SPI.getColumn(), 33307f460203b0c5350e9b2c592f438e40f7a7de6e45Dan Gohman cast<CompileUnitDesc>(DD))); 333186cb643801be1308ba1da7db774b64852a119e94Chris Lattner } 333243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3333b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 333436ce69195ed488034d0bb11180cc2ebd923679c8Chris Lattner } 333543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_start: { 333644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 333743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionStartInst &RSI = cast<DbgRegionStartInst>(I); 333844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && RSI.getContext() && MMI->Verify(RSI.getContext())) { 333944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionStart(RSI.getContext()); 33404406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 334143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 334243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3343b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 334443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 334543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_region_end: { 334644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 334743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgRegionEndInst &REI = cast<DbgRegionEndInst>(I); 334844c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey if (MMI && REI.getContext() && MMI->Verify(REI.getContext())) { 334944c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey unsigned LabelID = MMI->RecordRegionEnd(REI.getContext()); 33504406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::DBG_LABEL, getRoot(), LabelID)); 335143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 335243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3353b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 335443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 335543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_func_start: { 335644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 33571b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (!MMI) return 0; 335843970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgFuncStartInst &FSI = cast<DbgFuncStartInst>(I); 33591b08bbca5592351a940bcd164bdec724ee954326Evan Cheng Value *SP = FSI.getSubprogram(); 33601b08bbca5592351a940bcd164bdec724ee954326Evan Cheng if (SP && MMI->Verify(SP)) { 33611b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // llvm.dbg.func.start implicitly defines a dbg_stoppoint which is 33621b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // what (most?) gdb expects. 33631b08bbca5592351a940bcd164bdec724ee954326Evan Cheng DebugInfoDesc *DD = MMI->getDescFor(SP); 33641b08bbca5592351a940bcd164bdec724ee954326Evan Cheng assert(DD && "Not a debug information descriptor"); 33651b08bbca5592351a940bcd164bdec724ee954326Evan Cheng SubprogramDesc *Subprogram = cast<SubprogramDesc>(DD); 33661b08bbca5592351a940bcd164bdec724ee954326Evan Cheng const CompileUnitDesc *CompileUnit = Subprogram->getFile(); 336799fe47bc81d53762454ff112ab34378b00299b5aDan Gohman unsigned SrcFile = MMI->RecordSource(CompileUnit); 33681b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // Record the source line but does create a label. It will be emitted 33691b08bbca5592351a940bcd164bdec724ee954326Evan Cheng // at asm emission time. 33701b08bbca5592351a940bcd164bdec724ee954326Evan Cheng MMI->RecordSourceLine(Subprogram->getLine(), 0, SrcFile); 337143970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 337243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey 3373b1a5a5c4c0182205b91b962def7b008228a1f7e6Chris Lattner return 0; 337443970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 337543970fec322d9e0153ca513de41d80af1c79bddeJim Laskey case Intrinsic::dbg_declare: { 337644c3b9fdd416c79f4b67cde1aecfced5921efd81Jim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 337743970fec322d9e0153ca513de41d80af1c79bddeJim Laskey DbgDeclareInst &DI = cast<DbgDeclareInst>(I); 3378a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng Value *Variable = DI.getVariable(); 3379a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng if (MMI && Variable && MMI->Verify(Variable)) 3380a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng DAG.setRoot(DAG.getNode(ISD::DECLARE, MVT::Other, getRoot(), 3381a844bdeab31ef04221e7ef59a8467893584cc14dEvan Cheng getValue(DI.getAddress()), getValue(Variable))); 338243970fec322d9e0153ca513de41d80af1c79bddeJim Laskey return 0; 338343970fec322d9e0153ca513de41d80af1c79bddeJim Laskey } 3384c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3385b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey case Intrinsic::eh_exception: { 33861532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (!CurMBB->isLandingPad()) { 33871532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // FIXME: Mark exception register as live in. Hack for PR1508. 33881532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen unsigned Reg = TLI.getExceptionAddressRegister(); 33891532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (Reg) CurMBB->addLiveIn(Reg); 3390735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 33911532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Insert the EXCEPTIONADDR instruction. 33921532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen SDVTList VTs = DAG.getVTList(TLI.getPointerTy(), MVT::Other); 3393475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[1]; 33941532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Ops[0] = DAG.getRoot(); 3395475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = DAG.getNode(ISD::EXCEPTIONADDR, VTs, Ops, 1); 33961532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, Op); 33971532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.setRoot(Op.getValue(1)); 3398b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3399b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3400b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 34018806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i32: 34028806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_selector_i64: { 3403b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 340483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_selector_i32 ? 34058806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 34068806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 34071532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 3408f40708223e409a152834b1553c6883ff2035b957Duncan Sands if (CurMBB->isLandingPad()) 3409f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(I, MMI, CurMBB); 3410e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng else { 3411f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 3412f40708223e409a152834b1553c6883ff2035b957Duncan Sands FuncInfo.CatchInfoLost.insert(&I); 3413f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 3414902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands // FIXME: Mark exception selector register as live in. Hack for PR1508. 3415902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands unsigned Reg = TLI.getExceptionSelectorRegister(); 3416902919541fc2eb0e914390d9696088cfec3733dfDuncan Sands if (Reg) CurMBB->addLiveIn(Reg); 3417e47c333a12094296e54571ed1ac511a04d74840dEvan Cheng } 3418735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3419735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Insert the EHSELECTION instruction. 34208806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov SDVTList VTs = DAG.getVTList(VT, MVT::Other); 3421475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[2]; 3422735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[0] = getValue(I.getOperand(1)); 3423735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Ops[1] = getRoot(); 3424475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = DAG.getNode(ISD::EHSELECTION, VTs, Ops, 2); 3425735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey setValue(&I, Op); 3426735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Op.getValue(1)); 34277a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 34288806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(0, VT)); 3429b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3430b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3431b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3432b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 34338806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov 34348806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i32: 34358806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov case Intrinsic::eh_typeid_for_i64: { 3436b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 343783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = (Intrinsic == Intrinsic::eh_typeid_for_i32 ? 34388806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov MVT::i32 : MVT::i64); 3439735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3440735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey if (MMI) { 3441735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey // Find the type id for the given typeinfo. 3442cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands GlobalVariable *GV = ExtractTypeInfo(I.getOperand(1)); 34433b346368deddbe3cb853b29472de46bc9b58d6b8Duncan Sands 3444735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey unsigned TypeID = MMI->getTypeIDFor(GV); 34458806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(TypeID, VT)); 34467a1de987a69a059ba67779ee8fca3b391e8aa253Jim Laskey } else { 3447f664e41b201bad27ed3661bf50cd71f54242c114Duncan Sands // Return something different to eh_selector. 34488806c7b1f5317a9679a5779ffc08c552f2091bceAnton Korobeynikov setValue(&I, DAG.getConstant(1, VT)); 3449b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3450b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 3451b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey return 0; 3452b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey } 3453b180aa17539e14a5430d020bbc7de83c79b7fc4bJim Laskey 34542365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_return: { 34552365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 34562365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 34571532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (MMI) { 34582365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsEHReturn(true); 34592365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::EH_RETURN, 34602365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MVT::Other, 346186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman getControlRoot(), 34622365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(1)), 34632365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov getValue(I.getOperand(2)))); 34642365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } else { 34652365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov setValue(&I, DAG.getConstant(0, TLI.getPointerTy())); 34662365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 34672365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 34682365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 34692365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 34702365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 34712365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_unwind_init: { 34722365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov if (MachineModuleInfo *MMI = DAG.getMachineModuleInfo()) { 34732365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov MMI->setCallsUnwindInit(true); 34742365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 34752365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 34762365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 34772365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 34782365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 34792365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov case Intrinsic::eh_dwarf_cfa: { 348083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = getValue(I.getOperand(1)).getValueType(); 3481475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CfaArg; 34828e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (VT.bitsGT(TLI.getPointerTy())) 34831532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::TRUNCATE, 34841532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 34851532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen else 34861532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg = DAG.getNode(ISD::SIGN_EXTEND, 34871532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), getValue(I.getOperand(1))); 34881532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen 3489475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Offset = DAG.getNode(ISD::ADD, 34901532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 34911532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAME_TO_ARGS_OFFSET, 34921532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy()), 34931532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen CfaArg); 34941532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen setValue(&I, DAG.getNode(ISD::ADD, 34951532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 34961532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getNode(ISD::FRAMEADDR, 34971532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy(), 34981532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen DAG.getConstant(0, 34991532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen TLI.getPointerTy())), 35001532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen Offset)); 35012365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov return 0; 35022365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov } 35032365f51ed03afe6993bae962fdc2e5a956a64cd5Anton Korobeynikov 35049ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::sqrt: 3505c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner setValue(&I, DAG.getNode(ISD::FSQRT, 3506c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)).getValueType(), 3507c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner getValue(I.getOperand(1)))); 3508c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 35099ab7fb3ba47442d521a5bed09a27a5e8e7a786edDale Johannesen case Intrinsic::powi: 35106ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner setValue(&I, DAG.getNode(ISD::FPOWI, 35116ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)).getValueType(), 35126ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(1)), 35136ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner getValue(I.getOperand(2)))); 35146ddf8ed6fe2d0aa5e15f7b9ad7e5049e2223bbd1Chris Lattner return 0; 3515ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::sin: 3516ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FSIN, 3517ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3518ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3519ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3520ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::cos: 3521ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FCOS, 3522ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3523ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)))); 3524ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3525ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman case Intrinsic::pow: 3526ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman setValue(&I, DAG.getNode(ISD::FPOW, 3527ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)).getValueType(), 3528ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(1)), 3529ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman getValue(I.getOperand(2)))); 3530ac9385a5557ee2f34a509d39c58a8557a0ff686dDan Gohman return 0; 3531c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner case Intrinsic::pcmarker: { 3532475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 3533c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner DAG.setRoot(DAG.getNode(ISD::PCMARKER, MVT::Other, getRoot(), Tmp)); 3534c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3535c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 35368b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth case Intrinsic::readcyclecounter: { 3537475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getRoot(); 3538475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::READCYCLECOUNTER, 3539f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::i64, MVT::Other), 2, 3540f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner &Op, 1); 35418b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth setValue(&I, Tmp); 35428b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth DAG.setRoot(Tmp.getValue(1)); 354351b8d54922350b7e1c2cd5a5183ef2c5f5d1b1d5Andrew Lenharth return 0; 35448b91c77385a055474d271aa8c10f0382fdeaafebAndrew Lenharth } 3545c6eb6d72550aa3f7241141e3e28520dfef738c81Chris Lattner case Intrinsic::part_select: { 35463f108cb5558a80a63711114d819358f19773c057Reid Spencer // Currently not implemented: just abort 3547f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_select intrinsic not implemented"); 3548f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer abort(); 3549f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer } 3550f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer case Intrinsic::part_set: { 3551f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer // Currently not implemented: just abort 3552f75b874957aa61e81804e266daf671aa9dcc75b9Reid Spencer assert(0 && "part_set intrinsic not implemented"); 35533f108cb5558a80a63711114d819358f19773c057Reid Spencer abort(); 3554addd11d98ee3a3013c66d3fd25ee2cfb09b3c7bdReid Spencer } 3555a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::bswap: 3556d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman setValue(&I, DAG.getNode(ISD::BSWAP, 3557d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)).getValueType(), 3558d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman getValue(I.getOperand(1)))); 3559d88fc03602947b5baa35c8b09fe8bcfa2b4a03c1Nate Begeman return 0; 3560a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::cttz: { 3561475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 356283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3563475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTTZ, Ty, Arg); 3564a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3565c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3566a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3567a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctlz: { 3568475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 356983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3570475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTLZ, Ty, Arg); 3571a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3572c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3573a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3574a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer case Intrinsic::ctpop: { 3575475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = getValue(I.getOperand(1)); 357683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT Ty = Arg.getValueType(); 3577475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue result = DAG.getNode(ISD::CTPOP, Ty, Arg); 3578a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer setValue(&I, result); 3579c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return 0; 3580a4f9c4d29affaae0b4a3315ffff20e9130ecd17fReid Spencer } 3581140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner case Intrinsic::stacksave: { 3582475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getRoot(); 3583475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::STACKSAVE, 3584f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(TLI.getPointerTy(), MVT::Other), 2, &Op, 1); 3585140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner setValue(&I, Tmp); 3586140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner DAG.setRoot(Tmp.getValue(1)); 3587140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 3588140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner } 358939a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner case Intrinsic::stackrestore: { 3590475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 359139a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner DAG.setRoot(DAG.getNode(ISD::STACKRESTORE, MVT::Other, getRoot(), Tmp)); 3592140d53c99c3a70b9d3858a3c87f8ecb098994748Chris Lattner return 0; 359339a17dd31ddc4af6067940cb31e2c7d380773478Chris Lattner } 359424e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner case Intrinsic::var_annotation: 359524e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner // Discard annotate attributes 359624e5aada7d112447c41c12008f7daf1fc15a24bcTanya Lattner return 0; 359736397f50343639ce9a25996f2d790c656791ab92Duncan Sands 359836397f50343639ce9a25996f2d790c656791ab92Duncan Sands case Intrinsic::init_trampoline: { 35990b12ecf6ff6b5d3a144178257b6206f0c4788792Anton Korobeynikov const Function *F = cast<Function>(I.getOperand(2)->stripPointerCasts()); 360036397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3601475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[6]; 360236397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[0] = getRoot(); 360336397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[1] = getValue(I.getOperand(1)); 360436397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[2] = getValue(I.getOperand(2)); 360536397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[3] = getValue(I.getOperand(3)); 360636397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[4] = DAG.getSrcValue(I.getOperand(1)); 360736397f50343639ce9a25996f2d790c656791ab92Duncan Sands Ops[5] = DAG.getSrcValue(F); 360836397f50343639ce9a25996f2d790c656791ab92Duncan Sands 3609475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = DAG.getNode(ISD::TRAMPOLINE, 3610f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.getNodeValueTypes(TLI.getPointerTy(), 3611f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands MVT::Other), 2, 3612f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands Ops, 6); 3613f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands 3614f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands setValue(&I, Tmp); 3615f7331b3dd72409e644833ecaf62a0f6db03c97eeDuncan Sands DAG.setRoot(Tmp.getValue(1)); 361636397f50343639ce9a25996f2d790c656791ab92Duncan Sands return 0; 361736397f50343639ce9a25996f2d790c656791ab92Duncan Sands } 3618ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3619ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcroot: 36205eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (GFI) { 3621ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Value *Alloca = I.getOperand(1); 3622ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen Constant *TypeMap = cast<Constant>(I.getOperand(2)); 3623ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3624ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif FrameIndexSDNode *FI = cast<FrameIndexSDNode>(getValue(Alloca).getNode()); 36255eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI->addStackRoot(FI->getIndex(), TypeMap); 3626ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen } 3627ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3628ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3629ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcread: 3630ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen case Intrinsic::gcwrite: 36315eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen assert(0 && "GC failed to lower gcread/gcwrite intrinsics!"); 3632ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen return 0; 3633ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen 3634917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov case Intrinsic::flt_rounds: { 36351a0248690aaa9f7baaf1247e5f65a1c0c9e3783cDan Gohman setValue(&I, DAG.getNode(ISD::FLT_ROUNDS_, MVT::i32)); 3636917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov return 0; 3637917c2a6ff2cfcd1263a5dd80c54336754c553aceAnton Korobeynikov } 363866fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov 363966fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov case Intrinsic::trap: { 364066fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov DAG.setRoot(DAG.getNode(ISD::TRAP, MVT::Other, getRoot())); 364166fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov return 0; 364266fac79b899904ddd82e5ee354a6d370d80230f6Anton Korobeynikov } 364327b7db549e4c5bff4579d209304de5628513edebEvan Cheng case Intrinsic::prefetch: { 3644475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[4]; 364527b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[0] = getRoot(); 364627b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[1] = getValue(I.getOperand(1)); 364727b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[2] = getValue(I.getOperand(2)); 364827b7db549e4c5bff4579d209304de5628513edebEvan Cheng Ops[3] = getValue(I.getOperand(3)); 364927b7db549e4c5bff4579d209304de5628513edebEvan Cheng DAG.setRoot(DAG.getNode(ISD::PREFETCH, MVT::Other, &Ops[0], 4)); 365027b7db549e4c5bff4579d209304de5628513edebEvan Cheng return 0; 365127b7db549e4c5bff4579d209304de5628513edebEvan Cheng } 365227b7db549e4c5bff4579d209304de5628513edebEvan Cheng 365322c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth case Intrinsic::memory_barrier: { 3654475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Ops[6]; 365522c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[0] = getRoot(); 365622c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth for (int x = 1; x < 6; ++x) 365722c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth Ops[x] = getValue(I.getOperand(x)); 365822c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth 365922c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth DAG.setRoot(DAG.getNode(ISD::MEMBARRIER, MVT::Other, &Ops[0], 6)); 366022c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth return 0; 366122c5c1b2dfcb1da6a7ebfebea903401fc77d56e6Andrew Lenharth } 366228873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_cmp_swap: { 3663475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Root = getRoot(); 3664e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen SDValue L; 3665e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3666e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3667e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP_8, Root, 3668e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(1)), 3669e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(2)), 3670e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(3)), 3671e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen I.getOperand(1)); 3672e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen break; 3673e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3674e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP_16, Root, 3675e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(1)), 3676e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(2)), 3677e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(3)), 3678e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen I.getOperand(1)); 3679e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen break; 3680e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3681e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP_32, Root, 3682e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(1)), 3683e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(2)), 3684e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(3)), 3685e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen I.getOperand(1)); 3686e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen break; 3687e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3688e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen L = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP_64, Root, 3689e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(1)), 3690e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(2)), 3691e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen getValue(I.getOperand(3)), 3692e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen I.getOperand(1)); 3693e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen break; 3694e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3695e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3696e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3697e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 3698ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth setValue(&I, L); 3699ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth DAG.setRoot(L.getValue(1)); 3700ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth return 0; 3701ab0b949e0e9de452f3b052b11634ab761e008b23Andrew Lenharth } 370228873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_add: 3703e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3704e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3705e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD_8); 3706e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3707e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD_16); 3708e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3709e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD_32); 3710e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3711e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_ADD_64); 3712e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3713e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3714e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3715e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 371628873106309db515d58889a4c4fa3e0a92d1b60eMon P Wang case Intrinsic::atomic_load_sub: 3717e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3718e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3719e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB_8); 3720e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3721e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB_16); 3722e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3723e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB_32); 3724e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3725e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_SUB_64); 3726e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3727e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3728e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3729e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 373063307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_or: 3731e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3732e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3733e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR_8); 3734e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3735e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR_16); 3736e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3737e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR_32); 3738e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3739e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_OR_64); 3740e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3741e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3742e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3743e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 374463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_xor: 3745e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3746e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3747e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR_8); 3748e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3749e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR_16); 3750e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3751e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR_32); 3752e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3753e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_XOR_64); 3754e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3755e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3756e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3757e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 3758e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case Intrinsic::atomic_load_and: 3759e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3760e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3761e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND_8); 3762e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3763e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND_16); 3764e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3765e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND_32); 3766e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3767e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_AND_64); 3768e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3769e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3770e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3771e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 3772507a58ac9b20ddcea2e56a014be26b8f8cc0ecb8Andrew Lenharth case Intrinsic::atomic_load_nand: 3773e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3774e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3775e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND_8); 3776e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3777e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND_16); 3778e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3779e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND_32); 3780e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3781e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_NAND_64); 3782e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3783e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3784e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3785e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 378663307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_max: 3787e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3788e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3789e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX_8); 3790e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3791e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX_16); 3792e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3793e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX_32); 3794e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3795e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MAX_64); 3796e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3797e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3798e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3799e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 3800e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case Intrinsic::atomic_load_min: 3801e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3802e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3803e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN_8); 3804e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3805e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN_16); 3806e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3807e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN_32); 3808e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3809e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_MIN_64); 3810e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3811e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3812e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3813e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 381463307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umin: 3815e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3816e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3817e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN_8); 3818e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3819e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN_16); 3820e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3821e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN_32); 3822e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3823e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMIN_64); 3824e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3825e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3826e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3827e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 382863307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_load_umax: 3829e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3830e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3831e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX_8); 3832e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3833e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX_16); 3834e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3835e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX_32); 3836e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3837e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_LOAD_UMAX_64); 3838e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3839e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3840e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3841e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 384263307c335aa08b0d6a75f81d64d79af7e90eb78bMon P Wang case Intrinsic::atomic_swap: 3843e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen switch (getValue(I.getOperand(2)).getValueType().getSimpleVT()) { 3844e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i8: 3845e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP_8); 3846e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i16: 3847e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP_16); 3848e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i32: 3849e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP_32); 3850e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen case MVT::i64: 3851e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen return implVisitBinaryAtomic(I, ISD::ATOMIC_SWAP_64); 3852e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen default: 3853e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen assert(0 && "Invalid atomic type"); 3854e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen abort(); 3855e00a8a2a2e11a37fd1ddf2504bd22d225d0994d0Dale Johannesen } 3856c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3857c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner} 3858c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3859c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner 3860475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanvoid SelectionDAGLowering::LowerCallTo(CallSite CS, SDValue Callee, 38611da20a71d1bbabc472f281208be77475550be751Jim Laskey bool IsTailCall, 3862070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineBasicBlock *LandingPad) { 38636f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands const PointerType *PT = cast<PointerType>(CS.getCalledValue()->getType()); 3864735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey const FunctionType *FTy = cast<FunctionType>(PT->getElementType()); 3865070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MachineModuleInfo *MMI = DAG.getMachineModuleInfo(); 3866070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov unsigned BeginLabel = 0, EndLabel = 0; 38676f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3868735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListTy Args; 3869735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey TargetLowering::ArgListEntry Entry; 38706f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Args.reserve(CS.arg_size()); 38716f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands for (CallSite::arg_iterator i = CS.arg_begin(), e = CS.arg_end(); 38726f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands i != e; ++i) { 3873475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ArgNode = getValue(*i); 38746f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.Node = ArgNode; Entry.Ty = (*i)->getType(); 38756f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 38766f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands unsigned attrInd = i - CS.arg_begin() + 1; 38776f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSExt = CS.paramHasAttr(attrInd, ParamAttr::SExt); 38786f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isZExt = CS.paramHasAttr(attrInd, ParamAttr::ZExt); 38796f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isInReg = CS.paramHasAttr(attrInd, ParamAttr::InReg); 38806f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isSRet = CS.paramHasAttr(attrInd, ParamAttr::StructRet); 38816f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isNest = CS.paramHasAttr(attrInd, ParamAttr::Nest); 38826f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands Entry.isByVal = CS.paramHasAttr(attrInd, ParamAttr::ByVal); 388308e78b18b8ef2c939ee95469662c98e23846d860Dale Johannesen Entry.Alignment = CS.getParamAlignment(attrInd); 3884735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Args.push_back(Entry); 3885735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey } 3886735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 38871532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3888070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label before the invoke call to mark the try range. This can be 3889070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // used to detect deletion of the invoke via the MachineModuleInfo. 3890070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov BeginLabel = MMI->NextLabelID(); 3891a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // Both PendingLoads and PendingExports must be flushed here; 3892a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen // this call might not return. 3893a4091d34f3c05717eb5bb66a1257a0c1005e6dfaDale Johannesen (void)getRoot(); 38944406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getControlRoot(), BeginLabel)); 3895070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 38966f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands 3897475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 38986f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands TLI.LowerCallTo(getRoot(), CS.getType(), 38996f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands CS.paramHasAttr(0, ParamAttr::SExt), 390000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CS.paramHasAttr(0, ParamAttr::ZExt), 39016f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands FTy->isVarArg(), CS.getCallingConv(), IsTailCall, 3902735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey Callee, Args, DAG); 39036f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands if (CS.getType() != Type::VoidTy) 39046f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands setValue(CS.getInstruction(), Result.first); 3905735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey DAG.setRoot(Result.second); 3906070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 39071532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (LandingPad && MMI) { 3908070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // Insert a label at the end of the invoke call to mark the try range. This 3909070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov // can be used to detect deletion of the invoke via the MachineModuleInfo. 3910070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov EndLabel = MMI->NextLabelID(); 39114406604047423576e36657c7ede266ca42e79642Dan Gohman DAG.setRoot(DAG.getLabel(ISD::EH_LABEL, getRoot(), EndLabel)); 3912070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 39136f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands // Inform MachineModuleInfo of range. 3914070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov MMI->addInvoke(LandingPad, BeginLabel, EndLabel); 3915070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov } 3916735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey} 3917735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3918735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 39191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitCall(CallInst &I) { 392064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner const char *RenameFn = 0; 3921c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (Function *F = I.getCalledFunction()) { 392287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (F->isDeclaration()) { 3923c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (unsigned IID = F->getIntrinsicID()) { 3924c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner RenameFn = visitIntrinsicCall(I, IID); 3925c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner if (!RenameFn) 3926c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner return; 392787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 392887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 392987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner 393087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // Check for well-known libc/libm calls. If the function is internal, it 393187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner // can't be a library call. 393287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner unsigned NameLen = F->getNameLen(); 393387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (!F->hasInternalLinkage() && NameLen) { 393487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner const char *NameStr = F->getNameStart(); 393587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (NameStr[0] == 'c' && 393687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 8 && !strcmp(NameStr, "copysign")) || 393787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner (NameLen == 9 && !strcmp(NameStr, "copysignf")))) { 393887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 3 && // Basic sanity checks. 393987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 394087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType() && 394187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(2)->getType()) { 3942475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue LHS = getValue(I.getOperand(1)); 3943475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue RHS = getValue(I.getOperand(2)); 394487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOPYSIGN, LHS.getValueType(), 394587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner LHS, RHS)); 394687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 394787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 394887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'f' && 394987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 4 && !strcmp(NameStr, "fabs")) || 39502f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsf")) || 39512f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 5 && !strcmp(NameStr, "fabsl")))) { 395287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 395387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 395487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3955475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 395687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FABS, Tmp.getValueType(), Tmp)); 395787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 395887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 395987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 's' && 396087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "sin")) || 39612f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinf")) || 39622f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "sinl")))) { 396387b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 396487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 396587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3966475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 396787b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FSIN, Tmp.getValueType(), Tmp)); 396887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 396987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 397087b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } else if (NameStr[0] == 'c' && 397187b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner ((NameLen == 3 && !strcmp(NameStr, "cos")) || 39722f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosf")) || 39732f42901dff5d0b4a9bb571a2f57157c296584557Dale Johannesen (NameLen == 4 && !strcmp(NameStr, "cosl")))) { 397487b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner if (I.getNumOperands() == 2 && // Basic sanity checks. 397587b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getOperand(1)->getType()->isFloatingPoint() && 397687b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner I.getType() == I.getOperand(1)->getType()) { 3977475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Tmp = getValue(I.getOperand(1)); 397887b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner setValue(&I, DAG.getNode(ISD::FCOS, Tmp.getValueType(), Tmp)); 397987b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner return; 3980f76e7dc8d8ac1855ef59698e82c757548ef4ca65Chris Lattner } 3981c0f18152d94bf65061fab4b80869998cfb0439e1Chris Lattner } 398287b51bc2b0e9bced27d6fd95573a3f21691a261cChris Lattner } 3983ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner } else if (isa<InlineAsm>(I.getOperand(0))) { 3984fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands visitInlineAsm(&I); 3985ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner return; 3986c9ea6fde305b35ab7c9f909ac390d4b53e33d536Chris Lattner } 3987edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 3988475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Callee; 398964e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner if (!RenameFn) 399064e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = getValue(I.getOperand(0)); 399164e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner else 399264e14b1679fa3649b286402ea254d663ac43ef91Chris Lattner Callee = DAG.getExternalSymbol(RenameFn, TLI.getPointerTy()); 3993070280e97f801ae809ddcc7930c153929f253997Anton Korobeynikov 39946f74b48862948ebb83c7bf7036a76c9e84543fb4Duncan Sands LowerCallTo(&I, Callee, I.isTailCall()); 39951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 39961c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 3997735b6f8cc3abe3d6939d44a39d2e512c32716538Jim Laskey 3998b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyFromRegs - Emit a series of CopyFromReg nodes that copies from 3999b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// this value and returns the result as a ValueVT value. This uses 4000b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 4001b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 4002475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue RegsForValue::getCopyFromRegs(SelectionDAG &DAG, 4003475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, 4004475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue *Flag) const { 400523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Assemble the legal parts into the final values. 4006475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Values(ValueVTs.size()); 4007475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Parts; 40086833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 400923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Copy the legal parts from the registers. 401083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 401123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = TLI->getNumRegisters(ValueVT); 401283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 401323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 401491ee5454ae8f15de769a7316b4c36734b6103e45Rafael Espindola Parts.resize(NumRegs); 401523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 4016475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue P; 40176833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 40186833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT); 40196833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 40206833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner P = DAG.getCopyFromReg(Chain, Regs[Part+i], RegisterVT, *Flag); 402123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman *Flag = P.getValue(2); 40226833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 40236833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = P.getValue(1); 4024ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 4025ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If the source register was virtual and if we know something about it, 4026ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // add an assert node. 4027ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (TargetRegisterInfo::isVirtualRegister(Regs[Part+i]) && 4028ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT.isInteger() && !RegisterVT.isVector()) { 4029ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned SlotNo = Regs[Part+i]-TargetRegisterInfo::FirstVirtualRegister; 4030ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo &FLI = DAG.getFunctionLoweringInfo(); 4031ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FLI.LiveOutRegInfo.size() > SlotNo) { 4032ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[SlotNo]; 4033ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 4034ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned RegSize = RegisterVT.getSizeInBits(); 4035ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumSignBits = LOI.NumSignBits; 4036ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned NumZeroBits = LOI.KnownZero.countLeadingOnes(); 4037ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 4038ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // FIXME: We capture more information than the dag can represent. For 4039ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // now, just use the tightest assertzext/assertsext possible. 4040ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner bool isSExt = true; 4041ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT FromVT(MVT::Other); 4042ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits == RegSize) 4043ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i1; // ASSERT SEXT 1 4044ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-1) 4045ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i1; // ASSERT ZEXT 1 4046ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-8) 4047ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i8; // ASSERT SEXT 8 4048ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-9) 4049ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i8; // ASSERT ZEXT 8 4050ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-16) 4051ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i16; // ASSERT SEXT 16 4052ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-17) 4053ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i16; // ASSERT ZEXT 16 4054ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumSignBits > RegSize-32) 4055ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = true, FromVT = MVT::i32; // ASSERT SEXT 32 4056ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner else if (NumZeroBits >= RegSize-33) 4057ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner isSExt = false, FromVT = MVT::i32; // ASSERT ZEXT 32 4058ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 4059ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (FromVT != MVT::Other) { 4060ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner P = DAG.getNode(isSExt ? ISD::AssertSext : ISD::AssertZext, 4061ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner RegisterVT, P, DAG.getValueType(FromVT)); 4062ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 4063ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 4064ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 4065ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 4066ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 406791ee5454ae8f15de769a7316b4c36734b6103e45Rafael Espindola Parts[i] = P; 406823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 4069b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 407091ee5454ae8f15de769a7316b4c36734b6103e45Rafael Espindola Values[Value] = getCopyFromParts(DAG, Parts.begin(), NumRegs, RegisterVT, 407123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ValueVT); 407223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumRegs; 407391ee5454ae8f15de769a7316b4c36734b6103e45Rafael Espindola Parts.clear(); 407423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 40754bdcb61af33399d4e01fdf3c47ca1f1f5356e370Duncan Sands 4076f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands return DAG.getMergeValues(DAG.getVTList(&ValueVTs[0], ValueVTs.size()), 4077f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &Values[0], ValueVTs.size()); 4078b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman} 4079b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4080b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// getCopyToRegs - Emit a series of CopyToReg nodes that copies the 4081b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// specified value into the registers specified by this object. This uses 4082b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// Chain/Flag as the input and updates them for the output Chain/Flag. 4083b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman/// If the Flag pointer is NULL, no flag is used. 4084475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanvoid RegsForValue::getCopyToRegs(SDValue Val, SelectionDAG &DAG, 4085475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue &Chain, SDValue *Flag) const { 4086b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Get the list of the values's legal parts. 408723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumRegs = Regs.size(); 4088475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Parts(NumRegs); 40896833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Part = 0, e = ValueVTs.size(); Value != e; ++Value) { 409083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = ValueVTs[Value]; 409123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman unsigned NumParts = TLI->getNumRegisters(ValueVT); 409283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 409323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman 409499a6cb92d173c142073416c81efe6d3daeb80b49Gabor Greif getCopyToParts(DAG, Val.getValue(Val.getResNo() + Value), 409523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman &Parts[Part], NumParts, RegisterVT); 409623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman Part += NumParts; 409723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 4098b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 4099b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Copy the parts into the registers. 4100475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> Chains(NumRegs); 410123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 4102475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Part; 41036833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner if (Flag == 0) 41046833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i]); 41056833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else { 41066833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Part = DAG.getCopyToReg(Chain, Regs[i], Parts[i], *Flag); 4107b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman *Flag = Part.getValue(1); 41086833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner } 41096833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chains[i] = Part.getValue(0); 4110c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 41116833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner 411233bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng if (NumRegs == 1 || Flag) 411333bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // If NumRegs > 1 && Flag is used then the use of the last CopyToReg is 411433bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // flagged to it. That is the CopyToReg nodes and the user are considered 411533bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // a single scheduling unit. If we create a TokenFactor and return it as 411633bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // chain, then the TokenFactor is both a predecessor (operand) of the 411733bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // user as well as a successor (the TF operands are flagged to the user). 411833bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c1, f1 = CopyToReg 411933bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c2, f2 = CopyToReg 412033bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // c3 = TokenFactor c1, c2 412133bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // ... 412233bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng // = op c3, ..., f2 412333bf38ad881fa3d403cc81209d0ae796f94f125eEvan Cheng Chain = Chains[NumRegs-1]; 41246833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner else 41256833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, &Chains[0], NumRegs); 4126c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 4127864635ad7b3046d3042311423071152c613961deChris Lattner 4128c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// AddInlineAsmOperands - Add this value to the specified inlineasm node 4129c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// operand list. This adds the code marker and includes the number of 4130c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner/// values added into it. 4131c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattnervoid RegsForValue::AddInlineAsmOperands(unsigned Code, SelectionDAG &DAG, 4132475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> &Ops) const { 413383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtrTy = DAG.getTargetLoweringInfo().getPointerTy(); 41344b993b19f9837fdf2db55a3e042e8adab3d63c26Chris Lattner Ops.push_back(DAG.getTargetConstant(Code | (Regs.size() << 3), IntPtrTy)); 41356833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned Value = 0, Reg = 0, e = ValueVTs.size(); Value != e; ++Value) { 41366833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner unsigned NumRegs = TLI->getNumRegisters(ValueVTs[Value]); 413783ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = RegVTs[Value]; 41386833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner for (unsigned i = 0; i != NumRegs; ++i) 41396833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattner Ops.push_back(DAG.getRegister(Regs[Reg++], RegisterVT)); 414023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman } 4141c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner} 4142864635ad7b3046d3042311423071152c613961deChris Lattner 4143864635ad7b3046d3042311423071152c613961deChris Lattner/// isAllocatableRegister - If the specified register is safe to allocate, 4144864635ad7b3046d3042311423071152c613961deChris Lattner/// i.e. it isn't a stack pointer or some other special register, return the 4145864635ad7b3046d3042311423071152c613961deChris Lattner/// register class for the register. Otherwise, return null. 4146864635ad7b3046d3042311423071152c613961deChris Lattnerstatic const TargetRegisterClass * 41479b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris LattnerisAllocatableRegister(unsigned Reg, MachineFunction &MF, 41486f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetLowering &TLI, 41496f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI) { 415083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT FoundVT = MVT::Other; 4151f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner const TargetRegisterClass *FoundRC = 0; 41526f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman for (TargetRegisterInfo::regclass_iterator RCI = TRI->regclass_begin(), 41536f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman E = TRI->regclass_end(); RCI != E; ++RCI) { 415483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ThisVT = MVT::Other; 4155f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner 41569b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner const TargetRegisterClass *RC = *RCI; 41579b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // If none of the the value types for this register class are valid, we 41589b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner // can't use it. For example, 64-bit reg classes on 32-bit targets. 41599b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::vt_iterator I = RC->vt_begin(), E = RC->vt_end(); 41609b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner I != E; ++I) { 41619b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner if (TLI.isTypeLegal(*I)) { 4162f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // If we have already found this register in a different register class, 4163f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // choose the one with the largest VT specified. For example, on 4164f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // PowerPC, we favor f64 register classes over f32. 41658e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (FoundVT == MVT::Other || FoundVT.bitsLT(*I)) { 4166f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner ThisVT = *I; 4167f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 4168f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 41699b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 41709b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner } 41719b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 4172f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (ThisVT == MVT::Other) continue; 41739b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner 4174864635ad7b3046d3042311423071152c613961deChris Lattner // NOTE: This isn't ideal. In particular, this might allocate the 4175864635ad7b3046d3042311423071152c613961deChris Lattner // frame pointer in functions that need it (due to them not being taken 4176864635ad7b3046d3042311423071152c613961deChris Lattner // out of allocation, because a variable sized allocation hasn't been seen 4177864635ad7b3046d3042311423071152c613961deChris Lattner // yet). This is a slight code pessimization, but should still work. 41789b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner for (TargetRegisterClass::iterator I = RC->allocation_order_begin(MF), 41799b6fb5de49f30d03b3e3f2fcb99e777b3149b783Chris Lattner E = RC->allocation_order_end(MF); I != E; ++I) 4180f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner if (*I == Reg) { 4181f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // We found a matching register class. Keep looking at others in case 4182f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner // we find one with larger registers that this physreg is also in. 4183f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundRC = RC; 4184f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner FoundVT = ThisVT; 4185f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner break; 4186f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner } 4187864635ad7b3046d3042311423071152c613961deChris Lattner } 4188f8814cf8b8ba8953add60078e304fd5a4113f9ccChris Lattner return FoundRC; 4189864635ad7b3046d3042311423071152c613961deChris Lattner} 4190864635ad7b3046d3042311423071152c613961deChris Lattner 4191bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 4192bf996f1d5e441c7504ff155d818190f593d54672Chris Lattnernamespace { 4193bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// AsmOperandInfo - This contains information for each constraint that we are 4194bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner/// lowering. 41955c80760fdf71659c5bdf45cd85d173df454dfb41Evan Chengstruct SDISelAsmOperandInfo : public TargetLowering::AsmOperandInfo { 41965c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// CallOperand - If this is the result output operand or a clobber 41975c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// this is null, otherwise it is the incoming operand to the CallInst. 41985c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng /// This gets modified as the asm is processed. 4199475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue CallOperand; 42005c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng 4201e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// AssignedRegs - If this is a register or register class operand, this 4202e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// contains the set of register corresponding to the operand. 4203e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner RegsForValue AssignedRegs; 4204e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 420523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman explicit SDISelAsmOperandInfo(const InlineAsm::ConstraintInfo &info) 42065c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng : TargetLowering::AsmOperandInfo(info), CallOperand(0,0) { 4207bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner } 4208bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 4209e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// MarkAllocatedRegs - Once AssignedRegs is set, mark the assigned registers 4210e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner /// busy in OutputRegs/InputRegs. 4211e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner void MarkAllocatedRegs(bool isOutReg, bool isInReg, 4212e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::set<unsigned> &OutputRegs, 42137cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner std::set<unsigned> &InputRegs, 42147cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) const { 42157cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isOutReg) { 42167cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 42177cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], OutputRegs, TRI); 42187cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 42197cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (isInReg) { 42207cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (unsigned i = 0, e = AssignedRegs.Regs.size(); i != e; ++i) 42217cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner MarkRegAndAliases(AssignedRegs.Regs[i], InputRegs, TRI); 42227cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 42237cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 42247cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner 42257cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattnerprivate: 42267cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// MarkRegAndAliases - Mark the specified register and all aliases in the 42277cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner /// specified set. 42287cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner static void MarkRegAndAliases(unsigned Reg, std::set<unsigned> &Regs, 42297cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo &TRI) { 42307cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner assert(TargetRegisterInfo::isPhysicalRegister(Reg) && "Isn't a physreg"); 42317cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(Reg); 42327cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner if (const unsigned *Aliases = TRI.getAliasSet(Reg)) 42337cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner for (; *Aliases; ++Aliases) 42347cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner Regs.insert(*Aliases); 42357cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner } 4236bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner}; 4237bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner} // end anon namespace. 4238bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 4239bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 42400fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// GetRegistersForValue - Assign registers (virtual or physical) for the 42410fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// specified operand. We prefer to assign virtual registers, to allow the 42420fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// register allocator handle the assignment process. However, if the asm uses 42430fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// features that we can't model on machineinstrs, we have SDISel do the 42440fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// allocation. This produces generally horrible, but correct, code. 42450fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 42460fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// OpInfo describes the operand. 42470fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// HasEarlyClobber is true if there are any early clobber constraints (=&r) 42480fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// or any explicitly clobbered registers. 42490fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// Input and OutputRegs are the set of already allocated physical registers. 42500fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner/// 4251e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattnervoid SelectionDAGLowering:: 42525c80760fdf71659c5bdf45cd85d173df454dfb41Evan ChengGetRegistersForValue(SDISelAsmOperandInfo &OpInfo, bool HasEarlyClobber, 4253864635ad7b3046d3042311423071152c613961deChris Lattner std::set<unsigned> &OutputRegs, 42544e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> &InputRegs) { 4255e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Compute whether this value requires an input register, an output register, 4256e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // or both. 4257e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isOutReg = false; 4258e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool isInReg = false; 4259e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner switch (OpInfo.Type) { 4260e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isOutput: 4261e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 4262e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4263e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is an early-clobber output, or if there is an input 4264e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint that matches this, we need to reserve the input register 4265e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // so no other inputs allocate to it. 4266e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = OpInfo.isEarlyClobber || OpInfo.hasMatchingInput; 4267e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 4268e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isInput: 4269e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 4270e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = false; 4271e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 4272e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner case InlineAsm::isClobber: 4273e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isOutReg = true; 4274e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner isInReg = true; 4275e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner break; 4276e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 4277e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4278e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4279e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 4280b606dba13ba84721cc297174c2eb1275bc642604Chris Lattner SmallVector<unsigned, 4> Regs; 4281e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4282e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this is a constraint for a single physreg, or a constraint for a 4283e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // register class, find it. 4284e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 4285e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 4286e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 4287864635ad7b3046d3042311423071152c613961deChris Lattner 4288bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner unsigned NumRegs = 1; 4289bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT != MVT::Other) 4290b9f10196961ebe5b5573a5705048a5a8a6b56bb3Dan Gohman NumRegs = TLI.getNumRegisters(OpInfo.ConstraintVT); 429183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegVT; 429283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT ValueVT = OpInfo.ConstraintVT; 4293864635ad7b3046d3042311423071152c613961deChris Lattner 4294bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner 42952a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is a constraint for a specific physical register, like {r17}, 42962a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // assign it now. 4297864635ad7b3046d3042311423071152c613961deChris Lattner if (PhysReg.first) { 4298bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 4299864635ad7b3046d3042311423071152c613961deChris Lattner ValueVT = *PhysReg.second->vt_begin(); 4300cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner 4301cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // Get the actual register value type. This is important, because the user 4302cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // may have asked for (e.g.) the AX register in i32 type. We need to 4303cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner // remember that AX is actually i16 to get the right extension. 4304cf752aa502a2ce6eaca9db4640171143c49e1733Chris Lattner RegVT = *PhysReg.second->vt_begin(); 4305864635ad7b3046d3042311423071152c613961deChris Lattner 4306864635ad7b3046d3042311423071152c613961deChris Lattner // This is a explicit reference to a physical register. 4307864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(PhysReg.first); 4308864635ad7b3046d3042311423071152c613961deChris Lattner 4309864635ad7b3046d3042311423071152c613961deChris Lattner // If this is an expanded reference, add the rest of the regs to Regs. 4310864635ad7b3046d3042311423071152c613961deChris Lattner if (NumRegs != 1) { 4311864635ad7b3046d3042311423071152c613961deChris Lattner TargetRegisterClass::iterator I = PhysReg.second->begin(); 4312864635ad7b3046d3042311423071152c613961deChris Lattner for (; *I != PhysReg.first; ++I) 431350871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Didn't find reg!"); 4314864635ad7b3046d3042311423071152c613961deChris Lattner 4315864635ad7b3046d3042311423071152c613961deChris Lattner // Already added the first reg. 4316864635ad7b3046d3042311423071152c613961deChris Lattner --NumRegs; ++I; 4317864635ad7b3046d3042311423071152c613961deChris Lattner for (; NumRegs; --NumRegs, ++I) { 431850871247216dfef8386a112766e972a1792b0b56Evan Cheng assert(I != PhysReg.second->end() && "Ran out of registers to allocate!"); 4319864635ad7b3046d3042311423071152c613961deChris Lattner Regs.push_back(*I); 4320864635ad7b3046d3042311423071152c613961deChris Lattner } 4321864635ad7b3046d3042311423071152c613961deChris Lattner } 432223ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 43237cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 43247cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4325e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4326864635ad7b3046d3042311423071152c613961deChris Lattner } 4327864635ad7b3046d3042311423071152c613961deChris Lattner 43282a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, if this was a reference to an LLVM register class, create vregs 43292a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // for this reference. 43302a821601f1db665fbb825727aacf1a54d17b91efChris Lattner std::vector<unsigned> RegClassRegs; 4331c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner const TargetRegisterClass *RC = PhysReg.second; 4332c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC) { 43332a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // If this is an early clobber or tied register, our regalloc doesn't know 43342a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // how to maintain the constraint. If it isn't, go ahead and create vreg 43352a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // and let the regalloc do the right thing. 4336e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.hasMatchingInput && !OpInfo.isEarlyClobber && 4337e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If there is some other early clobber and this is an input register, 4338e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // then we are forced to pre-allocate the input reg so it doesn't 4339e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // conflict with the earlyclobber. 4340e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner !(OpInfo.Type == InlineAsm::isInput && HasEarlyClobber)) { 43412a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegVT = *PhysReg.second->vt_begin(); 43423a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner 4343bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner if (OpInfo.ConstraintVT == MVT::Other) 43443a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner ValueVT = RegVT; 43452a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 43462a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Create the appropriate number of virtual registers. 434784bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner MachineRegisterInfo &RegInfo = MF.getRegInfo(); 43482a821601f1db665fbb825727aacf1a54d17b91efChris Lattner for (; NumRegs; --NumRegs) 434984bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner Regs.push_back(RegInfo.createVirtualRegister(PhysReg.second)); 43502a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 435123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, RegVT, ValueVT); 4352e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 43532a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 43542a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 43552a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // Otherwise, we can't allocate it. Let the code below figure out how to 43562a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // maintain these constraints. 43572a821601f1db665fbb825727aacf1a54d17b91efChris Lattner RegClassRegs.assign(PhysReg.second->begin(), PhysReg.second->end()); 43582a821601f1db665fbb825727aacf1a54d17b91efChris Lattner 43592a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } else { 43602a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // This is a reference to a register class that doesn't directly correspond 43612a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // to an LLVM register class. Allocate NumRegs consecutive, available, 43622a821601f1db665fbb825727aacf1a54d17b91efChris Lattner // registers from the class. 4363bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner RegClassRegs = TLI.getRegClassForInlineAsmConstraint(OpInfo.ConstraintCode, 4364bf996f1d5e441c7504ff155d818190f593d54672Chris Lattner OpInfo.ConstraintVT); 43652a821601f1db665fbb825727aacf1a54d17b91efChris Lattner } 4366e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 43676f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman const TargetRegisterInfo *TRI = DAG.getTarget().getRegisterInfo(); 4368864635ad7b3046d3042311423071152c613961deChris Lattner unsigned NumAllocated = 0; 4369864635ad7b3046d3042311423071152c613961deChris Lattner for (unsigned i = 0, e = RegClassRegs.size(); i != e; ++i) { 4370864635ad7b3046d3042311423071152c613961deChris Lattner unsigned Reg = RegClassRegs[i]; 43714e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // See if this register is available. 4372864635ad7b3046d3042311423071152c613961deChris Lattner if ((isOutReg && OutputRegs.count(Reg)) || // Already used. 4373864635ad7b3046d3042311423071152c613961deChris Lattner (isInReg && InputRegs.count(Reg))) { // Already used. 4374864635ad7b3046d3042311423071152c613961deChris Lattner // Make sure we find consecutive registers. 4375864635ad7b3046d3042311423071152c613961deChris Lattner NumAllocated = 0; 4376864635ad7b3046d3042311423071152c613961deChris Lattner continue; 4377864635ad7b3046d3042311423071152c613961deChris Lattner } 4378864635ad7b3046d3042311423071152c613961deChris Lattner 43794e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // Check to see if this register is allocatable (i.e. don't give out the 43804e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner // stack pointer). 4381c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (RC == 0) { 43826f0d024a534af18d9e60b3ea757376cd8a3a980eDan Gohman RC = isAllocatableRegister(Reg, MF, TLI, TRI); 4383c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner if (!RC) { // Couldn't allocate this register. 4384c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner // Reset NumAllocated to make sure we return consecutive registers. 4385c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner NumAllocated = 0; 4386c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner continue; 4387c2c28fc24cc0c7886da93939b0279d3f444b35dcChris Lattner } 43884e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 43894e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 4390864635ad7b3046d3042311423071152c613961deChris Lattner // Okay, this register is good, we can use it. 4391864635ad7b3046d3042311423071152c613961deChris Lattner ++NumAllocated; 4392864635ad7b3046d3042311423071152c613961deChris Lattner 4393e303ac9052b9d03eff236469eb560e5b5da7fae2Chris Lattner // If we allocated enough consecutive registers, succeed. 4394864635ad7b3046d3042311423071152c613961deChris Lattner if (NumAllocated == NumRegs) { 4395864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegStart = (i-NumAllocated)+1; 4396864635ad7b3046d3042311423071152c613961deChris Lattner unsigned RegEnd = i+1; 4397864635ad7b3046d3042311423071152c613961deChris Lattner // Mark all of the allocated registers used. 4398e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = RegStart; i != RegEnd; ++i) 4399e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner Regs.push_back(RegClassRegs[i]); 4400864635ad7b3046d3042311423071152c613961deChris Lattner 440123ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman OpInfo.AssignedRegs = RegsForValue(TLI, Regs, *RC->vt_begin(), 4402e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.ConstraintVT); 44037cbeb2431c7264d0848d1343f43914f970828ac7Chris Lattner OpInfo.MarkAllocatedRegs(isOutReg, isInReg, OutputRegs, InputRegs, *TRI); 4404e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner return; 4405864635ad7b3046d3042311423071152c613961deChris Lattner } 44064e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner } 4407864635ad7b3046d3042311423071152c613961deChris Lattner 4408864635ad7b3046d3042311423071152c613961deChris Lattner // Otherwise, we couldn't allocate enough registers for this. 44094e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner} 44104e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner 44113ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner 4412ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// visitInlineAsm - Handle a call to an InlineAsm object. 4413ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner/// 4414fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sandsvoid SelectionDAGLowering::visitInlineAsm(CallSite CS) { 4415fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands InlineAsm *IA = cast<InlineAsm>(CS.getCalledValue()); 4416ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 44170c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner /// ConstraintOperands - Information about all of the constraints. 44185c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng std::vector<SDISelAsmOperandInfo> ConstraintOperands; 4419ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4420475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = getRoot(); 4421475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Flag; 4422ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 44234e4b576e2edfc7d40a3d7177c639acbe91cfd45fChris Lattner std::set<unsigned> OutputRegs, InputRegs; 44240c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 44250c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Do a prepass over the constraints, canonicalizing them, and building up the 44260c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // ConstraintOperands list. 44270c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner std::vector<InlineAsm::ConstraintInfo> 44280c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos = IA->ParseConstraints(); 4429e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4430e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // SawEarlyClobber - Keep track of whether we saw an earlyclobber output 4431e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // constraint. If so, we can't let the register allocator allocate any input 4432e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // registers, because it will not know to avoid the earlyclobbered output reg. 4433e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner bool SawEarlyClobber = false; 4434e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4435fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands unsigned ArgNo = 0; // ArgNo - The argument of the CallInst. 4436acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner unsigned ResNo = 0; // ResNo - The result number of the next output. 44370c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintInfos.size(); i != e; ++i) { 44385c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng ConstraintOperands.push_back(SDISelAsmOperandInfo(ConstraintInfos[i])); 44395c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands.back(); 44400c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 444183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT OpVT = MVT::Other; 44421efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 44430c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Compute the value type for each operand. 44440c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 44451efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isOutput: 4446acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // Indirect outputs just consume an argument. 4447acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (OpInfo.isIndirect) { 4448fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 4449acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner break; 4450acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } 4451acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // The return value of the call is this value. As such, there is no 4452acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner // corresponding argument. 4453acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 4454acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner if (const StructType *STy = dyn_cast<StructType>(CS.getType())) { 4455acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(STy->getElementType(ResNo)); 4456acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner } else { 4457acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner assert(ResNo == 0 && "Asm only has one result!"); 4458acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner OpVT = TLI.getValueType(CS.getType()); 44591efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 4460acf8b01fd6dd7a796d490795886bdfa67f074631Chris Lattner ++ResNo; 44611efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 44621efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isInput: 4463fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands OpInfo.CallOperandVal = CS.getArgument(ArgNo++); 44641efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 44651efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner case InlineAsm::isClobber: 44660c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // Nothing to do. 44671efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner break; 44681efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner } 44690c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 44700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // If this is an input or an indirect output, process the call argument. 4471eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // BasicBlocks are labels, currently appearing only in asm's. 44720c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (OpInfo.CallOperandVal) { 4473507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner if (BasicBlock *BB = dyn_cast<BasicBlock>(OpInfo.CallOperandVal)) 4474507ffd2423cfd0f5204c69e44c50aa3c759609d8Chris Lattner OpInfo.CallOperand = DAG.getBasicBlock(FuncInfo.MBBMap[BB]); 4475eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen else { 4476eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpInfo.CallOperand = getValue(OpInfo.CallOperandVal); 4477eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen const Type *OpTy = OpInfo.CallOperandVal->getType(); 4478eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // If this is an indirect operand, the operand is a pointer to the 4479eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // accessed type. 4480eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen if (OpInfo.isIndirect) 4481eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = cast<PointerType>(OpTy)->getElementType(); 4482eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 44834fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman // If OpTy is not a single value, it may be a struct/union that we 4484eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen // can tile with integers. 44854fa2a3f0efe0081272b09550fef6251d355047e4Dan Gohman if (!OpTy->isSingleValueType() && OpTy->isSized()) { 4486eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen unsigned BitSize = TD->getTypeSizeInBits(OpTy); 4487eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen switch (BitSize) { 4488eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen default: break; 4489eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 1: 4490eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 8: 4491eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 16: 4492eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 32: 4493eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen case 64: 4494eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpTy = IntegerType::get(BitSize); 4495eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen break; 4496eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen } 44976995cf6015580eeab07a1c671fca180084a1325eChris Lattner } 4498eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen 4499eb57ea7ea2378b77bc995371c1888193b960cd03Dale Johannesen OpVT = TLI.getValueType(OpTy, true); 45000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 45010c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 45021efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 45030c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.ConstraintVT = OpVT; 45042a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner 45053ff90dc1c8aaa5d9be94cdca8c4a7e71f45da8fdChris Lattner // Compute the constraint code and ConstraintType to use. 45065a09690446a36f94f990db7d18d9b9ac8587888aChris Lattner TLI.ComputeConstraintToUse(OpInfo, OpInfo.CallOperand, &DAG); 45071efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 4508e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Keep track of whether we see an earlyclobber. 4509e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner SawEarlyClobber |= OpInfo.isEarlyClobber; 451009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 45110fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner // If we see a clobber of a register, it is an early clobber. 451269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (!SawEarlyClobber && 451369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.Type == InlineAsm::isClobber && 451469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) { 451509c5d8baa2c068fead50630ec2432a5dd1e7b904Chris Lattner // Note that we want to ignore things that we don't track here, like 451669e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // dirflag, fpsr, flags, etc. 451769e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner std::pair<unsigned, const TargetRegisterClass*> PhysReg = 451869e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner TLI.getRegForInlineAsmConstraint(OpInfo.ConstraintCode, 451969e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner OpInfo.ConstraintVT); 452069e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner if (PhysReg.first || PhysReg.second) { 452169e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner // This is a register we know of. 452269e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner SawEarlyClobber = true; 452369e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 452469e6a8d5a8c486bcdd2c19238171b01d470ba45fChris Lattner } 45250fe71e9bb19ff1781813184e41a8aaaae4dd2908Chris Lattner 452609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If this is a memory input, and if the operand is not indirect, do what we 452709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // need to to provide an address for the memory input. 452809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Memory && 452909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner !OpInfo.isIndirect) { 453009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.Type == InlineAsm::isInput && 453109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner "Can only indirectify direct input operands!"); 453209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 453309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Memory operands really want the address of the value. If we don't have 453409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // an indirect input, put it in the constpool if we can, otherwise spill 453509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // it to a stack slot. 453609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 453709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // If the operand is a float, integer, or vector constant, spill to a 453809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // constant pool entry to get its address. 453909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Value *OpVal = OpInfo.CallOperandVal; 454009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner if (isa<ConstantFP>(OpVal) || isa<ConstantInt>(OpVal) || 454109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner isa<ConstantVector>(OpVal)) { 454209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = DAG.getConstantPool(cast<Constant>(OpVal), 454309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner TLI.getPointerTy()); 454409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } else { 454509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // Otherwise, create a stack slot and emit a store to it before the 454609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // asm. 454709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner const Type *Ty = OpVal->getType(); 4548514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t TySize = TLI.getTargetData()->getABITypeSize(Ty); 454909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty); 455009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner MachineFunction &MF = DAG.getMachineFunction(); 455109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner int SSFI = MF.getFrameInfo()->CreateStackObject(TySize, Align); 4552475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy()); 455309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner Chain = DAG.getStore(Chain, OpInfo.CallOperand, StackSlot, NULL, 0); 455409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperand = StackSlot; 455509e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 455609e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 455709e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // There is no longer a Value* corresponding to this operand. 455809e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.CallOperandVal = 0; 455909e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner // It is now an indirect operand. 456009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner OpInfo.isIndirect = true; 456109e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner } 456209e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner 4563e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // If this constraint is for a specific register, allocate it before 4564e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // anything else. 4565e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Register) 4566e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 45670c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner } 45680c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner ConstraintInfos.clear(); 45690c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 45700c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 4571e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // Second pass - Loop over all of the operands, assigning virtual or physregs 4572e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to registerclass operands. 4573e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 45745c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 4575e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 4576e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // C_Register operands have already been allocated, Other/Memory don't need 4577e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner // to be. 4578e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_RegisterClass) 4579e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner GetRegistersForValue(OpInfo, SawEarlyClobber, OutputRegs, InputRegs); 4580e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner } 4581e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner 45820c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // AsmNodeOperands - The operands for the ISD::INLINEASM node. 4583475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> AsmNodeOperands; 4584475871a144eb604ddaf37503397ba0941442e5fbDan Gohman AsmNodeOperands.push_back(SDValue()); // reserve space for input chain 45850c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner AsmNodeOperands.push_back( 45860c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner DAG.getTargetExternalSymbol(IA->getAsmString().c_str(), MVT::Other)); 45870c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner 45882cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 45890f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // Loop over all of the inputs, copying the operand values into the 45900f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner // appropriate registers and processing the output regs. 4591864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue RetValRegs; 459241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner 45930c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner // IndirectStoresToEmit - The set of stores to emit after the inline asm node. 4594864635ad7b3046d3042311423071152c613961deChris Lattner std::vector<std::pair<RegsForValue, Value*> > IndirectStoresToEmit; 45950f0b7d4927e56e622cf43da0db56f3e0d40b8aafChris Lattner 45960c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner for (unsigned i = 0, e = ConstraintOperands.size(); i != e; ++i) { 45975c80760fdf71659c5bdf45cd85d173df454dfb41Evan Cheng SDISelAsmOperandInfo &OpInfo = ConstraintOperands[i]; 45981efa40f6a4b561cf8f80fe018684236010645cd0Chris Lattner 45990c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner switch (OpInfo.Type) { 46002cc2f66c25d9576743026688fdae5ed402726532Chris Lattner case InlineAsm::isOutput: { 4601c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner if (OpInfo.ConstraintType != TargetLowering::C_RegisterClass && 4602c83994e5d4c75b4dc3d0e2ac52972a4fff816eb6Chris Lattner OpInfo.ConstraintType != TargetLowering::C_Register) { 4603f2f3cd5129a1eef6034ce09314b10f3a1e1abaf6Chris Lattner // Memory output, or 'other' output (e.g. 'X' constraint). 460409e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Memory output must be indirect operand"); 460522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 460622873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner // Add information to the INLINEASM node to know about this output. 460722873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4608c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4609c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 461009e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner AsmNodeOperands.push_back(OpInfo.CallOperand); 461122873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner break; 461222873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner } 461322873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 46142a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner // Otherwise, this is a register or register class output. 461522873462c965a57664c4e375aa6e8bf02c9c6ad8Chris Lattner 4616864635ad7b3046d3042311423071152c613961deChris Lattner // Copy the output from the appropriate register. Find a register that 4617864635ad7b3046d3042311423071152c613961deChris Lattner // we can use. 4618e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (OpInfo.AssignedRegs.Regs.empty()) { 4619a47c6c37034f4e57bc8187e959da4eadb6e24afaDuncan Sands cerr << "Couldn't allocate output reg for constraint '" 46200c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 4621d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner exit(1); 4622d03f1581c8a854fdbe4f5a738e9322341c2bc77fChris Lattner } 46232cc2f66c25d9576743026688fdae5ed402726532Chris Lattner 462441f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // If this is an indirect operand, store through the pointer after the 462541f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // asm. 462641f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner if (OpInfo.isIndirect) { 4627e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner IndirectStoresToEmit.push_back(std::make_pair(OpInfo.AssignedRegs, 46280c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OpInfo.CallOperandVal)); 462941f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner } else { 463041f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // This is the result value of the call. 463141f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner assert(CS.getType() != Type::VoidTy && "Bad inline asm!"); 463241f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner // Concatenate this output onto the outputs list. 463341f6259a4b54d2dc58a4040e942b37f00d306b7bChris Lattner RetValRegs.append(OpInfo.AssignedRegs); 46342cc2f66c25d9576743026688fdae5ed402726532Chris Lattner } 46356656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 46366656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Add information to the INLINEASM node to know that this register is 46376656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // set. 4638e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2 /*REGDEF*/, DAG, 4639e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 46406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 46416656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 46426656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner case InlineAsm::isInput: { 4643475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue InOperandVal = OpInfo.CallOperand; 46443d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 46450c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner if (isdigit(OpInfo.ConstraintCode[0])) { // Matching constraint? 46462223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // If this is required to match an output register we have already set, 46472223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner // just use its register. 46480c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner unsigned OperandNo = atoi(OpInfo.ConstraintCode.c_str()); 46493d81fee8511536962543cbf420fd70ef15ae9c3aChris Lattner 4650c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Scan until we find the definition we already emitted of this operand. 4651c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // When we find it, create a RegsForValue operand. 4652c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned CurOp = 2; // The first operand. 4653c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner for (; OperandNo; --OperandNo) { 4654c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Advance to the next operand. 4655c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4656c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4657a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner assert(((NumOps & 7) == 2 /*REGDEF*/ || 4658a15cf7045efc688b813f4bc7cbc9f17c27114c04Chris Lattner (NumOps & 7) == 4 /*MEM*/) && 4659c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner "Skipped past definitions?"); 4660c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner CurOp += (NumOps>>3)+1; 4661c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 4662c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4663c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner unsigned NumOps = 4664c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner cast<ConstantSDNode>(AsmNodeOperands[CurOp])->getValue(); 4665527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner if ((NumOps & 7) == 2 /*REGDEF*/) { 4666527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Add NumOps>>3 registers to MatchedRegs. 4667527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner RegsForValue MatchedRegs; 466823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman MatchedRegs.TLI = &TLI; 46691fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.ValueVTs.push_back(InOperandVal.getValueType()); 46701fa850bdd26fa51b0e593378a9fc1507154f992dDan Gohman MatchedRegs.RegVTs.push_back(AsmNodeOperands[CurOp+1].getValueType()); 4671527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner for (unsigned i = 0, e = NumOps>>3; i != e; ++i) { 4672527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner unsigned Reg = 4673527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner cast<RegisterSDNode>(AsmNodeOperands[++CurOp])->getReg(); 4674527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.Regs.push_back(Reg); 4675527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } 4676c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 4677527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner // Use the produced MatchedRegs object to 4678b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman MatchedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 4679527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner MatchedRegs.AddInlineAsmOperands(1 /*REGUSE*/, DAG, AsmNodeOperands); 4680527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner break; 4681527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner } else { 4682527fae12c3b58d6151aa1c534c10b55d603b8da1Chris Lattner assert((NumOps & 7) == 4/*MEM*/ && "Unknown matching constraint!"); 4683f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner assert((NumOps >> 3) == 1 && "Unexpected number of operands"); 4684f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner // Add information to the INLINEASM node to know about this input. 4685f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4686f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4687f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner TLI.getPointerTy())); 4688f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner AsmNodeOperands.push_back(AsmNodeOperands[CurOp+1]); 4689f9853bc0d439d89c97979265593287c2ce81acb2Chris Lattner break; 4690c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 469187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner } 469287bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 46932a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner if (OpInfo.ConstraintType == TargetLowering::C_Other) { 46940c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 469544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect other inputs yet!"); 469644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 4697475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> Ops; 469848884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner TLI.LowerAsmOperandForConstraint(InOperandVal, OpInfo.ConstraintCode[0], 469948884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner Ops, DAG); 470048884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner if (Ops.empty()) { 4701832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Invalid operand for inline asm constraint '" 47020c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner << OpInfo.ConstraintCode << "'!\n"; 470353069fbbae2558a3138df24776448791fea3aceeChris Lattner exit(1); 470453069fbbae2558a3138df24776448791fea3aceeChris Lattner } 4705c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner 470687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 470748884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner unsigned ResOpType = 3 /*IMM*/ | (Ops.size() << 3); 4708c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4709c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 471048884cd80b52be1528618f2e9b3425ac24e7b5caChris Lattner AsmNodeOperands.insert(AsmNodeOperands.end(), Ops.begin(), Ops.end()); 471187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner break; 47122a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner } else if (OpInfo.ConstraintType == TargetLowering::C_Memory) { 471309e4b7e1b7d624a3010ace2c23783e77b366fa7eChris Lattner assert(OpInfo.isIndirect && "Operand must be indirect to be a mem!"); 471444b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner assert(InOperandVal.getValueType() == TLI.getPointerTy() && 471544b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Memory operands expect pointer values"); 471644b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner 471787bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Add information to the INLINEASM node to know about this input. 471887bc3bd1213ced06eade93e3267178198d41a381Chris Lattner unsigned ResOpType = 4/*MEM*/ | (1 << 3); 4719c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner AsmNodeOperands.push_back(DAG.getTargetConstant(ResOpType, 4720c90233b836c5d00045bbe7ca3d5d92df4825f5a1Chris Lattner TLI.getPointerTy())); 472187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner AsmNodeOperands.push_back(InOperandVal); 4722c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner break; 47232223aea6ed33e4261d506afdcfbf30ccd8f52bfbChris Lattner } 472487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 47252a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner assert((OpInfo.ConstraintType == TargetLowering::C_RegisterClass || 47262a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner OpInfo.ConstraintType == TargetLowering::C_Register) && 47272a600be22618b09165f3fe2a88bbe2fb71bc478dChris Lattner "Unknown constraint type!"); 47280c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner assert(!OpInfo.isIndirect && 472944b2c5098f5cf766b4eff43d9eb0d8a9a143e7d8Chris Lattner "Don't know how to handle indirect register inputs yet!"); 473087bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 473187bc3bd1213ced06eade93e3267178198d41a381Chris Lattner // Copy the input into the appropriate registers. 4732e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner assert(!OpInfo.AssignedRegs.Regs.empty() && 4733e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner "Couldn't allocate input reg!"); 473487bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4735b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman OpInfo.AssignedRegs.getCopyToRegs(InOperandVal, DAG, Chain, &Flag); 473687bc3bd1213ced06eade93e3267178198d41a381Chris Lattner 4737e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(1/*REGUSE*/, DAG, 4738e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 47396656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 47406656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4741c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner case InlineAsm::isClobber: { 4742c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // Add the clobbered value to the operand list, so that the register 4743c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner // allocator is aware that the physreg got clobbered. 4744e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner if (!OpInfo.AssignedRegs.Regs.empty()) 4745e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner OpInfo.AssignedRegs.AddInlineAsmOperands(2/*REGDEF*/, DAG, 4746e7cf56aeeebed7423402fdf84c5b1aaf6830316eChris Lattner AsmNodeOperands); 47476656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner break; 47486656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4749c3a9f8d31ce93ba384bd2bbdd55c757b06600a15Chris Lattner } 47506656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4751ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4752ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner // Finish up input operands. 4753ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner AsmNodeOperands[0] = Chain; 4754ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif if (Flag.getNode()) AsmNodeOperands.push_back(Flag); 4755ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4756f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner Chain = DAG.getNode(ISD::INLINEASM, 4757f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner DAG.getNodeValueTypes(MVT::Other, MVT::Flag), 2, 4758bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &AsmNodeOperands[0], AsmNodeOperands.size()); 4759ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner Flag = Chain.getValue(1); 4760ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 47616656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // If this asm returns a register value, copy the result from that register 47626656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // and set it as the value of the call. 47633a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner if (!RetValRegs.Regs.empty()) { 4764475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Val = RetValRegs.getCopyFromRegs(DAG, Chain, &Flag); 47653fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 47663fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // If any of the results of the inline asm is a vector, it may have the 47673fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // wrong width/num elts. This can happen for register classes that can 47683fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // contain multiple different value types. The preg or vreg allocated may 47693fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner // not have the same VT as was expected. Convert it to the right type with 47707f32156bb9c017b71971c52fac892fa7b9b06dd2Dan Gohman // bit_convert. 47713fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner if (const StructType *ResSTy = dyn_cast<StructType>(CS.getType())) { 47723fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner for (unsigned i = 0, e = ResSTy->getNumElements(); i != e; ++i) { 4773ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif if (Val.getNode()->getValueType(i).isVector()) 47743fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, 47753fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner TLI.getValueType(ResSTy->getElementType(i)), Val); 47763fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } 47773fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner } else { 477883ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands if (Val.getValueType().isVector()) 47793fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val = DAG.getNode(ISD::BIT_CONVERT, TLI.getValueType(CS.getType()), 47803fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner Val); 47813a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 47823fb2968f2febbcd8e05270270858b6f2afd4b342Chris Lattner 4783fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands setValue(CS.getInstruction(), Val); 47843a508c94a6c6f124e8b0549358ce76deb92ab662Chris Lattner } 47856656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 4786475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<std::pair<SDValue, Value*> > StoresToEmit; 47876656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner 47886656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Process indirect outputs, first output all of the flagged copies out of 47896656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // physregs. 47906656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = IndirectStoresToEmit.size(); i != e; ++i) { 4791864635ad7b3046d3042311423071152c613961deChris Lattner RegsForValue &OutRegs = IndirectStoresToEmit[i].first; 47926656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner Value *Ptr = IndirectStoresToEmit[i].second; 4793475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OutVal = OutRegs.getCopyFromRegs(DAG, Chain, &Flag); 4794864635ad7b3046d3042311423071152c613961deChris Lattner StoresToEmit.push_back(std::make_pair(OutVal, Ptr)); 47956656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner } 4796ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 47976656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner // Emit the non-flagged stores from the physregs. 4798475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 8> OutChains; 47996656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner for (unsigned i = 0, e = StoresToEmit.size(); i != e; ++i) 48000c58340aead6880876076ee4e3abf3aca92a2647Chris Lattner OutChains.push_back(DAG.getStore(Chain, StoresToEmit[i].first, 48016656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner getValue(StoresToEmit[i].second), 48028b2794aeff151be8cdbd44786c1d0f94f8f2e427Evan Cheng StoresToEmit[i].second, 0)); 48036656dd1a7888e6dabc82ebce734734127b1df6a7Chris Lattner if (!OutChains.empty()) 4804bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner Chain = DAG.getNode(ISD::TokenFactor, MVT::Other, 4805bd564bfc63163e31f320c3da9749db70992dc35eChris Lattner &OutChains[0], OutChains.size()); 4806ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner DAG.setRoot(Chain); 4807ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner} 4808ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 4809ce7518ce92f45568dc7d4cbb863284afb962fec5Chris Lattner 48101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitMalloc(MallocInst &I) { 4811475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = getValue(I.getOperand(0)); 48121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 481383ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 481468cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner 48158e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands if (IntPtr.bitsLT(Src.getValueType())) 481668cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::TRUNCATE, IntPtr, Src); 48178e4eb09b1e3571965f49edcdfb56b1375b1b7551Duncan Sands else if (IntPtr.bitsGT(Src.getValueType())) 481868cd65ea689907fb8a4aa80d72d182921e94607fChris Lattner Src = DAG.getNode(ISD::ZERO_EXTEND, IntPtr, Src); 48191c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48201c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Scale the source by the type size. 4821514ab348fddcdffa8367685dc608b2f8d5de986dDuncan Sands uint64_t ElementSize = TD->getABITypeSize(I.getType()->getElementType()); 48221c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner Src = DAG.getNode(ISD::MUL, Src.getValueType(), 48230bd4893a0726889b942405262e53d06cf3fe3be8Chris Lattner Src, DAG.getIntPtrConstant(ElementSize)); 48241c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 482547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 482647857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 482747857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = Src; 482847857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 482947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 4830cf5734dddd66af9388a171b44996505ede47feedChris Lattner 4831475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 483200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), I.getType(), false, false, false, CallingConv::C, 483300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands true, DAG.getExternalSymbol("malloc", IntPtr), Args, DAG); 4834cf5734dddd66af9388a171b44996505ede47feedChris Lattner setValue(&I, Result.first); // Pointers always fit in registers 4835cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 48361c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitFree(FreeInst &I) { 483947857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListTy Args; 484047857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer TargetLowering::ArgListEntry Entry; 484147857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Node = getValue(I.getOperand(0)); 484247857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Entry.Ty = TLI.getTargetData()->getIntPtrType(); 484347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer Args.push_back(Entry); 484483ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT IntPtr = TLI.getPointerTy(); 4845475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::pair<SDValue,SDValue> Result = 484600fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands TLI.LowerCallTo(getRoot(), Type::VoidTy, false, false, false, 484700fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands CallingConv::C, true, 4848cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.getExternalSymbol("free", IntPtr), Args, DAG); 4849cf5734dddd66af9388a171b44996505ede47feedChris Lattner DAG.setRoot(Result.second); 48501c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4852ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// EmitInstrWithCustomInserter - This method should be implemented by targets 4853ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng// that mark instructions with the 'usesCustomDAGSchedInserter' flag. These 4854025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// instructions are special in various ways, which require special support to 4855025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// insert. The specified MachineInstr is created but not inserted into any 4856025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner// basic blocks, and the scheduler passes ownership of it to this method. 4857ff9b373e8f5006c629af81e2619778b4c4f5249eEvan ChengMachineBasicBlock *TargetLowering::EmitInstrWithCustomInserter(MachineInstr *MI, 4858025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner MachineBasicBlock *MBB) { 4859832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "If a target marks an instruction with " 4860832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling << "'usesCustomDAGSchedInserter', it must implement " 4861ff9b373e8f5006c629af81e2619778b4c4f5249eEvan Cheng << "TargetLowering::EmitInstrWithCustomInserter!\n"; 4862025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner abort(); 4863025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner return 0; 4864025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner} 4865025c39bf36b6bc2f35a5544338de6cf96fa511a9Chris Lattner 486639ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattnervoid SelectionDAGLowering::visitVAStart(CallInst &I) { 4867acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VASTART, MVT::Other, getRoot(), 4868acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4869acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 487039ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner} 487139ae3622791986a0232f7e4797b633f8fa9e54d2Chris Lattner 48721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAArg(VAArgInst &I) { 4873475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue V = DAG.getVAArg(TLI.getValueType(I.getType()), getRoot(), 4874acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(0)), 4875acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(0))); 4876acc398c195a697795bff3245943d104eb19192b9Nate Begeman setValue(&I, V); 4877acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(V.getValue(1)); 48781c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48791c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48801c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVAEnd(CallInst &I) { 4881acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VAEND, MVT::Other, getRoot(), 4882acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4883acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)))); 48841c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48851c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 48861c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnervoid SelectionDAGLowering::visitVACopy(CallInst &I) { 4887acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.setRoot(DAG.getNode(ISD::VACOPY, MVT::Other, getRoot(), 4888acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(1)), 4889acc398c195a697795bff3245943d104eb19192b9Nate Begeman getValue(I.getOperand(2)), 4890acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(1)), 4891acc398c195a697795bff3245943d104eb19192b9Nate Begeman DAG.getSrcValue(I.getOperand(2)))); 48921c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 48931c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 4894fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// TargetLowering::LowerArguments - This is the default LowerArguments 4895fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner/// implementation, which just inserts a FORMAL_ARGUMENTS node. FIXME: When all 4896f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// targets are migrated to using FORMAL_ARGUMENTS, this hook should be 4897f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// integrated into SDISel. 4898a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohmanvoid TargetLowering::LowerArguments(Function &F, SelectionDAG &DAG, 4899475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVectorImpl<SDValue> &ArgValues) { 4900fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add CC# and isVararg as operands to the FORMAL_ARGUMENTS node. 4901475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 3+16> Ops; 49028c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner Ops.push_back(DAG.getRoot()); 4903fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.getCallingConv(), getPointerTy())); 4904fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner Ops.push_back(DAG.getConstant(F.isVarArg(), getPointerTy())); 4905fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4906fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Add one result value for each formal argument. 4907a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman SmallVector<MVT, 16> RetVals; 49086aa279dc8b5a05499b2cd158f8187d7225adc4f4Anton Korobeynikov unsigned j = 1; 4909ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); 4910ac2b2cf88c9331bf44e802f6d31805c40a56af0fAnton Korobeynikov I != E; ++I, ++j) { 4911f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4912f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4913f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4914f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 4915f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 4916f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 4917f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 4918f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 4919f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 4920f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 4921f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ZExt)) 4922f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 4923f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::SExt)) 4924f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 4925f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::InReg)) 4926f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 4927f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::StructRet)) 4928f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 4929f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::ByVal)) { 4930f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 4931f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(I->getType()); 4932f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 4933f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 4934f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 4935f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should be passed from FE. BE will guess if 4936f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // this info is not there but there are cases it cannot get right. 4937f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.getParamAlignment(j)) 4938f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = F.getParamAlignment(j); 4939f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 4940f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 4941f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4942f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(j, ParamAttr::Nest)) 4943f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 4944f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 4945b988baccc229ef3e175905c999245d5544a0d384Duncan Sands 4946f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT RegisterVT = getRegisterType(VT); 4947f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumRegs = getNumRegisters(VT); 4948f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) { 4949f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman RetVals.push_back(RegisterVT); 4950f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 4951f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumRegs > 1 && i == 0) 4952f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 4953f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 4954f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i > 0) 4955f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 4956f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 4957f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 4958b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman } 4959fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 49603b0d286d0085fbf8314d9f5510c2f78558ab5deaEvan Cheng 49618c0c10c2b9fef21dcbabac81fffa32f4407a0b7fChris Lattner RetVals.push_back(MVT::Other); 4962fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4963fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Create the node. 4964f9f37fc52c444e34bad7846729ae5481a65e0a53Chris Lattner SDNode *Result = DAG.getNode(ISD::FORMAL_ARGUMENTS, 496586ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner DAG.getVTList(&RetVals[0], RetVals.size()), 4966ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif &Ops[0], Ops.size()).getNode(); 496786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 496886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // Prelower FORMAL_ARGUMENTS. This isn't required for functionality, but 496986ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // allows exposing the loads that may be part of the argument access to the 497086ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // first DAGCombiner pass. 4971475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue TmpRes = LowerOperation(SDValue(Result, 0), DAG); 497286ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 497386ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // The number of results should match up, except that the lowered one may have 497486ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner // an extra flag result. 4975ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif assert((Result->getNumValues() == TmpRes.getNode()->getNumValues() || 4976ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif (Result->getNumValues()+1 == TmpRes.getNode()->getNumValues() && 497786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner TmpRes.getValue(Result->getNumValues()).getValueType() == MVT::Flag)) 497886ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner && "Lowering produced unexpected number of results!"); 49792dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman 49802dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman // The FORMAL_ARGUMENTS node itself is likely no longer needed. 4981ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif if (Result != TmpRes.getNode() && Result->use_empty()) { 49822dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman HandleSDNode Dummy(DAG.getRoot()); 49832dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman DAG.RemoveDeadNode(Result); 49842dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman } 49852dbc167294c1a7a4cd7a43f86bff104afd6110e5Dan Gohman 4986ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Result = TmpRes.getNode(); 498786ca3cacc5a56e862c8258ac9c9ee1e37598ebd8Chris Lattner 498827a70be55f8b63181598d144d034b396402be66eDan Gohman unsigned NumArgRegs = Result->getNumValues() - 1; 4989475871a144eb604ddaf37503397ba0941442e5fbDan Gohman DAG.setRoot(SDValue(Result, NumArgRegs)); 4990fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 4991fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner // Set up the return result vector. 4992fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner unsigned i = 0; 499347857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer unsigned Idx = 1; 499447857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer for (Function::arg_iterator I = F.arg_begin(), E = F.arg_end(); I != E; 499547857812e29324a9d1560796a05b53d3a9217fd9Reid Spencer ++I, ++Idx) { 4996f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 4997f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, I->getType(), ValueVTs); 4998f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 4999f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 5000f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 5001f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 5002f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5003f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 5004475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 5005f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned j = 0; j != NumParts; ++j) 5006475871a144eb604ddaf37503397ba0941442e5fbDan Gohman Parts[j] = SDValue(Result, i++); 5007f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5008f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType AssertOp = ISD::DELETED_NODE; 5009f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (F.paramHasAttr(Idx, ParamAttr::SExt)) 5010f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertSext; 5011f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (F.paramHasAttr(Idx, ParamAttr::ZExt)) 5012f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AssertOp = ISD::AssertZext; 5013f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5014a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman ArgValues.push_back(getCopyFromParts(DAG, &Parts[0], NumParts, PartVT, VT, 5015a44b674a42b6ca57128c4eb5a358298ed3bb1406Dan Gohman AssertOp)); 5016f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 5017fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner } 501827a70be55f8b63181598d144d034b396402be66eDan Gohman assert(i == NumArgRegs && "Argument register count mismatch!"); 5019fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner} 5020fdfded55888e35b76bb70231a5bb2f60877c2f6aChris Lattner 5021f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 5022f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// TargetLowering::LowerCallTo - This is the default LowerCallTo 5023f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// implementation, which just inserts an ISD::CALL node, which is later custom 5024f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// lowered by the target to something concrete. FIXME: When all targets are 5025f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner/// migrated to using ISD::CALL, this hook should be integrated into SDISel. 5026475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstd::pair<SDValue, SDValue> 5027475871a144eb604ddaf37503397ba0941442e5fbDan GohmanTargetLowering::LowerCallTo(SDValue Chain, const Type *RetTy, 502800fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands bool RetSExt, bool RetZExt, bool isVarArg, 502900fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands unsigned CallingConv, bool isTailCall, 5030475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Callee, 5031f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner ArgListTy &Args, SelectionDAG &DAG) { 5032475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5033f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Chain); // Op#0 - Chain 5034f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(CallingConv, getPointerTy())); // Op#1 - CC 5035f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isVarArg, getPointerTy())); // Op#2 - VarArg 5036f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(DAG.getConstant(isTailCall, getPointerTy())); // Op#3 - Tail 5037f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner Ops.push_back(Callee); 5038f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 5039f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner // Handle all of the outgoing arguments. 5040f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner for (unsigned i = 0, e = Args.size(); i != e; ++i) { 5041f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 5042f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(*this, Args[i].Ty, ValueVTs); 5043f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned Value = 0, NumValues = ValueVTs.size(); 5044f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Value != NumValues; ++Value) { 5045f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT VT = ValueVTs[Value]; 5046f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ArgTy = VT.getTypeForMVT(); 5047ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif SDValue Op = SDValue(Args[i].Node.getNode(), Args[i].Node.getResNo() + Value); 5048f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy Flags; 5049f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned OriginalAlignment = 5050f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getTargetData()->getABITypeAlignment(ArgTy); 5051f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5052f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isZExt) 5053f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setZExt(); 5054f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 5055f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSExt(); 5056f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isInReg) 5057f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setInReg(); 5058f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSRet) 5059f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setSRet(); 5060f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isByVal) { 5061f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByVal(); 5062f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const PointerType *Ty = cast<PointerType>(Args[i].Ty); 5063f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman const Type *ElementTy = Ty->getElementType(); 5064f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameAlign = getByValTypeAlignment(ElementTy); 5065f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned FrameSize = getTargetData()->getABITypeSize(ElementTy); 5066f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // For ByVal, alignment should come from FE. BE will guess if this 5067f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // info is not there but there are cases it cannot get right. 5068f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].Alignment) 5069f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman FrameAlign = Args[i].Alignment; 5070f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValAlign(FrameAlign); 5071f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setByValSize(FrameSize); 5072f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 5073f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isNest) 5074f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setNest(); 5075f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Flags.setOrigAlign(OriginalAlignment); 5076f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5077f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MVT PartVT = getRegisterType(VT); 5078f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumParts = getNumRegisters(VT); 5079475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Parts(NumParts); 5080f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::NodeType ExtendKind = ISD::ANY_EXTEND; 5081f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5082f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (Args[i].isSExt) 5083f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::SIGN_EXTEND; 5084f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (Args[i].isZExt) 5085f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ExtendKind = ISD::ZERO_EXTEND; 5086f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5087f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman getCopyToParts(DAG, Op, &Parts[0], NumParts, PartVT, ExtendKind); 5088f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5089f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman for (unsigned i = 0; i != NumParts; ++i) { 5090f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman // if it isn't first piece, alignment must be 1 5091f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ISD::ArgFlagsTy MyFlags = Flags; 5092f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman if (NumParts > 1 && i == 0) 5093f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setSplit(); 5094f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman else if (i != 0) 5095f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman MyFlags.setOrigAlign(1); 5096f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman 5097f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(Parts[i]); 5098f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman Ops.push_back(DAG.getArgFlags(MyFlags)); 5099f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 510027a70be55f8b63181598d144d034b396402be66eDan Gohman } 5101f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 5102f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 5103ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman // Figure out the result value types. We start by making a list of 510423ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // the potentially illegal return value types. 510583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> LoweredRetTys; 510683ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands SmallVector<MVT, 4> RetTys; 510723ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman ComputeValueVTs(*this, RetTy, RetTys); 5108ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman 510923ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman // Then we translate that to a list of legal types. 511023ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 511183ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 511283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 5113ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 5114ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (unsigned i = 0; i != NumRegs; ++i) 5115ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(RegisterVT); 5116ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 5117f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 5118ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.push_back(MVT::Other); // Always has a chain. 5119f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 5120b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Create the CALL node. 5121475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Res = DAG.getNode(ISD::CALL, 5122ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman DAG.getVTList(&LoweredRetTys[0], 5123ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman LoweredRetTys.size()), 5124be384162c68641233deba8702666af51bdfd4b83Chris Lattner &Ops[0], Ops.size()); 5125ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Chain = Res.getValue(LoweredRetTys.size() - 1); 5126b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 5127b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman // Gather up the call result into a single value. 5128b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman if (RetTy != Type::VoidTy) { 512900fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands ISD::NodeType AssertOp = ISD::DELETED_NODE; 513000fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 513100fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands if (RetSExt) 513200fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands AssertOp = ISD::AssertSext; 513300fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands else if (RetZExt) 5134b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman AssertOp = ISD::AssertZext; 513500fee65fd21f9615d1a604b8b7d42cd16a3f6b47Duncan Sands 5136475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> ReturnValues; 5137ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNo = 0; 513823ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman for (unsigned I = 0, E = RetTys.size(); I != E; ++I) { 513983ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = RetTys[I]; 514083ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT RegisterVT = getRegisterType(VT); 5141ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned NumRegs = getNumRegisters(VT); 5142ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman unsigned RegNoEnd = NumRegs + RegNo; 5143475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 4> Results; 5144ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman for (; RegNo != RegNoEnd; ++RegNo) 5145ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman Results.push_back(Res.getValue(RegNo)); 5146475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue ReturnValue = 5147ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman getCopyFromParts(DAG, &Results[0], NumRegs, RegisterVT, VT, 5148ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman AssertOp); 5149ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman ReturnValues.push_back(ReturnValue); 5150ef5d194aaa7d09937759447bceca0ff80bee1261Dan Gohman } 5151f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands Res = DAG.getMergeValues(DAG.getVTList(&RetTys[0], RetTys.size()), 5152f9516208e57364ab1e7d8748af1f59a2ea5fb572Duncan Sands &ReturnValues[0], ReturnValues.size()); 5153f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner } 5154b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 5155b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman return std::make_pair(Res, Chain); 5156f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner} 5157f4ec817299a4187044a6162c2f520772b3ad69a0Chris Lattner 5158475871a144eb604ddaf37503397ba0941442e5fbDan GohmanSDValue TargetLowering::LowerOperation(SDValue Op, SelectionDAG &DAG) { 5159171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner assert(0 && "LowerOperation not implemented for this target!"); 5160171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner abort(); 5161475871a144eb604ddaf37503397ba0941442e5fbDan Gohman return SDValue(); 5162171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner} 5163171453a284b097f1ee89fb87ff495c3a6c7b6297Chris Lattner 51640aed7840ec8cc85f91b4aa6e69318bba0cbd1f03Nate Begeman 51657041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 51667041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner// SelectionDAGISel code 51677041ee35adecb864e3e8df490aa73b0605fbfb5aChris Lattner//===----------------------------------------------------------------------===// 51681c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51697c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::SelectionDAGISel(TargetLowering &tli, bool fast) : 51707c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FunctionPass((intptr_t)&ID), TLI(tli), 51717c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo(new FunctionLoweringInfo(TLI)), 51727c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG(new SelectionDAG(TLI, *FuncInfo)), 51737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL(new SelectionDAGLowering(*CurDAG, TLI, *FuncInfo)), 51747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman GFI(), 51757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Fast(fast), 51767c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DAGSize(0) 51777c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman{} 51787c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 51797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::~SelectionDAGISel() { 51807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete SDL; 51817c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete CurDAG; 51827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman delete FuncInfo; 51837c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman} 51847c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 518583ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sandsunsigned SelectionDAGISel::MakeReg(MVT VT) { 518684bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner return RegInfo->createVirtualRegister(TLI.getRegClassFor(VT)); 51871c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 51881c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5189495a0b51915eb763576874f29192820b731edc22Chris Lattnervoid SelectionDAGISel::getAnalysisUsage(AnalysisUsage &AU) const { 5190c7c3f110eda0ff8040e4bd99e38d3112b910810fJim Laskey AU.addRequired<AliasAnalysis>(); 51915eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen AU.addRequired<GCModuleInfo>(); 5192c8d288f8fa9e46199a29e1954550c980f184bd1cChris Lattner AU.setPreservesAll(); 5193495a0b51915eb763576874f29192820b731edc22Chris Lattner} 51941c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 51951c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattnerbool SelectionDAGISel::runOnFunction(Function &Fn) { 51965f43f92c69aae9837064cf08291db1b36a82789fDan Gohman // Get alias analysis for load/store combining. 51975f43f92c69aae9837064cf08291db1b36a82789fDan Gohman AA = &getAnalysis<AliasAnalysis>(); 51985f43f92c69aae9837064cf08291db1b36a82789fDan Gohman 51991c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner MachineFunction &MF = MachineFunction::construct(&Fn, TLI.getTargetMachine()); 52005eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (MF.getFunction()->hasGC()) 52015eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = &getAnalysis<GCModuleInfo>().getFunctionInfo(*MF.getFunction()); 5202ce2247755e56f99a2377b64a1a9d393726582b85Gordon Henriksen else 52035eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen GFI = 0; 520484bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner RegInfo = &MF.getRegInfo(); 5205832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "\n\n\n=== " << Fn.getName() << "\n"; 52061c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52077c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->set(Fn, MF); 52087c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->init(MF, getAnalysisToUpdate<MachineModuleInfo>()); 52097c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->init(GFI, *AA); 52101c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52111532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) 52121532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen if (InvokeInst *Invoke = dyn_cast<InvokeInst>(I->getTerminator())) 52131532f3ddd77c362dd5f613af06b4de636e3c5b0eDale Johannesen // Mark landing pad. 52147c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->MBBMap[Invoke->getSuccessor(1)]->setIsLandingPad(); 52159fac0b5ff24e733072bdde68c7f34590c1892922Duncan Sands 52167c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SelectAllBasicBlocks(Fn, MF); 5217edf128a7fa90f2b0b7ee24741a04a7ae1ecd6f7eMisha Brukman 5218ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng // Add function live-ins to entry block live-in set. 5219ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BasicBlock *EntryBB = &Fn.getEntryBlock(); 52207c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = FuncInfo->MBBMap[EntryBB]; 522184bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner if (!RegInfo->livein_empty()) 522284bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner for (MachineRegisterInfo::livein_iterator I = RegInfo->livein_begin(), 522384bc5427d6883f73cfeae3da640acd011d35c006Chris Lattner E = RegInfo->livein_end(); I != E; ++I) 5224ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng BB->addLiveIn(I->first); 5225ad2070c667ebabf1650be63e6b3e0b411da86918Evan Cheng 5226f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 52277c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman assert(FuncInfo->CatchInfoFound.size() == FuncInfo->CatchInfoLost.size() && 5228f40708223e409a152834b1553c6883ff2035b957Duncan Sands "Not all catch info was assigned to a landing pad!"); 5229f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 5230f40708223e409a152834b1553c6883ff2035b957Duncan Sands 52317c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->clear(); 52327c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 52331c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner return true; 52341c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 52351c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 52366833b0601bdd53957db049b13dfa2e6a9e56f65fChris Lattnervoid SelectionDAGLowering::CopyValueToVirtualRegister(Value *V, unsigned Reg) { 5237475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Op = getValue(V); 523818c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner assert((Op.getOpcode() != ISD::CopyFromReg || 5239d5d0f9bd20d9df07d6b4d41b7e8ed6d33b6a649dChris Lattner cast<RegisterSDNode>(Op.getOperand(1))->getReg() != Reg) && 524018c2f13e0f9d0e5d6227cf6d1881e9ee3d1b6109Chris Lattner "Copy from a reg to the same reg!"); 524186e1ebf9bbde7408a1d7859ea207981457e11cc2Dan Gohman assert(!TargetRegisterInfo::isPhysicalRegister(Reg) && "Is a physreg"); 5242b6f5b00c3bad3415d3f2ee1a6d5ee5a6f66a4540Dan Gohman 524323ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RegsForValue RFV(TLI, Reg, V->getType()); 5244475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = DAG.getEntryNode(); 524523ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman RFV.getCopyToRegs(Op, DAG, Chain, 0); 524623ce502cb7d9d06a1786d276a10be42e65759ecaDan Gohman PendingExports.push_back(Chain); 52471c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 52481c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5249068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattnervoid SelectionDAGISel:: 52507c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanLowerArguments(BasicBlock *LLVMBB) { 52511c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // If this is the entry block, emit arguments. 525215699fc5ed0378205f9705d35d019d9ff0cf200dEvan Cheng Function &F = *LLVMBB->getParent(); 52537c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDValue OldRoot = SDL->DAG.getRoot(); 5254475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 16> Args; 52557c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman TLI.LowerArguments(F, SDL->DAG, Args); 5256bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 5257bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner unsigned a = 0; 5258bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner for (Function::arg_iterator AI = F.arg_begin(), E = F.arg_end(); 5259f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman AI != E; ++AI) { 5260f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman SmallVector<MVT, 4> ValueVTs; 5261f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman ComputeValueVTs(TLI, AI->getType(), ValueVTs); 5262f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman unsigned NumValues = ValueVTs.size(); 5263bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner if (!AI->use_empty()) { 52647c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setValue(AI, SDL->DAG.getMergeValues(&Args[a], NumValues)); 5265bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // If this argument is live outside of the entry block, insert a copy from 5266bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // whereever we got it to the vreg that other BB's will reference it as. 52677c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DenseMap<const Value*, unsigned>::iterator VMI=FuncInfo->ValueMap.find(AI); 52687c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (VMI != FuncInfo->ValueMap.end()) { 52697c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->CopyValueToVirtualRegister(AI, VMI->second); 5270bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner } 52710afa8e348eab21d3e09ae3240544886d61879266Chris Lattner } 5272f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman a += NumValues; 5273f5025cfa683b4cfb9f04b1e63dac7364a5dbf900Dan Gohman } 5274bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner 5275bf209489ad3f7a38ce6b2159b22d8727500e60c2Chris Lattner // Finally, if the target has anything special to do, allow it to do so. 5276966454129dc62260df1f438f0243f6877dcd185cChris Lattner // FIXME: this should insert code into the DAG! 52777c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman EmitFunctionEntryCode(F, SDL->DAG.getMachineFunction()); 5278068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner} 5279068a81e9fca511b9a3b3a0f28a8988a57f994652Chris Lattner 5280f40708223e409a152834b1553c6883ff2035b957Duncan Sandsstatic void copyCatchInfo(BasicBlock *SrcBB, BasicBlock *DestBB, 5281f40708223e409a152834b1553c6883ff2035b957Duncan Sands MachineModuleInfo *MMI, FunctionLoweringInfo &FLI) { 5282f40708223e409a152834b1553c6883ff2035b957Duncan Sands for (BasicBlock::iterator I = SrcBB->begin(), E = --SrcBB->end(); I != E; ++I) 5283cf26d7ccac1ad052b750edec36b13bc9ea8f70d7Duncan Sands if (isSelector(I)) { 5284f40708223e409a152834b1553c6883ff2035b957Duncan Sands // Apply the catch info to DestBB. 5285f40708223e409a152834b1553c6883ff2035b957Duncan Sands addCatchInfo(cast<CallInst>(*I), MMI, FLI.MBBMap[DestBB]); 5286f40708223e409a152834b1553c6883ff2035b957Duncan Sands#ifndef NDEBUG 5287560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands if (!FLI.MBBMap[SrcBB]->isLandingPad()) 5288560a737e073788463b9275c5e92ebc12f0ea62a2Duncan Sands FLI.CatchInfoFound.insert(I); 5289f40708223e409a152834b1553c6883ff2035b957Duncan Sands#endif 5290f40708223e409a152834b1553c6883ff2035b957Duncan Sands } 5291f40708223e409a152834b1553c6883ff2035b957Duncan Sands} 5292f40708223e409a152834b1553c6883ff2035b957Duncan Sands 529330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsFixedFrameObjectWithPosOffset - Check if object is a fixed frame object and 529430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// whether object offset >= 0. 529530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighoferstatic bool 5296475871a144eb604ddaf37503397ba0941442e5fbDan GohmanIsFixedFrameObjectWithPosOffset(MachineFrameInfo * MFI, SDValue Op) { 529730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isa<FrameIndexSDNode>(Op)) return false; 529830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 529930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer FrameIndexSDNode * FrameIdxNode = dyn_cast<FrameIndexSDNode>(Op); 530030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer int FrameIdx = FrameIdxNode->getIndex(); 530130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return MFI->isFixedObjectIndex(FrameIdx) && 530230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MFI->getObjectOffset(FrameIdx) >= 0; 530330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 530430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 530530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// IsPossiblyOverwrittenArgumentOfTailCall - Check if the operand could 530630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// possibly be overwritten when lowering the outgoing arguments in a tail 530730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// call. Currently the implementation of this call is very conservative and 530830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// assumes all arguments sourcing from FORMAL_ARGUMENTS or a CopyFromReg with 530930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer/// virtual registers would be overwritten by direct lowering. 5310475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanstatic bool IsPossiblyOverwrittenArgumentOfTailCall(SDValue Op, 531130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo * MFI) { 531230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer RegisterSDNode * OpReg = NULL; 531330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Op.getOpcode() == ISD::FORMAL_ARGUMENTS || 531430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode()== ISD::CopyFromReg && 531530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg = dyn_cast<RegisterSDNode>(Op.getOperand(1))) && 531630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (OpReg->getReg() >= TargetRegisterInfo::FirstVirtualRegister)) || 531730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::LOAD && 531830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(1))) || 531930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer (Op.getOpcode() == ISD::MERGE_VALUES && 532099a6cb92d173c142073416c81efe6d3daeb80b49Gabor Greif Op.getOperand(Op.getResNo()).getOpcode() == ISD::LOAD && 532199a6cb92d173c142073416c81efe6d3daeb80b49Gabor Greif IsFixedFrameObjectWithPosOffset(MFI, Op.getOperand(Op.getResNo()). 532230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getOperand(1)))) 532330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return true; 532430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer return false; 532530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer} 532630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer 5327c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer/// CheckDAGForTailCallsAndFixThem - This Function looks for CALL nodes in the 532848abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer/// DAG and fixes their tailcall attribute operand. 5329c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighoferstatic void CheckDAGForTailCallsAndFixThem(SelectionDAG &DAG, 5330c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer TargetLowering& TLI) { 5331c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer SDNode * Ret = NULL; 5332475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Terminator = DAG.getRoot(); 5333c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5334c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Find RET node. 5335c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (Terminator.getOpcode() == ISD::RET) { 5336ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Ret = Terminator.getNode(); 5337c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5338c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5339c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Fix tail call attribute of CALL nodes. 5340c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer for (SelectionDAG::allnodes_iterator BE = DAG.allnodes_begin(), 53410e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman BI = DAG.allnodes_end(); BI != BE; ) { 53420e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman --BI; 5343c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (BI->getOpcode() == ISD::CALL) { 5344475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OpRet(Ret, 0); 5345475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue OpCall(BI, 0); 5346c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer bool isMarkedTailCall = 5347c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer cast<ConstantSDNode>(OpCall.getOperand(3))->getValue() != 0; 5348c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // If CALL node has tail call attribute set to true and the call is not 5349c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // eligible (no RET or the target rejects) the attribute is fixed to 535048abc5cf6ba6d53513034aa8c68b0a9abd748190Arnold Schwaighofer // false. The TargetLowering::IsEligibleForTailCallOptimization function 5351c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // must correctly identify tail call optimizable calls. 535230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isMarkedTailCall) continue; 535330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (Ret==NULL || 535430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer !TLI.IsEligibleForTailCallOptimization(OpCall, OpRet, DAG)) { 535530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Not eligible. Mark CALL node as non tail call. 5356475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5357c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer unsigned idx=0; 5358ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif for(SDNode::op_iterator I =OpCall.getNode()->op_begin(), 5359ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif E = OpCall.getNode()->op_end(); I != E; I++, idx++) { 5360c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer if (idx!=3) 5361c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(*I); 536230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer else 5363c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer Ops.push_back(DAG.getConstant(false, TLI.getPointerTy())); 5364c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5365c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 536630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } else { 536730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Look for tail call clobbered arguments. Emit a series of 536830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // copyto/copyfrom virtual register nodes to protect them. 5369475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SmallVector<SDValue, 32> Ops; 5370475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Chain = OpCall.getOperand(0), InFlag; 537130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned idx=0; 5372ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif for(SDNode::op_iterator I = OpCall.getNode()->op_begin(), 5373ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif E = OpCall.getNode()->op_end(); I != E; I++, idx++) { 5374475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Arg = *I; 537530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (idx > 4 && (idx % 2)) { 537630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer bool isByVal = cast<ARG_FLAGSSDNode>(OpCall.getOperand(idx+1))-> 537730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer getArgFlags().isByVal(); 537830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFunction &MF = DAG.getMachineFunction(); 537930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer MachineFrameInfo *MFI = MF.getFrameInfo(); 538030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer if (!isByVal && 538130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer IsPossiblyOverwrittenArgumentOfTailCall(Arg, MFI)) { 538283ec4b6711980242ef3c55a4fa36b2d7a39c1bfbDuncan Sands MVT VT = Arg.getValueType(); 538330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer unsigned VReg = MF.getRegInfo(). 538430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer createVirtualRegister(TLI.getRegClassFor(VT)); 538530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = DAG.getCopyToReg(Chain, VReg, Arg, InFlag); 538630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Chain.getValue(1); 538730e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Arg = DAG.getCopyFromReg(Chain, VReg, VT, InFlag); 538830e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Chain = Arg.getValue(1); 538930e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer InFlag = Arg.getValue(2); 539030e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 539130e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 539230e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops.push_back(Arg); 539330e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer } 539430e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer // Link in chain of CopyTo/CopyFromReg. 539530e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer Ops[0] = Chain; 539630e62c098b5841259f8026df1c5c45c7c1182a38Arnold Schwaighofer DAG.UpdateNodeOperands(OpCall, Ops.begin(), Ops.size()); 5397c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5398c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5399c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer } 5400c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer} 5401c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5402f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// Handle PHI nodes in successor blocks. Emit code into the SelectionDAG to 5403f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// ensure constants are generated when needed. Remember the virtual registers 5404f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// that need to be added to the Machine PHI nodes as input. We cannot just 5405f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// directly add them, because expansion might result in multiple MBB's for one 5406f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// BB. As such, the start of the BB might correspond to a different MBB than 5407f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// the end. 5408f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman/// 5409f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid 54107c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::HandlePHINodesInSuccessorBlocks(BasicBlock *LLVMBB) { 54118c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner TerminatorInst *TI = LLVMBB->getTerminator(); 54121c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 54137c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SmallPtrSet<MachineBasicBlock *, 4> SuccsHandled; 54147c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 5415532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // Check successor nodes' PHI nodes that expect a constant to be available 5416532dc2e1f2473b16b48566c1cbc9eefe94a4e58eDan Gohman // from this block. 54171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (unsigned succ = 0, e = TI->getNumSuccessors(); succ != e; ++succ) { 54181c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner BasicBlock *SuccBB = TI->getSuccessor(succ); 5419d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner if (!isa<PHINode>(SuccBB->begin())) continue; 54207c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineBasicBlock *SuccMBB = FuncInfo->MBBMap[SuccBB]; 5421d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 54228c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // If this terminator has multiple identical successors (common for 54238c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // switches), only handle each succ once. 54247c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (!SuccsHandled.insert(SuccMBB)) continue; 54258c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 54268c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner MachineBasicBlock::iterator MBBI = SuccMBB->begin(); 54271c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner PHINode *PN; 54281c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 54291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // At this point we know that there is a 1-1 correspondence between LLVM PHI 54301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // nodes and Machine PHI nodes, but the incoming operands have not been 54311c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // emitted yet. 54321c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner for (BasicBlock::iterator I = SuccBB->begin(); 54338c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner (PN = dyn_cast<PHINode>(I)); ++I) { 54348c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Ignore dead phi's. 54358c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (PN->use_empty()) continue; 54367c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 54378c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner unsigned Reg; 54388c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Value *PHIOp = PN->getIncomingValueForBlock(LLVMBB); 54397c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 54408c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Constant *C = dyn_cast<Constant>(PHIOp)) { 54417c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman unsigned &RegOut = SDL->ConstantsOut[C]; 54428c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (RegOut == 0) { 54437c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman RegOut = FuncInfo->CreateRegForValue(C); 54447c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->CopyValueToVirtualRegister(C, RegOut); 54451c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 54468c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner Reg = RegOut; 54478c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } else { 54487c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Reg = FuncInfo->ValueMap[PHIOp]; 54498c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner if (Reg == 0) { 54508c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner assert(isa<AllocaInst>(PHIOp) && 54517c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->StaticAllocaMap.count(cast<AllocaInst>(PHIOp)) && 54528c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner "Didn't codegen value into a register!??"); 54537c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Reg = FuncInfo->CreateRegForValue(PHIOp); 54547c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->CopyValueToVirtualRegister(PHIOp, Reg); 54557e02151ce2686687446ba7293e66d6b096106e68Chris Lattner } 54561c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 54578c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner 54588c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // Remember that this register needs to added to the machine PHI node as 54598c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner // the input for this MBB. 54606f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman SmallVector<MVT, 4> ValueVTs; 54616f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman ComputeValueVTs(TLI, PN->getType(), ValueVTs); 54626f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned vti = 0, vte = ValueVTs.size(); vti != vte; ++vti) { 54636f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman MVT VT = ValueVTs[vti]; 54646f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman unsigned NumRegisters = TLI.getNumRegisters(VT); 54656f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman for (unsigned i = 0, e = NumRegisters; i != e; ++i) 54667c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->PHINodesToUpdate.push_back(std::make_pair(MBBI++, Reg+i)); 54676f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman Reg += NumRegisters; 54686f498b0a8eeb69a9aa20319e2c803b1d58525547Dan Gohman } 54698c494ab759266322aa05d5e99af9c05eb0d44576Chris Lattner } 54701c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 54717c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->ConstantsOut.clear(); 54721c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 54731c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Lower the terminator after the copies are emitted. 54747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visit(*LLVMBB->getTerminator()); 5475f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman} 5476f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5477f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::SelectBasicBlock(BasicBlock *LLVMBB, 5478f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator Begin, 54795edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman BasicBlock::iterator End) { 54807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 5481f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5482f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman MachineModuleInfo *MMI = CurDAG->getMachineModuleInfo(); 5483f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5484f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (MMI && BB->isLandingPad()) { 5485f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Add a label to mark the beginning of the landing pad. Deletion of the 5486f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // landing pad can thus be detected via the MachineModuleInfo. 5487f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned LabelID = MMI->addLandingPad(BB); 5488f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->setRoot(CurDAG->getLabel(ISD::EH_LABEL, 5489f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->getEntryNode(), LabelID)); 5490f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5491f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Mark exception register as live in. 5492f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned Reg = TLI.getExceptionAddressRegister(); 5493f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Reg) BB->addLiveIn(Reg); 5494f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5495f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Mark exception selector register as live in. 5496f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Reg = TLI.getExceptionSelectorRegister(); 5497f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Reg) BB->addLiveIn(Reg); 5498f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5499f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // FIXME: Hack around an exception handling flaw (PR1508): the personality 5500f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // function and list of typeids logically belong to the invoke (or, if you 5501f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // like, the basic block containing the invoke), and need to be associated 5502f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // with it in the dwarf exception handling tables. Currently however the 5503f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // information is provided by an intrinsic (eh.selector) that can be moved 5504f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // to unexpected places by the optimizers: if the unwind edge is critical, 5505f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // then breaking it can result in the intrinsics being in the successor of 5506f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // the landing pad, not the landing pad itself. This results in exceptions 5507f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // not being caught because no typeids are associated with the invoke. 5508f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // This may not be the only way things can go wrong, but it is the only way 5509f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // we try to work around for the moment. 5510f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BranchInst *Br = dyn_cast<BranchInst>(LLVMBB->getTerminator()); 5511f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5512f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Br && Br->isUnconditional()) { // Critical edge? 5513f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator I, E; 5514f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman for (I = LLVMBB->begin(), E = --LLVMBB->end(); I != E; ++I) 5515f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (isSelector(I)) 5516f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman break; 5517f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5518f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (I == E) 5519f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // No catch info found - try to extract some from the successor. 55207c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman copyCatchInfo(Br->getSuccessor(0), LLVMBB, MMI, *FuncInfo); 5521f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5522f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5523f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5524f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Lower all of the non-terminator instructions. 5525f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman for (BasicBlock::iterator I = Begin; I != End; ++I) 5526f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!isa<TerminatorInst>(I)) 55277c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visit(*I); 5528f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5529f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Ensure that all instructions which are used outside of their defining 5530f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // blocks are available as virtual registers. Invoke is handled elsewhere. 5531f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman for (BasicBlock::iterator I = Begin; I != End; ++I) 5532f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!I->use_empty() && !isa<PHINode>(I) && !isa<InvokeInst>(I)) { 55337c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DenseMap<const Value*,unsigned>::iterator VMI =FuncInfo->ValueMap.find(I); 55347c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (VMI != FuncInfo->ValueMap.end()) 55357c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->CopyValueToVirtualRegister(I, VMI->second); 5536f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5537f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5538f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Handle PHI nodes in successor blocks. 5539d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman if (End == LLVMBB->end()) 55407c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman HandlePHINodesInSuccessorBlocks(LLVMBB); 55414198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 5542a651cf67b77cd477dd7da4baa8688af2ccd4f7f6Chris Lattner // Make sure the root of the DAG is up-to-date. 55437c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getControlRoot()); 5544c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer 5545c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // Check whether calls in this block are real tail calls. Fix up CALL nodes 5546c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // with correct tailcall attribute so that the target can rely on the tailcall 5547c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // attribute indicating whether the call is really eligible for tail call 5548c85e1716f0e45e4c18a9ef2fbe431a51ac3a4252Arnold Schwaighofer // optimization. 5549f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CheckDAGForTailCallsAndFixThem(*CurDAG, TLI); 5550f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5551f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Final step, emit the lowered DAG as machine code. 5552f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 55537c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 55541c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 55551c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5556f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::ComputeLiveOutVRegInfo() { 5557ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallPtrSet<SDNode*, 128> VisitedNodes; 5558ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SmallVector<SDNode*, 128> Worklist; 5559ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5560ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(CurDAG->getRoot().getNode()); 5561ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5562ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt Mask; 5563ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownZero; 5564ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner APInt KnownOne; 5565ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5566ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner while (!Worklist.empty()) { 5567ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner SDNode *N = Worklist.back(); 5568ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Worklist.pop_back(); 5569ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5570ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If we've already seen this node, ignore it. 5571ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!VisitedNodes.insert(N)) 5572ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5573ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5574ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Otherwise, add all chain operands to the worklist. 5575ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) 5576ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOperand(i).getValueType() == MVT::Other) 5577ba36cb5242eb02b12b277f82b9efe497f7da4d7fGabor Greif Worklist.push_back(N->getOperand(i).getNode()); 5578ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5579ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // If this is a CopyToReg with a vreg dest, process it. 5580ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (N->getOpcode() != ISD::CopyToReg) 5581ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5582ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5583ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner unsigned DestReg = cast<RegisterSDNode>(N->getOperand(1))->getReg(); 5584ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!TargetRegisterInfo::isVirtualRegister(DestReg)) 5585ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5586ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5587ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Ignore non-scalar or non-integer values. 5588475871a144eb604ddaf37503397ba0941442e5fbDan Gohman SDValue Src = N->getOperand(2); 5589ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner MVT SrcVT = Src.getValueType(); 5590ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (!SrcVT.isInteger() || SrcVT.isVector()) 5591ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner continue; 5592ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5593f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman unsigned NumSignBits = CurDAG->ComputeNumSignBits(Src); 5594ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner Mask = APInt::getAllOnesValue(SrcVT.getSizeInBits()); 5595f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->ComputeMaskedBits(Src, Mask, KnownZero, KnownOne); 5596ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5597ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner // Only install this information if it tells us something. 5598ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (NumSignBits != 1 || KnownZero != 0 || KnownOne != 0) { 5599ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner DestReg -= TargetRegisterInfo::FirstVirtualRegister; 5600f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman FunctionLoweringInfo &FLI = CurDAG->getFunctionLoweringInfo(); 5601ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner if (DestReg >= FLI.LiveOutRegInfo.size()) 5602ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FLI.LiveOutRegInfo.resize(DestReg+1); 5603ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner FunctionLoweringInfo::LiveOutInfo &LOI = FLI.LiveOutRegInfo[DestReg]; 5604ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.NumSignBits = NumSignBits; 5605ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownOne = NumSignBits; 5606ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner LOI.KnownZero = NumSignBits; 5607ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5608ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner } 5609ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner} 5610ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5611f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohmanvoid SelectionDAGISel::CodeGenAndEmitDAG() { 5612462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string GroupName; 5613462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) 5614462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman GroupName = "Instruction Selection and Scheduling"; 5615462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman std::string BlockName; 5616462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewDAGCombine1 || ViewLegalizeTypesDAGs || ViewLegalizeDAGs || 5617462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman ViewDAGCombine2 || ViewISelDAGs || ViewSchedDAGs || ViewSUnitDAGs) 5618f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BlockName = CurDAG->getMachineFunction().getFunction()->getName() + ':' + 5619462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman BB->getBasicBlock()->getName(); 5620462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5621462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Initial selection DAG:\n"; 5622f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5623462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5624f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine1) CurDAG->viewGraph("dag-combine1 input for " + BlockName); 5625417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5626af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in pre-legalize mode. 5627ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 56285e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 1", GroupName); 5629f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Combine(false, *AA, Fast); 5630ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5631f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Combine(false, *AA, Fast); 5632ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 56332300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5634417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized lowered selection DAG:\n"; 5635f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5636f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands 56371c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // Second step, hack on the DAG until it only uses operations and types that 56381c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // the target supports. 5639f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands if (EnableLegalizeTypes) {// Enable this some day. 5640f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeTypesDAGs) CurDAG->viewGraph("legalize-types input for " + 5641f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BlockName); 5642462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5643462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (TimePassesIsEnabled) { 5644462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman NamedRegionTimer T("Type Legalization", GroupName); 5645f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->LegalizeTypes(); 5646462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } else { 5647f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->LegalizeTypes(); 5648462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman } 5649462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5650462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Type-legalized selection DAG:\n"; 5651f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5652462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 565370587ea813986bb0dbef71610091d496e28c22a6Chris Lattner // TODO: enable a dag combine pass here. 565470587ea813986bb0dbef71610091d496e28c22a6Chris Lattner } 5655f00e74f4d64385e6b2ee29887114e7c8abdf1f17Duncan Sands 5656f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewLegalizeDAGs) CurDAG->viewGraph("legalize input for " + BlockName); 5657462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5658ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 56595e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Legalization", GroupName); 5660f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Legalize(); 5661ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5662f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Legalize(); 5663ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5664f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5665832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Legalized selection DAG:\n"; 5666f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5667f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5668f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewDAGCombine2) CurDAG->viewGraph("dag-combine2 input for " + BlockName); 5669462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5670af21d55aee8d6852fedfd630395a3c7c95df8f12Chris Lattner // Run the DAG combiner in post-legalize mode. 5671ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 56725e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("DAG Combining 2", GroupName); 5673f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Combine(true, *AA, Fast); 5674ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5675f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CurDAG->Combine(true, *AA, Fast); 5676ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 56772300f5504643eaddc307d3db8a3ccd224c4fa251Nate Begeman 5678417e11b9bf625b3626f8765d44248927fb200906Dan Gohman DOUT << "Optimized legalized selection DAG:\n"; 5679f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5680417e11b9bf625b3626f8765d44248927fb200906Dan Gohman 5681f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewISelDAGs) CurDAG->viewGraph("isel input for " + BlockName); 5682ead0d88ad7659dabd66cc3149af97d98256fca84Chris Lattner 5683925a7e8ed6522f291b4ae559ccfa56db461016e3Dan Gohman if (!Fast && EnableValueProp) 5684f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ComputeLiveOutVRegInfo(); 5685552c4a849422ad91fa9988255ae35aebbf3acf7bEvan Cheng 5686a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Third, instruction select all of the operations to machine code, adding the 5687a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // code to the MachineBasicBlock. 5688ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 56895e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Selection", GroupName); 5690f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelect(); 5691ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 5692f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelect(); 5693ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5694db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5695462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman DOUT << "Selected selection DAG:\n"; 5696f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(CurDAG->dump()); 5697462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5698f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (ViewSchedDAGs) CurDAG->viewGraph("scheduler input for " + BlockName); 5699462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 57005e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Schedule machine code. 57015e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman ScheduleDAG *Scheduler; 57025e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 57035e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling", GroupName); 5704f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Scheduler = Schedule(); 57055e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 5706f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Scheduler = Schedule(); 57075e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 57085e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 5709462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman if (ViewSUnitDAGs) Scheduler->viewGraph(); 5710462dc7f4960e5074ddf4769ec8b2ef1ba7a4d2c8Dan Gohman 5711db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // Emit machine code to BB. This can change 'BB' to the last block being 5712db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng // inserted into. 5713ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng if (TimePassesIsEnabled) { 57145e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Creation", GroupName); 57155e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 5716ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } else { 57175e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman BB = Scheduler->EmitSchedule(); 57185e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } 57195e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman 57205e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman // Free the scheduler state. 57215e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman if (TimePassesIsEnabled) { 57225e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman NamedRegionTimer T("Instruction Scheduling Cleanup", GroupName); 57235e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 57245e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman } else { 57255e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman delete Scheduler; 5726ebffb660a68384dd8b5e2ff36d68e94a3920611bEvan Cheng } 5727db8d56b825efeb576d67b9dbe39d736d93306222Evan Cheng 5728832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling DOUT << "Selected machine code:\n"; 57291c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner DEBUG(BB->dump()); 5730f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman} 5731f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 57327c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohmanvoid SelectionDAGISel::SelectAllBasicBlocks(Function &Fn, MachineFunction &MF) { 573339fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng for (Function::iterator I = Fn.begin(), E = Fn.end(); I != E; ++I) { 573439fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng BasicBlock *LLVMBB = &*I; 57357c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = FuncInfo->MBBMap[LLVMBB]; 5736f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5737f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator Begin = LLVMBB->begin(); 5738f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman BasicBlock::iterator End = LLVMBB->end(); 57395edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman 57405edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Lower any arguments needed in this block if this is the entry block. 57415edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) 57425edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman LowerArguments(LLVMBB); 5743f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5744f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Before doing SelectionDAG ISel, see if FastISel has been requested. 5745f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // FastISel doesn't support EH landing pads, which require special handling. 5746f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (EnableFastISel && !BB->isLandingPad()) { 57477c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (FastISel *F = TLI.createFastISel(*FuncInfo->MF)) { 57485edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Emit code for any incoming arguments. This must happen before 57495edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // beginning FastISel on the entry block. 57505edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman if (LLVMBB == &Fn.getEntryBlock()) { 57515edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman CurDAG->setRoot(SDL->getControlRoot()); 57525edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman CodeGenAndEmitDAG(); 57535edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman SDL->clear(); 57545edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman } 57555edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman // Do FastISel on as many instructions as possible. 5756f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman while (Begin != End) { 57577c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Begin = F->SelectInstructions(Begin, End, FuncInfo->ValueMap, 57587c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FuncInfo->MBBMap, BB); 5759f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 576099b218218c0ca3ebfdd568ddfeafa07842e9d69dDan Gohman // If the "fast" selector selected the entire block, we're done. 5761f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Begin == End) 5762f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman break; 5763f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 576499b218218c0ca3ebfdd568ddfeafa07842e9d69dDan Gohman // Next, try calling the target to attempt to handle the instruction. 576599b218218c0ca3ebfdd568ddfeafa07842e9d69dDan Gohman if (F->TargetSelectInstruction(Begin, FuncInfo->ValueMap, 576699b218218c0ca3ebfdd568ddfeafa07842e9d69dDan Gohman FuncInfo->MBBMap, BB)) 576799b218218c0ca3ebfdd568ddfeafa07842e9d69dDan Gohman continue; 576899b218218c0ca3ebfdd568ddfeafa07842e9d69dDan Gohman 5769f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Handle certain instructions as single-LLVM-Instruction blocks. 5770f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (isa<CallInst>(Begin) || isa<LoadInst>(Begin) || 5771f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman isa<StoreInst>(Begin)) { 5772f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (Begin->getType() != Type::VoidTy) { 57737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman unsigned &R = FuncInfo->ValueMap[Begin]; 5774f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!R) 57757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman R = FuncInfo->CreateRegForValue(Begin); 5776f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5777f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 57785edd361497f4c78a20fcbb75c6e7e94ff8046ed1Dan Gohman SelectBasicBlock(LLVMBB, Begin, next(Begin)); 5779f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ++Begin; 5780f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman continue; 5781f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5782f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5783f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (!DisableFastISelAbort && 5784f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // For now, don't abort on non-conditional-branch terminators. 5785f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman (!isa<TerminatorInst>(Begin) || 5786f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman (isa<BranchInst>(Begin) && 5787f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman cast<BranchInst>(Begin)->isUnconditional()))) { 5788f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // The "fast" selector couldn't handle something and bailed. 5789f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // For the purpose of debugging, just abort. 5790f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman#ifndef NDEBUG 579199b218218c0ca3ebfdd568ddfeafa07842e9d69dDan Gohman Begin->dump(); 5792f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman#endif 5793f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman assert(0 && "FastISel didn't select the entire block"); 5794f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5795f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman break; 5796f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5797f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman delete F; 5798f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5799f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman } 5800f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5801d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // Run SelectionDAG instruction selection on the remainder of the block 5802d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // not handled by FastISel. If FastISel is not run, this is the entire 5803d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // block. If FastISel is run and happens to handle all of the 5804d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // LLVM Instructions in the block, [Begin,End) will be an empty range, 5805d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // but we still need to run this so that 5806d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // HandlePHINodesInSuccessorBlocks is called and any resulting code 5807d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman // is emitted. 5808d2ff647964ed242e67ac12f7d21a58c864309d95Dan Gohman SelectBasicBlock(LLVMBB, Begin, End); 5809381cb07544a2bc119e39969d7d508a6247773e1cEvan Cheng 58107c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman FinishBasicBlock(); 581139fd6e81b1b0de8b820155dc6a0dae226c109de6Evan Cheng } 58120e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman} 58130e5f1306b059b62d7725f324e087efbc8e7a782dDan Gohman 5814fed90b6d097d50881afb45e4d79f430db66dd741Dan Gohmanvoid 58157c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan GohmanSelectionDAGISel::FinishBasicBlock() { 58161c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner 5817f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman // Perform target specific isel post processing. 5818f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman InstructionSelectPostProcessing(); 5819f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman 5820f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DOUT << "Target-post-processed machine code:\n"; 5821f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman DEBUG(BB->dump()); 58224198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 58234198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov DOUT << "Total amount of phi nodes to update: " 58247c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman << SDL->PHINodesToUpdate.size() << "\n"; 58257c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DEBUG(for (unsigned i = 0, e = SDL->PHINodesToUpdate.size(); i != e; ++i) 58267c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman DOUT << "Node " << i << " : (" << SDL->PHINodesToUpdate[i].first 58277c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman << ", " << SDL->PHINodesToUpdate[i].second << ")\n";); 5828f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman 5829a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner // Next, now that we know what the last MBB the LLVM BB expanded is, update 58301c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner // PHI nodes in successors. 58317c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (SDL->SwitchCases.empty() && 58327c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->JTCases.empty() && 58337c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases.empty()) { 58347c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->PHINodesToUpdate.size(); i != e; ++i) { 58357c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineInstr *PHI = SDL->PHINodesToUpdate[i].first; 5836f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5837f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman "This is not a machine PHI node that we are updating!"); 58387c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[i].second, 58399ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 58409ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5841f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 58427c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->PHINodesToUpdate.clear(); 5843f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman return; 58441c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner } 58454198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 58467c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->BitTestCases.size(); i != e; ++i) { 58474198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Lower header first, if it wasn't already lowered 58487c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (!SDL->BitTestCases[i].Emitted) { 58494198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 58507c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->BitTestCases[i].Parent; 58517c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 58524198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 58537c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitBitTestHeader(SDL->BitTestCases[i]); 58547c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 5855f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 58567c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 58574198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 58584198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 58597c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned j = 0, ej = SDL->BitTestCases[i].Cases.size(); j != ej; ++j) { 58604198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 58617c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->BitTestCases[i].Cases[j].ThisBB; 58627c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 58634198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Emit the code 58644198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (j+1 != ej) 58657c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitBitTestCase(SDL->BitTestCases[i].Cases[j+1].ThisBB, 58667c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases[i].Reg, 58677c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases[i].Cases[j]); 58684198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov else 58697c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitBitTestCase(SDL->BitTestCases[i].Default, 58707c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases[i].Reg, 58717c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases[i].Cases[j]); 58724198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 58734198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 58747c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 5875f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 58767c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 58774198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 58784198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 58794198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // Update PHI Nodes 58807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned pi = 0, pe = SDL->PHINodesToUpdate.size(); pi != pe; ++pi) { 58817c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineInstr *PHI = SDL->PHINodesToUpdate[pi].first; 58824198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov MachineBasicBlock *PHIBB = PHI->getParent(); 58834198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov assert(PHI->getOpcode() == TargetInstrInfo::PHI && 58844198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov "This is not a machine PHI node that we are updating!"); 58854198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // This is "default" BB. We have two jumps to it. From "header" BB and 58864198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // from last "case" BB. 58877c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (PHIBB == SDL->BitTestCases[i].Default) { 58887c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, 58899ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 58907c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDL->BitTestCases[i].Parent)); 58917c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, 58929ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 58937c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDL->BitTestCases[i].Cases. 58949ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner back().ThisBB)); 58954198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 58964198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // One of "cases" BB. 58977c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned j = 0, ej = SDL->BitTestCases[i].Cases.size(); 58987c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman j != ej; ++j) { 58997c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineBasicBlock* cBB = SDL->BitTestCases[i].Cases[j].ThisBB; 59004198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov if (cBB->succ_end() != 59014198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov std::find(cBB->succ_begin(),cBB->succ_end(), PHIBB)) { 59027c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, 59039ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 59049ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(cBB)); 59054198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 59064198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 59074198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 59084198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 59097c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->BitTestCases.clear(); 59104198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov 59119453eea49bca1c3904047db495855c93e001d1cdNate Begeman // If the JumpTable record is filled in, then we need to emit a jump table. 59129453eea49bca1c3904047db495855c93e001d1cdNate Begeman // Updating the PHI nodes is tricky in this case, since we need to determine 59139453eea49bca1c3904047db495855c93e001d1cdNate Begeman // whether the PHI is a successor of the range check MBB or the jump table MBB 59147c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->JTCases.size(); i != e; ++i) { 59153a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Lower header first, if it wasn't already lowered 59167c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (!SDL->JTCases[i].first.Emitted) { 59173a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Set the current basic block to the mbb we wish to insert the code into 59187c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->JTCases[i].first.HeaderBB; 59197c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 59203a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov // Emit the code 59217c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitJumpTableHeader(SDL->JTCases[i].second, SDL->JTCases[i].first); 59227c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 5923f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 59247c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 59254198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov } 59263a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 592737efe6764568a3829fee26aba532283131d1a104Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 59287c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->JTCases[i].second.MBB; 59297c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 593037efe6764568a3829fee26aba532283131d1a104Nate Begeman // Emit the code 59317c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitJumpTable(SDL->JTCases[i].second); 59327c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 5933f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 59347c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 59353a84b9baf67c938454840d10d9e53269c755cd3eAnton Korobeynikov 593637efe6764568a3829fee26aba532283131d1a104Nate Begeman // Update PHI Nodes 59377c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned pi = 0, pe = SDL->PHINodesToUpdate.size(); pi != pe; ++pi) { 59387c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineInstr *PHI = SDL->PHINodesToUpdate[pi].first; 593937efe6764568a3829fee26aba532283131d1a104Nate Begeman MachineBasicBlock *PHIBB = PHI->getParent(); 594037efe6764568a3829fee26aba532283131d1a104Nate Begeman assert(PHI->getOpcode() == TargetInstrInfo::PHI && 594137efe6764568a3829fee26aba532283131d1a104Nate Begeman "This is not a machine PHI node that we are updating!"); 59424198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // "default" BB. We can go there only from header BB. 59437c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (PHIBB == SDL->JTCases[i].second.Default) { 59447c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, 59459ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 59467c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateMBB(SDL->JTCases[i].first.HeaderBB)); 5947f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman } 59484198c58c716cbe4516ac3a1a407a3cd52548bc3bAnton Korobeynikov // JT BB. Just iterate over successors here 5949f4360a478944af45d5f851a0903fbbfa44f520dcNate Begeman if (BB->succ_end() != std::find(BB->succ_begin(),BB->succ_end(), PHIBB)) { 59507c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pi].second, 59519ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 59529ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 595337efe6764568a3829fee26aba532283131d1a104Nate Begeman } 595437efe6764568a3829fee26aba532283131d1a104Nate Begeman } 595537efe6764568a3829fee26aba532283131d1a104Nate Begeman } 59567c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->JTCases.clear(); 595737efe6764568a3829fee26aba532283131d1a104Nate Begeman 5958b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // If the switch block involved a branch to one of the actual successors, we 5959b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner // need to update PHI nodes in that block. 59607c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->PHINodesToUpdate.size(); i != e; ++i) { 59617c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman MachineInstr *PHI = SDL->PHINodesToUpdate[i].first; 5962b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner assert(PHI->getOpcode() == TargetInstrInfo::PHI && 5963b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner "This is not a machine PHI node that we are updating!"); 5964b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner if (BB->isSuccessor(PHI->getParent())) { 59657c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman PHI->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[i].second, 59669ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner false)); 59679ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner PHI->addOperand(MachineOperand::CreateMBB(BB)); 5968b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5969b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner } 5970b2e806eecd85c98367f038817e742ef183dd9f87Chris Lattner 5971f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // If we generated any switch lowering information, build and codegen any 5972f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // additional DAGs necessary. 59737c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman for (unsigned i = 0, e = SDL->SwitchCases.size(); i != e; ++i) { 5974f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Set the current basic block to the mbb we wish to insert the code into 59757c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman BB = SDL->SwitchCases[i].ThisBB; 59767c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->setCurrentBasicBlock(BB); 5977d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5978f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman // Emit the code 59797c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->visitSwitchCase(SDL->SwitchCases[i]); 59807c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman CurDAG->setRoot(SDL->getRoot()); 5981f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman CodeGenAndEmitDAG(); 59827c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->clear(); 5983d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 5984d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Handle any PHI nodes in successors of this chunk, as if we were coming 5985d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // from the original BB before switch expansion. Note that PHI nodes can 5986d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // occur multiple times in PHINodesToUpdate. We have to be very careful to 5987d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // handle them the right number of times. 59887c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman while ((BB = SDL->SwitchCases[i].TrueBB)) { // Handle LHS and RHS. 5989d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (MachineBasicBlock::iterator Phi = BB->begin(); 5990d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner Phi != BB->end() && Phi->getOpcode() == TargetInstrInfo::PHI; ++Phi){ 5991d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // This value for this PHI node is recorded in PHINodesToUpdate, get it. 5992d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner for (unsigned pn = 0; ; ++pn) { 59937c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman assert(pn != SDL->PHINodesToUpdate.size() && 59947c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman "Didn't find PHI entry!"); 59957c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (SDL->PHINodesToUpdate[pn].first == Phi) { 59967c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Phi->addOperand(MachineOperand::CreateReg(SDL->PHINodesToUpdate[pn]. 59979ce2e9d5a07cb3e0176cb32838231243829d67c5Chris Lattner second, false)); 59987c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman Phi->addOperand(MachineOperand::CreateMBB(SDL->SwitchCases[i].ThisBB)); 5999d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner break; 6000d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 6001d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner } 6002f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 6003d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 6004d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // Don't process RHS if same block as LHS. 60057c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman if (BB == SDL->SwitchCases[i].FalseBB) 60067c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->SwitchCases[i].FalseBB = 0; 6007d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner 6008d5e93c07957844e3086fb12d686b93dbbd2524c2Chris Lattner // If we haven't handled the RHS, do so now. Otherwise, we're done. 60097c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->SwitchCases[i].TrueBB = SDL->SwitchCases[i].FalseBB; 60107c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->SwitchCases[i].FalseBB = 0; 6011f15485a8d0dff5f720b7ad27346129ac5c3ec503Nate Begeman } 60127c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman assert(SDL->SwitchCases[i].TrueBB == 0 && SDL->SwitchCases[i].FalseBB == 0); 6013a33ef4816d2c192e36e7c025d18c66e89ef9d311Chris Lattner } 60147c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->SwitchCases.clear(); 60157c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman 60167c3234c6be0dc0bdf4b5d6f848cd728a77f349d7Dan Gohman SDL->PHINodesToUpdate.clear(); 60171c08c714bb3d07c3b39f06bfcbb4559fefca73f9Chris Lattner} 6018a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng 601913ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 60205e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// Schedule - Pick a safe ordering for instructions for each 6021a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng/// target node in the graph. 60225e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman/// 6023f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanScheduleDAG *SelectionDAGISel::Schedule() { 6024eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey RegisterScheduler::FunctionPassCtor Ctor = RegisterScheduler::getDefault(); 602513ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 602613ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey if (!Ctor) { 6027eb577ba3b815a1fa4627b060dd2345d17abf672dJim Laskey Ctor = ISHeuristic; 60289373beba6010dd34316a801c3a9b37ab9e048031Jim Laskey RegisterScheduler::setDefault(Ctor); 60294ef10867499aa146cd819c78d8d37a8353d4f0ffEvan Cheng } 603013ec702c430b91ee49b9e6d9581cd95412f216c8Jim Laskey 6031f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman ScheduleDAG *Scheduler = Ctor(this, CurDAG, BB, Fast); 60325e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman Scheduler->Run(); 60333e1a7aef17575d9c7058a035449d57e3c7295ed0Dan Gohman 60345e84368b26415b3bb7f3f8d9cff3e05938dd82d0Dan Gohman return Scheduler; 6035a9c2091cd38e401c846391c9951ff416e709b65eEvan Cheng} 60360e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 603703fc53c174e654adae4e42a0c352c7937de2cd87Chris Lattner 60389ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim LaskeyHazardRecognizer *SelectionDAGISel::CreateTargetHazardRecognizer() { 60399ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey return new HazardRecognizer(); 60409ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey} 60419ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 6042755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 6043755480681c795d585c73556c028b6143c46bda86Chris Lattner// Helper functions used by the generated instruction selector. 6044755480681c795d585c73556c028b6143c46bda86Chris Lattner//===----------------------------------------------------------------------===// 6045755480681c795d585c73556c028b6143c46bda86Chris Lattner// Calls to these methods are generated by tblgen. 6046755480681c795d585c73556c028b6143c46bda86Chris Lattner 6047755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckAndMask - The isel is trying to match something like (and X, 255). If 6048755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 6049755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an AND, and DesiredMaskS is the value 6050755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 6051475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanbool SelectionDAGISel::CheckAndMask(SDValue LHS, ConstantSDNode *RHS, 6052dc9b3d0bb5ed3a3f59cad61e264f0ec43c946459Dan Gohman int64_t DesiredMaskS) const { 60532e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 60542e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 6055755480681c795d585c73556c028b6143c46bda86Chris Lattner 6056755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 6057755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 6058755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 6059755480681c795d585c73556c028b6143c46bda86Chris Lattner 6060755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 60612e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 6062755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 6063755480681c795d585c73556c028b6143c46bda86Chris Lattner 6064755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 6065755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 60662e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 6067ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman if (CurDAG->MaskedValueIsZero(LHS, NeededMask)) 6068755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 6069755480681c795d585c73556c028b6143c46bda86Chris Lattner 6070755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 6071755480681c795d585c73556c028b6143c46bda86Chris Lattner 6072755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 6073755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 6074755480681c795d585c73556c028b6143c46bda86Chris Lattner} 6075755480681c795d585c73556c028b6143c46bda86Chris Lattner 6076755480681c795d585c73556c028b6143c46bda86Chris Lattner/// CheckOrMask - The isel is trying to match something like (or X, 255). If 6077755480681c795d585c73556c028b6143c46bda86Chris Lattner/// the dag combiner simplified the 255, we still want to match. RHS is the 6078755480681c795d585c73556c028b6143c46bda86Chris Lattner/// actual value in the DAG on the RHS of an OR, and DesiredMaskS is the value 6079755480681c795d585c73556c028b6143c46bda86Chris Lattner/// specified in the .td file (e.g. 255). 6080475871a144eb604ddaf37503397ba0941442e5fbDan Gohmanbool SelectionDAGISel::CheckOrMask(SDValue LHS, ConstantSDNode *RHS, 60812e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman int64_t DesiredMaskS) const { 60822e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &ActualMask = RHS->getAPIntValue(); 60832e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman const APInt &DesiredMask = APInt(LHS.getValueSizeInBits(), DesiredMaskS); 6084755480681c795d585c73556c028b6143c46bda86Chris Lattner 6085755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual mask exactly matches, success! 6086755480681c795d585c73556c028b6143c46bda86Chris Lattner if (ActualMask == DesiredMask) 6087755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 6088755480681c795d585c73556c028b6143c46bda86Chris Lattner 6089755480681c795d585c73556c028b6143c46bda86Chris Lattner // If the actual AND mask is allowing unallowed bits, this doesn't match. 60902e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman if (ActualMask.intersects(~DesiredMask)) 6091755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 6092755480681c795d585c73556c028b6143c46bda86Chris Lattner 6093755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, the DAG Combiner may have proven that the value coming in is 6094755480681c795d585c73556c028b6143c46bda86Chris Lattner // either already zero or is not demanded. Check for known zero input bits. 60952e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt NeededMask = DesiredMask & ~ActualMask; 6096755480681c795d585c73556c028b6143c46bda86Chris Lattner 60972e68b6f52d0979575b2f02ed29717d907ba0684cDan Gohman APInt KnownZero, KnownOne; 6098ea859be53ca13a1547c4675549946b74dc3c6f41Dan Gohman CurDAG->ComputeMaskedBits(LHS, NeededMask, KnownZero, KnownOne); 6099755480681c795d585c73556c028b6143c46bda86Chris Lattner 6100755480681c795d585c73556c028b6143c46bda86Chris Lattner // If all the missing bits in the or are already known to be set, match! 6101755480681c795d585c73556c028b6143c46bda86Chris Lattner if ((NeededMask & KnownOne) == NeededMask) 6102755480681c795d585c73556c028b6143c46bda86Chris Lattner return true; 6103755480681c795d585c73556c028b6143c46bda86Chris Lattner 6104755480681c795d585c73556c028b6143c46bda86Chris Lattner // TODO: check to see if missing bits are just not demanded. 6105755480681c795d585c73556c028b6143c46bda86Chris Lattner 6106755480681c795d585c73556c028b6143c46bda86Chris Lattner // Otherwise, this pattern doesn't match. 6107755480681c795d585c73556c028b6143c46bda86Chris Lattner return false; 6108755480681c795d585c73556c028b6143c46bda86Chris Lattner} 6109755480681c795d585c73556c028b6143c46bda86Chris Lattner 61109ff542f2cce5bf7bf3cf9f692cf3ec0690ad2b3bJim Laskey 61110e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// SelectInlineAsmMemoryOperands - Calls to this are automatically generated 61120e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner/// by tblgen. Others should not call it. 61130e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattnervoid SelectionDAGISel:: 6114f350b277f32d7d47f86c0e54f4aec4d470500618Dan GohmanSelectInlineAsmMemoryOperands(std::vector<SDValue> &Ops) { 6115475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> InOps; 61160e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner std::swap(InOps, Ops); 61170e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 61180e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[0]); // input chain. 61190e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps[1]); // input asm string. 61200e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 61210e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned i = 2, e = InOps.size(); 61220e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (InOps[e-1].getValueType() == MVT::Flag) 61230e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner --e; // Don't process a flag operand if it is here. 61240e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 61250e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner while (i != e) { 61260e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner unsigned Flags = cast<ConstantSDNode>(InOps[i])->getValue(); 61270e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if ((Flags & 7) != 4 /*MEM*/) { 61280e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Just skip over this operand, copying the operands verbatim. 61290e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), InOps.begin()+i, InOps.begin()+i+(Flags >> 3) + 1); 61300e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += (Flags >> 3) + 1; 61310e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } else { 61320e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner assert((Flags >> 3) == 1 && "Memory operand with multiple values?"); 61330e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Otherwise, this is a memory operand. Ask the target to select it. 6134475871a144eb604ddaf37503397ba0941442e5fbDan Gohman std::vector<SDValue> SelOps; 6135f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman if (SelectInlineAsmMemoryOperand(InOps[i+1], 'm', SelOps)) { 6136832171cb9724d2d31c8dfb73172e2be8f6dd13eeBill Wendling cerr << "Could not match memory address. Inline asm failure!\n"; 61370e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner exit(1); 61380e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 61390e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 61400e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add this to the output node. 6141f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman MVT IntPtrTy = CurDAG->getTargetLoweringInfo().getPointerTy(); 6142f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman Ops.push_back(CurDAG->getTargetConstant(4/*MEM*/ | (SelOps.size() << 3), 6143f350b277f32d7d47f86c0e54f4aec4d470500618Dan Gohman IntPtrTy)); 61440e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.insert(Ops.end(), SelOps.begin(), SelOps.end()); 61450e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner i += 2; 61460e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 61470e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner } 61480e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner 61490e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner // Add the flag input back if present. 61500e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner if (e != InOps.size()) 61510e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner Ops.push_back(InOps.back()); 61520e43f2ba114df7bfc1f70d0ef62b663f6ea4c09dChris Lattner} 6153794fd75c67a2cdc128d67342c6d88a504d186896Devang Patel 61541997473cf72957d0e70322e2fe6fe2ab141c58a6Devang Patelchar SelectionDAGISel::ID = 0; 6155